Abcd and jklm are similar find x length of mj ab=2 bc=4 cd=3 ad=7
jk=2.4 kl=4.8 lm =3.6 mj=x

the results from a pre-test for students for the year 2000 and the year 2010 are illustrated in the box plot. what do these results tell us about how students performed on the 29 question pre-test for the two years?

if we compare only the lowest and highest scores between the two years, we might conclude that the students in 2010 did better than the students in 2010. this conclusion seems to follow since the lowest score of 8 in 2010 is greater in value than the lowest score of 6 in 2000. also, the highest score of 28 in 2010 is greater in value than the highest score of 27 in 2000.

but the box portion of the illustration gives us more detailed information. the middle bar in each box shows us that the median score of 20 in 2000 is greater in value than the median score of 17 in 2010. further, we note that the box and whiskers divide the illustration into four pieces. each of these four pieces represents the same portion of students. so, the upper half of the students in 2000 scored in the same score range as the upper one-fourth of the students in 2010, see the illustration at a score of 20.

by considering the upper one-fourth, upper half, and upper three-fourths instead of just the lowest and highest scores, we would conclude that the students as a whole did much better in 2000 than in 2010. we would conclude that as a whole the students in 2010 are less prepared than the students in 2000.

in this section, we discuss box-and-whisker plots and the five key values used in constructing a box-and-whisker plot. the key values are called a five-number summary, which consists of the minimum, first quartile, median, third quartile, and maximum.

step-by-step explanation:

answer: idk

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.

b.

step-by-step explanation: