Based on these results, which is the most reasonable prediction of the number of times chocolate is selected if
only 81 students are surveyed?

A 10
B 20
C 50
D 15

(b) 240

step-by-step explanation:

first, we use the pythagorean formula using the given side lengths to find x. then we use x to find the side lengths. then we add the side lengths to find the perimeter.

pythagorean theorem formula:

a^2 + b^2 = c^2

(x - 20)^2 + (x - 40)^2 = x^2

x^2 - 40x + 400 + x^2 - 80x + 1600 = x^2

x^2 -120x + 2000 = 0

(x - 100)(x - 20) = 0

x - 100 = 0 or x - 20 = 0

x = 100 or x = 20

we see that the solution x = 20 must be discarded because it will give a negative side length and a side length of 0. the only valid solution is x = 100.

perimeter = sum of the lengths of the sides

perimeter = x + x - 20 + x - 40

perimeter = 3x - 60

replace x with 100.

perimeter = 3(100) - 60

perimeter = 300 - 60

perimeter = 240

oof

step-by-step explanation:

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.