A playground is being designed where children can interact with their friends in certain combinations. If there is 1 child, there can be 0 interactions. If there are 2 children, there can be 3 interactions. If there are 3 children, there can be 12 interactions. If there are 4 children, there can be 39 interactions. Which recursive equation represents the pattern? an = an – 1 + 3(n – 1) an = an – 1 + 3(n – 1) an = an – 1 + (3n – 1) an = an – 1 + (n – 1)3
Gotta think on this one
a. an = a(n - 1) + 2(n - 1) a1 = 0 + 2*0 a2 = 0 + 2*1 = 2 fails at a2 b. an = a(n - 1) + (n - 1)^2 a1 = 0 + 0^2 = 0 a2 = 0 + 1^2 = 1 a3 = 1 + 2^2 = 5 a4 = 3 + 3^2 = 12 fails at a4
So...it's: d. an = a(n - 1) + (2n - 1)
Yes, she's right. That is the answer!
well no, but that's the formula method, I used a different amount of kids, but you should be able to solve now.
I just needed to know the recursive pattern
@aimee98 yes the formula is right :)
Yup. Medal? :O
listen @Pollylovesschool, thanks for wanting to help but you don't know what she is talking about.
Thanks, any other questions? ;]
@TheJonathanP4 the formula is right...she didn't give the answer...lol!
The yearly attendance at a local movie theater is 68,000 and grows continuously at a rate of 3.5% each year. What is the approximate attendance at the movie theater in eight years? 69,603 89,543 89,973 87,040
Okay, this is pretty simple. What's the first step here, Johnathan?
Hey, do you mind putting a question like that instead....it keeps mentioning me to come here?
@TheJonathanP4 do you know the first step?
Join our real-time social learning platform and learn together with your friends!