Answer:
Step-by-step explanation:
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
A discount string 5/2/1 means the following:
1) Apply 5% discount to the original price.
2) Apply 2% discount to the result of step 1).
3) Apply 1% discount to the result of step 2).
We have then that the result will be given by:
625 * (0.95) * (0.98) * (0.99) = 576.05625 $
Then, the price of each skateboard is:
(576.05625) /20=28.8028125 $
Answer:
The net price of the skateboards was:
28.8028125 $
A because 3m + 2 doesn’t match -3m +2. All the -3m +2 equations are the same except they are in a different order.
