The number of machine breakdowns in a month follows a Poisson distribution with a mean of 3. An insurance contract covers repairs to the machine if more than N breakdowns occur in a month. N is selected to be the highest number such that the contract will provide repairs in at least 25% of the months. Determine N.

N= 3

Step-by-step explanation:

given data

mean =  3

provide repairs at least =  25%

solution

as here for poisson distribution

P(X=k) =   ......................1

so here

P(X>n) = 0.25

and

P(X>n) =      ..............2

so

P(X>3) = 0.3528

and

P(X>4) = 0.1847

so here  

N= 3

9) i can't see the angle so whatever it is just do this: cos(angle) x hypotenuse and then use that answer and they hypotenuse and plug it into this: (answer you just got)^2 + b^2 = (hypotenuse)^2. the first answer will be the answer of the adjacent side and the second answer after this equation will be the opposite side.

10) y = 14 x = √147 or 12.12435565

11) x = 4.8

12) x = 4.2

13) x = 9.3

14) pq: 13.2

qr : 17.6

angle p: 53º

15) angle c: 54.3º

angle a: 35.7º

16) h = 21040

v = 1841

step-by-step explanation:

10) 7/sin(30) = 14 = y

7^2 + b^2 = 14^2

49 + b^2 = 196

b^2 = 196 - 49

√b^2 = √147

x = √147

11) cos(70) x 14 = 4.788282007

x = 4.8

12) tan(25) x 9 = 4.196768923

x = 4.2

13) sin(31) x 18 = 9.270685348

x = 9.3

14) pq: sin(37) x 22 = 13.23993051

pq: 13.2

qr: cos(37) x 22 = 17.56998122

qr : 17.6

angle p: 180 - (37 + 90) = 53º

15) cos-1(7/12) = 54.31466529

angle c: 54.3º

angle a: 180 - (90 + 54.31466529) = 35.68533471

angle a: 35.7º

16) 4 x 5280 = 21120

cos(5) x 21120

h = 21039.63202

h = 21040

sin(5) x 21120

v = 1840.729287

v = 1841

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.