discrete math -- 2
Budget: $12 – $30 SGD
Define ?: ?(ℕ) ∖ {∅} → ℕ by setting ?(?) to be the smallest element of ? whenever ? ∈ ?(ℕ) ∖
{∅}. (Note that ?(?) denotes the power set of ?.)
Prove or disprove the following:
(a) The function ? has an inverse.
(b) ?−1({?}) is uncountable for some ? ∈ ℕ
{∅}. (Note that ?(?) denotes the power set of ?.)
Prove or disprove the following:
(a) The function ? has an inverse.
(b) ?−1({?}) is uncountable for some ? ∈ ℕ