#Develop a recurrence relation from an explicit formula
12 messages · Page 1 of 1 (latest)
chatgpt has given me 3 different answers
@dark pasture the most natural would be to multiply a(n) by 2 and express in terms of a(n+1)
i dont exactly understand what u mean
are any of these correct?
Just multiply by 2 both parts of your equality
Thats what they did in the first variant
u are saying the first image is correct?
?
What do you understand about recurrences?
not much