Assume that different groups of couples use a particular method of gender selection and each couple gives birth to one baby. This method is designed to increase the likelihood that each baby will be a girl, but assume that the method has no effect, so the probability of a girl is 0.5. Assume that the groups consist of 22 couples. Complete parts (a) through (c) below.
a. Find the mean and the standard deviation for the numbers of girls in groups of 22 births.
The value of the mean is muequals
11.
(Type an integer or a decimal. Do not round.)
The value of the standard deviation is sigmaequals
nothing.
(Round to one decimal place as needed.)
b. Use the range rule of thumb to find the values separating results that are significantly low or significantly high.
Values of
nothing girls or fewer are significantly low.
(Round to one decimal place as needed.)
Values of
nothing girls or greater are significantly high.
(Round to one decimal place as needed.)
c. Is the result of 18 girls a result that is significantly high? What does it suggest about the effectiveness of the method?
The result
is
significantly high, because 18 girls is
less than
greater than
less than
equal to

29.3 girls. A result of 18 girls would suggest that the method
is not effective.
is not effective.
is effective.
(Round to one decimal place as needed.)

over the argument its not good to fight.

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.