The entertainment committee at Maplecrest Junior High School has narrowed down the theme of the Spring Dance to three choices. The ten committee members want to conduct a survey to determine which theme Maplecrest's 2000 students prefer. There will be three choices (Disco Fever, The Crazy Eighties, or Hip Hop Til You Drop) and the committee will go with the theme that gets the most votes.
Which of the following survey methods will allow the committee to make a valid conclusion about which theme Maplecrest's student body prefers?
Choose 1
Choose 1

(Choice A)
A
Each of the 10 committee members can ask 10 friends to obtain a sample of 100 students.

(Choice B)
B
Assign a number to each student, and use a computer program to generate 100 random numbers between 1 and 2000. Ask those students whose numbers are selected.

B

Step-by-step explanation:

To make the survey fair, every student in the school has to have an equal chance to be selected to take the survey.  The first scenario would only allow friends of the committee members to be selected,  but the second one would give a chance to all students.

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.

the answer is c hope this