Jill wants to paint a cylinder shape flower pot that has a radius of 8 cm and a height of 9 cm.

What is the approximate surface area of the cylinder that will be painted?

Use 3.14 for π.
Question 1 options:

603 cm^2

904 cm^2

653 cm^2

500 cm^2

the answer is 150.6

step-by-step explanation:

you multiply .02 by 30 and get .6.

and then you multiply 5.00 by 30 and get 150.

hope this !

step-by-step explanation:

part a. the differences are decreasing, so we know the sequence is not arithmetic. the ratios are constant (=3/4), so we know the sequence is geometric.

part b. from part a, we know the common ratio is 3/4, so each term is 3/4 of the one before. the initial term is the number of gallons at h=1.

g[h] = (3/4)·g[h-1]

g[1] = 384 . . . . initial value required for a recursive definition

part c. the general formula for a geometric sequence is

a[n] = a[1]·r^(n-1)

we have a[1] = 384, r = 3/4, and the term number given by h. the formula that follows is

g[h] = 384·(3/4)^(h-1)

part d. filling in the value and doing the arithmetic, we have

g[12] = 384·(3/4)^11 ≈ 384·0.042235136 ≈ 16.2183 . . gallons

part e. each gallon is 4 quarts, so

16.2183 gal × 4 qt/gal = 64.8732 qt

answer: answer is b.

[m < b = 120º]

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.