Astudy is being made of the failures of an electronic component. there are four types of failures possible and two mounting positions for the device. the following data have been taken: failure type mounting position a b c d 1 22 46 18 9 2 4 17 6 12

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.

using pemdas, (order of operations) you'll see the answer is 24.

it's 100

step-by-step explanation:

22, 28, 34, 40, 46

b)   f(n) = 6n + 16

  n = what is the number of the row ( 22 would be row 1) so if we replaced n with 1, we would get 22

c)   the  14th  row will have 100 seats

(1)   (2)   (3)   (4)   (5)   (6)   (7)   (8)   (9)   (10) (11) (12) (13) (14)

22 | 28 | 34 | 40 | 46 | 52 | 58 | 64 | 70 | 76 | 82 | 88 | 94 | 100

read more on -

the equation of the line that passes through the points and has o form

if line passes through the points (-1, -3) and (2, 1), then

the equation in the standard form is