Prove that .x1 CC xn/ 2 n. x1 2 CC xn 2/ for all positive integers n and all real numbers x1;:::;xn.

starting with:    

5 + x - 12 = 2x - 7   

5 + x - 12 - x = 2x - 7 - x (subtract x from both sides)   

5 - 12 = x - 7 (combine and cancel x's from both sides)   

5 - 12 + 7 = x - 7 + 7 (add 7 to both sides)   

0 = x (add numbers together on both sides)       

so in order for the equation to be true, x must be 0.   

trying x = -0.5   

5 + x - 12 = 2x - 7 (original equation)   

5 + -0.5 - 12 = 2(-0.5) - 7 (plug in value of x)   

5 + -0.5 - 12 = -1 - 7 (did multiplication)   

-7.5 = -8 (did addition on both sides)       

since -7.5 is obviously not equal to -8, the value of -0.5 for x is wrong.   

trying x = 0   

5 + x - 12 = 2x - 7 (original equation)   

5 + 0 - 12 = 2(0) - 7 (plug in value of x)   

5 + 0 - 12 = 0 - 7 (did multiplication)   

-7 = -7 (did addition on both sides)       

since -7 equals -7, that demonstrates that the value of 0 for x is correct.   

trying x = 1   

5 + x - 12 = 2x - 7 (original equation)   

5 + 1 - 12 = 2(1) - 7 (plug in value of x)   

5 + 1 - 12 = 2 - 7 (did multiplication)   

-6 = -5 (did addition on both sides)       

since -6 is obviously not equal to -5, the value of 1 for x is wrong.

answer: two angles are called supplementary if they add up to 180°. example: the two angles (140° and 40°) are supplementary because they add up to 180°.

step-by-step explanation:

answer:   x*94 +688*6   = 267*100

94x+4128=26700    

94x=22572     /94

x=240.128

step-by-step explanation: mark as brainlest reallly need it thx

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.