Use the drop-down menus to complete each equation so the statement about its
solution is true
clear
check
no solutions
8x - 2 - 5x + 7 =
x
one solution
8x -2- 5x7=
x+
-
infinitely many solutions
8x - 2 - 5x + 7 =
x+

mxb67

step-by-step explanation:

step-by-step explanation:

i found the life tables for the year 2012. 

life table of males at age 30. probability of dying between ages x and x+1

total population:  

29–30 . . . . . . . . . . . . 0.001030

30–31 . . . . . . . . . . . . 0.001061

males:  

29–30 . . . . . . . . . . . . 0.001420

30–31 . . . . . . . . . . . . 0.001448

white population

29–30 . . . . . . . . . . . . 0.001005

30–31 . . . . . . . . . . . . 0.001037

white males

29–30 . . . . . . . . . . . . 0.001372

30–31 . . . . . . . . . . . . 0.001399

non hispanic white population

29–30 . . . . . . . . . . . . 0.001083

30–31 . . . . . . . . . . . . 0.001116

non hispanic white males

29–30 . . . . . . . . . . . . 0.001477

30–31 . . . . . . . . . . . . 0.001503

jacob, non hispanic white male. 30 years old.

probability that jacob lives to be 30 years old. 

since the given probabilities are probabilities of dying, i think we simply subtract it from 1 to get the probability of living. we will use the probability of non hispanic white male.

                                          probability of living to be 30 y.o.

29 - 30 : 1 - 0.001477 = 0.998523

30 - 31 : 1 - 0.001503 = 0.998497

-8/2y-8=5/y+4-7y+8/y^2-16

we move all terms to the left:

-8/2y-8-(5/y+4-7y+8/y^2-16)=0

we can not solve this equation

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.