Of all the students in a particular class, 20% have blue eyes. We want to run a simulation to predict how many blue eye students will be chosen if we
randomly select 10 students. First, we need to assign digits to students that
have blue eyes and students that do not have blue eyes. If we were to use
single digits to represent both, which of the following would be a correct
method of assigning these digits?
A. blue eyes: 1, 2, 3 other: 3, 4, 5, 6, 7, 8, 9, 10
B. blue eyes: 0,1, 2 other: 3, 4, 5, 6, 7, 8, 9
C. blue eyes: 1, 2 other: 3, 4, 5, 6, 7, 8, 9, 10
D. blue eyes: 0,1 other: 2, 3, 4, 5, 6, 7, 8, 9
I’m

m∠cdf = 43° , m∠gdf = 114°, m∠gde = 23°, m∠edh = 23° , m∠cdh = 157°

step-by-step explanation:

since, it is given that de bisects the angle gdh ⇒ de divides the angle gdh into two equal angles.

⇒ m∠gde = m∠edh

⇒ 8·x   - 1 = 6·x + 5

⇒ x = 3

so, m∠gde = 8·x - 1 = 23°

and m∠edh = 23°

now, it is given ∠cde is an straight angle so, m∠cde = 180°

⇒ m∠cdf + m∠fdg + m∠gde = 180°

⇒ 43° + m∠fdg + 23° = 180°

⇒ m∠fdg = 114°

again, m∠cde = m∠cdh + m∠edh = 180°

m∠cdh + 23° = 180°

⇒ m∠cdh = 157°

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.

p(x)= 8 x³ - 36 x² + 54 x - 27

q(x) = 2 x -3

you can check your mistake and then you can choose the correct option.

dividend =   8 x³ - 36 x² + 54 x - 27

divisor = 2 x -3

if you want to find quotient, proceed as follows

q(x)= 0

2 x - 3=0

x =

now , i have used division method , to find quotient and remainder

shorter then the tree