Answer:
f(4.5) I think
Step-by-step explanation:
<u>The answer is 808/99</u>
Answer:

Step-by-step explanation:
To solve this problem we need to be familiar with the formula for the surface area of a cone:

We are given the length of a side and the diameter, to calculate the radius divide the diameter in half:

To calculate the height of the cone, we must use the Pythagorean Theorem:

We can treat the side length as the hypotenuse
, the radius as the base
, and solve for height
. Set the expression up like this:

Now we can plug into our original formula:

Answer:
585
Step-by-step explanation:
9 * 13 * 5 = 585
9 FLIGHTS OF STAIRS
13 STEPS IN EACH FLIGHT
5 DAYS
Hope this helps!
From V
Answer:
Solution to determine whether each of these sets is countable or uncountable
Step-by-step explanation:
If A is countable then there exists an injective mapping f : A → Z+ which, for any S ⊆ A gives an injective mapping g : S → Z+ thereby establishing that S is countable. The contrapositive of this is: if a set is not countable then any superset is not countable.
(a) The rational numbers are countable (done in class) and this is a subset of the rational. Hence this set is also countable.
(b) this set is not countable. For contradiction suppose the elements of this set in (0,1) are enumerable. As in the diagonalization argument done in class we construct a number, r, in (0,1) whose decimal representation has as its i th digit (after the decimal) a digit different from the i th digit (after the decimal) of the i th number in the enumeration. Note that r can be constructed so that it does not have a 0 in its representation. Further, by construction r is different from all the other numbers in the enumeration thus yielding a contradiction