In the small town of Middleton, there are only two restaurants that serve pizza- a small family owned Italian restaurant and a new franchise pizza restaurant. In a recent review of the franchise, a food critic reported that the pizza was delicious as promised. The only negative review that the franchise received from the critic was in reference to the inaccurate delivery time quoted during the online order process. In response to the article, the franchise owner used a program to analyze the online pizza orders that took place during the week before the review. He chose to track the orders at 6pm each day. He recorded his results in the frequency table below. Monday Tuesday Wednesday Thursday Friday
On Time ||| ||
Late | |||
Use the frequency table to create a box and whisker plot of the On-Time data values. In your final answer, include all calculations necessary to create the box and whisker plot.
Use the frequency table to create a box and whisker plot of the Late data values. In your final answer, include all calculations necessary to create the box and whisker plot.

$4034.40

the perimeter of the field is the sum of the lengths of the four sides:

47 yd + 158 yd + 47 yd + 158 yd = 410 yd

the cost of 3 ft (1 yd) of fence is 3×$3.28 = $9.84.

so the cost of jake's wood perimeter fance is

(410 yd) × ($9.84 /yd) = $4034.40

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.

four boxes of pizza

hope this