Ask your own question, for FREE!
Mathematics 16 Online
OpenStudy (anonymous):

I NEED MATH HELP!!!!!!!!!!! MEDALS WILL BE GIVEN!!!!!!

OpenStudy (anonymous):

Sure. Which math class do you need help in? (Algebra, Geometry...)

OpenStudy (anonymous):

Algebra

OpenStudy (anonymous):

Bill is able to save $35/week after working part-time and paying his expenses. These two formulas show his weekly savings: A.f(1) = 35, f(n) = f(1) + f(n-1) for n > 1 B.f(n) = 35n I.Which one of these formulas show the sequence written recursively and which shows it written explicitly? Justify your explanations. II.Use the recursive formula to make a table of values for 1 ≤ n ≤ 5. Show your calculations. Explain what your table means. III.Use any formula of your choice to find f(40). Explain why you chose that method and what your answer means. Show your calculations. IV. Given the sequence of numbers: 5, 6, 8, 11, 15, 20, 26, 33, 41,… Explain whether or not this sequence can be considered a function

OpenStudy (anonymous):

Ok. So for A, you need to find f(2) and the rule says, for n>1 (and here n is 2, so we use it): f(2) = f(1) + f(2-1) or f(2) = f(1)+f(1) It shows that f(1) is 35, so you get f(2) = 35+35 f(2) = 70

OpenStudy (anonymous):

I'm so sorry, but I'm not sure on the rest. :(

OpenStudy (da_scienceman):

I will say f(1)=35, f(n)=f(1)+f(n-1) for n> 1 is recursive...why? because I have a base case (i.e f(1)=1) and all other member of the sequence depend on this base case. The other one is explicit since I can generate the sequence by mere substitution (i.e for some n I can find 35n)...isnt it?

OpenStudy (da_scienceman):

not like other members depoend on it(in some sense they do, but we can generate f(2) from f(1), f(3) from f(2) etc) and u can see there is recursiveness in the sequence.

OpenStudy (da_scienceman):

I am sure u can answe II. U can choose the second formula to find f(49) since it is easy to calculate it without knowing the value of f(39)- if u chose the first formula, u might need to calculate all values of f until f(39) which is time consuming! The last one u must check to see if there is any pattern in which the members of the sequence can be generated.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!