Answer:
f(2)=5
f(5)=33
Step-by-step explanation:
The given formula, that recursively defines the sequence is
When n=1, we obtain;
When n=2, we get:
When n=3,
When n=4
When n=5,
To find the number of non-defective chips, we simply use this equation:
2,000 * 4/5
8000/5
Now you simply divide:
1600
1600 chips aren't defective
Answer:
A) None
Step-by-step explanation:
1) 
shoudnt neccesarily be a factor of nst, for example, if s = 3, t = 4, and n = 12, then both s and t are factors of n, but 
is not a factor of nst = 144.
2) 
shoudnt neccesarily be a factor of nst. Let s be 4, let t be 6, and let n be 12. Then n is a factor of both s and t, but 
is not a factor of nst = 12*24. In fact, it is a greater number.
3) Again, s+t isnt necessarily a factor of nst, let s be 2 and t be 3. Then both s and t are factor of n = 12. However 5 = s+t is not a factor of nst = 72.
So, neither of the three options is guaranteed to be a factor of nst. In fact, for s = 4, t = 6, and n = 12, none of the three options are valid.
If Maya only has $15 dollars to spend and she buys a notebook for $5.50 then that leaves her with $9.50 and if she has to save $7.75 then that leaves her with $1.75 and since she wants to buy cookies then you have to figure out how many cookies she can get with $1.75 plus the tax but food doesn't have tax so she can buy 7 packages of cookies since there only 25 cents is right on point at $1.75 I hope I answered your question with all the calculating I had to do and the typing I went through to explain it to you !!!!!!!!!!!!!!!!!!!!!!!! now could you please give me a thank you and hit the brain aster button please and thank you so much
if you do !!!!!!!
