The food mart grocery store has a candy machine. each time a customer inserts a quarter, 7 candies come out of the machine. the machine holds 15 pounds of candy. each pound of candy contains about 180 individual candies. assume the number of candies is never less than zero.
1. about how many candies are in the machine when it’s full?
2.write a recursive formula to represent the number of candies remaining in the machine.
3.write an explicit formula to represent the number of candies remaining in the machine for any number of customers

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

-12 > a

step-by-step explanation:

-11 > 1 + a

subtract 1 from each side

-11 -1> 1 -1+ a

-12 > a

not sure but it may be b, as i said i'm not sure.