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

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

OpenStudy (anonymous):

Bill is able to save $35/week after working part-time and paying his expenses. These two formulas show his weekly savings: f(1) = 35, f(n) = f(1) + f(n-1) for n > 1 f(n) = 35n Which one of these formulas show the sequence written recursively and which shows it written explicitly? Justify your explanations. Use the recursive formula to make a table of values for 1 ≤ n ≤ 5. Show your calculations. Explain what your table means. Use any formula of your choice to find f(40). Explain why you chose that method and what your answer means. Show your calculations. 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):

do you not understand the word problem or just the problem in general.

OpenStudy (anonymous):

?

OpenStudy (anonymous):

Oh! and I don't need a medal I simply enjoy helping people with math so only give me a medal if I can help relieve you of your math stress.

OpenStudy (anonymous):

As a explanation for this problem for those of you who do not understand this: This equation discusses an arithmetic sequences using the formulas included within the problem.

OpenStudy (anonymous):

well the formula names I mean

OpenStudy (anonymous):

so tell me how far how you gotten on the problem or do you simply do not understand this problem.

OpenStudy (anonymous):

if you don't understand it what do you not understand about it be specific please :)

OpenStudy (anonymous):

I don't understand any of it really. Sorry I didn't respond, I stepped away for a minute

OpenStudy (anonymous):

alright I don't need a medal really but if I can explain this problem to you well then will be willing to join a free open math community that gives rewards for doing math if you win their competitions.

OpenStudy (anonymous):

Ok

OpenStudy (anonymous):

Okay before we start I recommend watch a video on sec.

OpenStudy (anonymous):

Ok

OpenStudy (anonymous):

Well now I understand the first one. I just need help with the rest now. I appreciate your help.

OpenStudy (anonymous):

use this rule A. f(1) = 35, f(n) = f(1) + f(n-1) for n > 1 make a table n | f(n) ----------- 1 | 35 2 | ? you need to find f(2) the rule says, for n>1 (and here n is 2, so we use it) f(n) = f(1)+ f(n-1) replace n with 2: f(2) = f(1) + f(2-1) or f(2) = f(1)+f(1) from the table, we see f(1) is 35, so you get f(2) = 35+35 f(2) = 70

OpenStudy (anonymous):

Ok, thank you SOOOO much!!!

OpenStudy (anonymous):

np :D

OpenStudy (anonymous):

anytime u need help let me no

undeadknight26 (undeadknight26):

do you need more help?

OpenStudy (anonymous):

ty guys for all the medals!

OpenStudy (anonymous):

Yes, I need help with… Use any formula of your choice to find f(40). Explain why you chose that method and what your answer means. Show your calculations. and… 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):

No prob ;)

OpenStudy (anonymous):

plz post as a dif question :)

OpenStudy (anonymous):

Ok

undeadknight26 (undeadknight26):

hmm this looks like a funtion because it goes up a strict amount each time.

undeadknight26 (undeadknight26):

function*

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!