Let l1 and l2 be parallel lines, and let reflection 2 followed by reflection 1 is not equal to a reflection 1 followed by reflection 2. (hint: take a point on l1 and see what each of the sequences does to it.)

option 2 is correct.

step-by-step explanation:

we are given two inequality equation

x+y> 5 and -3x+2y< -2

first we draw the graph of both function using t-table method

equation: x+y> 5

for x=0, y=5

for x=-5, y=0

table:

x   :   0     5

y   :   5     0

test point (0,0) , 0> 5

false

equation: -3x+2y< -2

for x=0, y=-1

for x=2, y=4

table:

x   :   0     2

y   : -1       4

test point (0,0) , 0< -2

true

now we draw the graph. see the attachment for graph.

common region would be solution set.

option 2 is correct.

the answer is 13

step-by-step explanation:

5*5=25

12*12=144

25+144=169

169^2=13

there is no graph so i cant sorry

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.