Three friends, ana, jack and nick come together to purchase a special from a pizza place. it is a half pepperoni, half mushrooms pizza. unknown to the others, nick does not like mushroom pizza at all; ana likes pepperoni as much as she likes mushrooms; jack likes mushrooms twice as much as he likes pepperoni. they decide to use the cut and choose method. ana cuts in the first round and jack chooses. nick enters the second round. carry out the fair division, exploring at least two different choices in the first round.

Paula would choose the side with all of the mushrooms and half of the pepperoni. She wont choose any sausage because she doesn't like it, but luckily David likes sausage twice as much as mushroom so he's fine with getting all of the sausage and half of the pepperoni. They both equally like pepperoni so it makes sense for them to share.

too many. (jk)

31 v bucks

step-by-step explanation:

since you bought 25 on friday and 6 on tuesday, you can just add them up.

25+6=31

check your work.

31-6=25

i hope this !

-yand3r3

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.