Ask your own question, for FREE!
English 7 Online
OpenStudy (anonymous):

Hard math question. Please help me.

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 1) Which one of these formulas show the sequence written recursively, and which shows it written explicitly? Justify your explanations. 2) Use the recursive formula to make a table of values for 1 ≤ n ≤ 5. Show your calculations. Explain what your table means. 3) Use any formula of your choice to find f(40). Explain why you chose that method and what your answer means. Show your calculations. 4) 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):

@jim_thompson5910

OpenStudy (anonymous):

@kirbykirby

OpenStudy (anonymous):

@ganeshie8

OpenStudy (anonymous):

@undeadknight26

undeadknight26 (undeadknight26):

@kirbykirby got this! Counting on you man!

OpenStudy (anonymous):

So what are you thinking for the first part because it just really confuses me. @kirbykirby

OpenStudy (jgirl128):

try posting this in the math section, you'll probably get more help/quicker answers :)

OpenStudy (kirbykirby):

Sorry I was afk for a bit. Looking at the question now..

OpenStudy (kirbykirby):

1) f(1) = 35, f(n) = f(1) + f(n-1) for n > 1 is the recursive formula, because finding a certain value f(n) requires knowing the value of f(n-1), and that would require knowing the value for f(n-2), all the way to f(1). You do not get an immediate answer by just plugging in n=something. When you plug in n=something, you will get something that still depends on (n-1). The formula only stops recursing once you reach n=1. The other one is explicit, because you immediately get a number when plug plug in a value for n. 2) \(n=1\): then \(f(1)=35\). This is already given. \(n=2: f(2)=f(1)+f(2-1)=35+f(1)=35+35=70\) \(n=3: f(3)=f(1)+f(3-1)=35+f(2)=35+70=135\) ... continue the same logic until n=5 (Do you see the nature of the recursive formula now? If I want to know f(3) right away, I need to know the value of f(2), and f(2) requires knowing f(1) ! ) 3) Based on question 2.. do you think it would be easier to find f(4) using the recursive formula, or the explicit formula??

OpenStudy (kirbykirby):

f(40)*

OpenStudy (kirbykirby):

Oops I definitely made a typo when I wrote 35 + 70 = 135, i meant 105 !

OpenStudy (anonymous):

That's alright lol I knew what you meant

OpenStudy (anonymous):

So for number three it would be easier to use the explicit formula

OpenStudy (kirbykirby):

definitely ;)

OpenStudy (anonymous):

Thank you so much!

OpenStudy (kirbykirby):

np =]

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!