1. If the sum of two rational numbers is rational (give two examples) 2. If the product of two rational numbers is rational ( give 3 examples)

3. If the sum of a rational number and an irrational number is irrational (give 3 examples)

4. If the product of a rational number and an irrational number is irrational ( give three examples)

5. if the sum of two irrational numbers is sometimes irrational ( give two examples that show this is true, two examples that show this is false)

6. If the product of two irrational numbers is sometimes irrational (give two examples that shows this is true, and two examples that show this is false)

answer: what is the conflict?

step-by-step explanation:

*what has happened to new york city?

*what is in the time capsule?

* what did the kidz see that gave them hope?

*what will they do with what they find?

* how will they save the city?

* what challenges will they face along the way?

*what big choice will they make at the climax of the story?

* what lesson do they learn at the end of the story?

80

step-by-step explanation:

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.

mr. india