help ASAP medals will be rewarded

Question

oleg3321 · Answer

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.

oleg3321 · Answer

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.

oleg3321 · Answer

@brijackson6 @Sheraz12345 @study100

oleg3321 · Answer

please help

oleg3321 · Answer

@Sheraz12345  please help. its really ergent

sheraz12345 · Answer

I am looking into it ... plz wait ... if i am able to understand then i will tell u

oleg3321 · Answer

ok thank you

oleg3321 · Answer

@Sheraz12345 did you find out how to do it. please help me

anonymous · Answer

1. f(n) = f(1) + f(n-1) for n>1 is the recursive formula because it requires you to find the previous term(s) , f(n-1) in order to compute f(n).

anonymous · Answer

1cont. f(n) = 35 n is the explicit formula because it allows you to directly plug in numbers to find values of f(n).

anonymous · Answer

2. Use f(n) f(1) + f(n-1) and plug in 1,2,3,4,5, for n to find the values.
then you can make table of n II f(n)

anonymous · Answer

3. Use formula f(n) = 35 to calculate f(40) because you can calculate f(40) directly without calculate all the values from f(1) to f(39) using this explicit formula

oleg3321 · Answer

okay. so how would it look like? please show

oleg3321 · Answer

@study100

anonymous · Answer

Which one?

oleg3321 · Answer

my bad those are already all the answers right?

anonymous · Answer

I'm not sure if the last one is Fibonacci sequence for the last one.  Lemme check

anonymous · Answer

number 1 is answer.  
number 2, you need to do a little work by plugging in numbers.

oleg3321 · Answer

can you please show me how

oleg3321 · Answer

@study100 can you please help me finish the problem

anonymous · Answer

4. I'm not sure if the last one can be expressed as a function..  I checked Fibonacci, Geometric and arithmetic sequences but none seems to fit the sequence...
So my answer would be no for the last one.