1. A researcher has the task of estimating how many units of a revolutionary new high-speed office copier machine (it does not require ink cartridges and is guaranteed not to jam) will be purchased by business firms in Cleveland, Ohio for the upcoming annual sales forecast. Her plan is to ask the likelihood that they will purchase the new device, and for those who are "very likely" to purchase, she wants respondents to estimate how many machines their company will buy. She has data to divide the companies into small, medium, and large firms based on number of employees at the Cleveland office. What sampling plan should be used? Why? (4 points)

δabc ≅ δdcb by sas because

db ≅ ac . . given (side)

bc ≅ bc . . reflexive property (side)

∠dbc ≅ ∠ acb . . alternate interior angles where transversal bc crosses parallel lines bd and ac (included angle)

y=3x+4

step-by-step explanation:

given the points a(0,4) and b(-4, -8)

eqn of line ab: (y-4)/(x-0)=(-8-4)/(-4-0)

(y-4)/x=-12/-4=3

y=3x+4

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.