A house painter uses a 9.0 inch wide "roller” which is 5.0 inches in diameter to paint a wall with a surface 2.40 m x 6.70 m. The surface includes 2 windows (2.0 ft x 3.0 ft each) which, obviously, should not be painted. What is the minimum number of times that the painter
has to roll his "paint roller" (one full circle for each roll) in order to apply one layer of paint
on the surface to be painted?

x = ±sqrt(10)

step-by-step explanation:

5 - 2x² = -15

subtract 5 from each side

5-5 - 2x² = -15-5

-2x^2   = -20

divide by -2 on each side

-2x^2   /-2= -20/-2

x^2 =10

take the square root on each side

sqrt(x^2 )=±sqrt(10)

x = ±sqrt(10)

check:

5 - 2x² = -15

+sqrt(10)

5 - 2(sqrt(10))² = -15

5 -2(10) = -15

5 -20 = -15

-15 = -15

-sqrt(10)

5 - 2(-sqrt(10))² = -15

5 -2(10) = -15

5 -20 = -15

-15 = -15

168

step-by-step explanation:

first off, we know that he drove 3.5 hours at a rate of 48 mph.

knowing that, we want to see how many miles he drove all-together.

in this case, we can just multiply 48 by 3.5.

48 * 3.5 = 168

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.

step-by-step explanation:

is their an equation anywhere i can take a   look at it and see if i am right.