Write an explicit formula for a_na n
​
, the n^{\text{th}}n
th
term of the sequence 7, -28, 112, ...7,−28,112,

x=-2

infinite number of lines, so there is an infinite number of equations.

step-by-step explanation:

there are an infinite number of line that passes through the point (-2,5)

x=-2   is one line that passes through the point

y = 5 is another line that passes through the point

(these two lines are perpendicular to each other).

since the number of   numbers are infinite and the slope is the ratio of two numbers,(change in y over change in x) we can have an infinite number of slopes.     our only condition is that it passes through the point (-2,5)

start with a line segment pq that we will copy. mark a point r that will be one endpoint of the new line segment. set the compasses' point on the point p of the line segment to be copied. adjust the compasses' width to the point q. the compasses' width is now equal to the length of the line segment pq.

step-by-step explanation:

answer: what are the answer choices?

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.