Answer:
- 2700 candies
- c(0) = 2700; c(n) = c(n-1) -7
- c(n) = 2700 -7n
- 2693, 2686, 2679
Step-by-step explanation:
1. The number of candies in the machine is the product of the number of pounds of candy and the number of candies in a pound:
(15 lbs)(180 candies/lb) = 2700 candies
__
2. c(0) = 2700; c(n) = c(n-1) -7 . . . . the new number of candies is 7 fewer than after the previous customer. After no customers, the number is the original 2700 candies.
__
3. As the recursive formula tells us, the initial number of candies is 2700, and the number decreases at the rate of 7 per customer. The number remaining after n customers is ...
c(n) = 2700 -7n
__
4. Evaluating the above formula for n=1, 2, 3, we get ...
c(1) = 2700 -7 = 2693 . . . . candies remaining after 1 customer
c(2) = 2700 -7·2 = 2686 . . . 2 customers
c(3) = 2700 -7·3 = 2679 . . . 3 customers
Answer:
$2.57
Step-by-step explanation:
divide 5,140 by 20,
5,140/20=257=2.57
Answer:
-44
Step-by-step explanation:
To solve this problem, we use the tan function. The distance
across the river is the adjacent side, the distance drownstream is the opposite
side while the direction of the boat is the hypotenuse.
tan θ = opposite side / adjacent side
tan 10 = opposite side / 420 ft
opposite side = 74.06 ft
<span>Therefore the boat will move about 74 ft downstream.</span>