Please answer all ASAP (no explanation needed), extra points and will mark brainliest 1. After buying some bottle caps for $81.74, Peter has $6.74 left. How much money did Peter have to begin with?

2. Henry has $97.95 and Marilyn has $74.71. How much more does Henry have than Marilyn?

3. Helen has $84.51 and Joseph has $17.93. How much money do they have together?

4. Emily has $27.09 and David has $6.17. How much more does Emily have than David?

5. Cynthia has $74.45 and Amy has $38.44. How much more does Cynthia have than Amy?

6. After buying some Skittles for $71.18, Irene has $17.36 left. How much money did Irene have to begin with?

7. Steven has $98.25 and Joe has $4.97. How much money do they have together?

8. Ralph starts with $74.53 and spends $4.97 on candies. How much money does Ralph have left?

9. Christopher has $26.34 and Beverly has $4.15. How much money do they have together?

10. Eugene gives $2.89 to Sarah. If Eugene started with $56.03, how much money does he have left?

11. Keith has $56.49 and Theresa has $3.43. How much money do they have together?

12. Peter gives $20.85 to Nancy. If Peter started with $84.26, how much money does he have left?

13. Bruce has $67.72 and Charles has $29.62. How much more does Bruce have than Charles?

14. Sandra gives $9.13 to Stephen. If Sandra started with $11.66, how much money does she have left?

15. After buying some marbles for $93.52, Donald has $6.35 left. How much money did Donald have to begin with?

i dont really know

Step-by-step explanation:

the number of the people going.

step-by-step explanation:

the cost to buy one movie ticket is $7. if the total cost for the movie is a function of how many people go, then the input is : the number of the people going.

i think it's eleven too, don't woosh me here, but according to the "experts" it's 2.

the proof starts from the peano postulates, which define the natural

numbers n. n is the smallest set satisfying these postulates:

  p1.   1 is in n.

  p2.   if x is in n, then its "successor" x' is in n.

  p3.   there is no x such that x' = 1.

  p4.   if x isn't 1, then there is a y in n such that y' = x.

  p5.   if s is a subset of n, 1 is in s, and the implication

      (x in s => x' in s) holds, then s = n.

then you have to define addition recursively:

  def: let a and b be in n. if b = 1, then define a + b = a'

      (using p1 and p2). if b isn't 1, then let c' = b, with c in n

      (using p4), and define a + b = (a + c)'.

then you have to define 2:

  def:   2 = 1'

2 is in n by p1, p2, and the definition of 2.

theorem:   1 + 1 = 2

proof: use the first part of the definition of + with a = b = 1.

      then 1 + 1 = 1' = 2   q.e.d.

note: there is an alternate formulation of the peano postulates which

replaces 1 with 0 in p1, p3, p4, and p5. then you have to change the

definition of addition to this:

  def: let a and b be in n. if b = 0, then define a + b = a.

      if b isn't 0, then let c' = b, with c in n, and define

      a + b = (a + c)'.

you also have to define 1 = 0', and 2 = 1'. then the proof of the

theorem above is a little different:

proof: use the second part of the definition of + first:

      1 + 1 = (1 + 0)'

      now use the first part of the definition of + on the sum in

      parentheses:   1 + 1 = (1)' = 1' = 2   q.e.d.