Question

Please help!!!!!!!

Answer 1

Bill is able to save $35/week after working part-time and paying his expenses. These two formulas show his weekly savings:
1. f(1) = 35, f(n) = f(1) + f(n-1) for n > 1
2. 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.

Answer 2

If bill saves $35 per week he's a screw up. Sorry that I can't help you withh the real problem though.

Answer 3

thats ok

Answer 4

@beccaboo333

Answer 5

Sorry, I'm not very good with math. @kewlgeek555 and @bibby and @tHe_FiZiCx99 are good with Math, but they aren't on :/

Answer 6

okay, no prob. thanks for coming :)

Answer 7

@MathLegend

Answer 8

@whpalmer4

Answer 9

@satellite73

Answer 10

@Mertsj

Answer 11

1. f(1) = 35, f(n) = f(1) + f(n-1) for n > 1
this is a recursive function, as the tail of the equation refers back to the original equation

Answer 12

so 2 would therefore be the explicit function

Answer 13

which one is consider sequences?

Answer 14

@mathmale

Answer 15

you mean the 4th question...?
it seems unrelated to the previous parts
5, 6, 8, 11, 15, 20, 26, 33, 41
a function relates an input to an answer... so does this sequence of numbers have a relationship/ something in common?

Answer 16

actually it is question 1

Answer 17

"Which one of these formulas show the sequence written recursively and which shows it written explicitly? Justify your explanations."
they can both be sequences if you plug in different values for n...

Answer 18

can you help me with all these question @mathmale ?

Answer 19

okay, just with question, 2, 3 and 4

Answer 20

@shamil98

Answer 21

@ybarrap

Answer 22

@tester97

Answer 23

@Compassionate

Answer 24

@zale

Answer 25

f(n) = f(1) + f(n-1) for n > 1 is the recursive formula. How do I know that? Because each new term of the sequence depends upon the previous term.

Question #2
----------

n f(n)
-- ---
1 35 (this is given)
2 f(2)=f(1) + f(2-1) = 35 + 35 = 70
3 f(3) =f(1)+f(3-1) = f(1) + f(2) = 35 + 70 = 105
4 ?
5 ?


Please finish this. If you get stuck, ask questions to help yourself get unstuck.

Answer 26

okay thanks

Answer 27

I am working on it now. So I will send you a message when I m done