# Discrete mathematics cardinality using Richard Hammack's Elements of Discrete mathematics chapter 18 Prove that countable union of countable sets is countable. Question
Discrete math Discrete mathematics cardinality using Richard Hammack's Elements of Discrete mathematics chapter 18 Prove that countable union of countable sets is countable. 2021-02-23
According to the given information, it is required to prove that countable union of countable sets is countable. Let  be the sequence of countable sets. Now define: $$S= \bigcup S_{n}n \in N$$ for all n in N denote T, denote the set of all injections from $$S_{n} \text{to} N$$. since $$S_{n}\ \text{is countable so}\ T_{n}$$ is non empty. so, there exist a sequence $$t_{n} \in T_{n}$$ define, $$f:S \rightarrow N \times N$$ be the mapping defined by $$f(x) = (n, t_{n}(x))$$ where n is the smallest unique natural number such that x in $$S_{n}$$ from well ordering principle such an n exist hence mapping f exist. each t_n is an injection, thus it follows that f is an injection. $$N \times N$$ is countable so, there exist a: $$N \times N \rightarrow N$$ since composite of injections is injection thus, a circ $$f:S \rightarrow N$$ is an injection therefore, S is countable

### Relevant Questions Discrete mathematics cardinality using Richard Hammack's Elements of Discrete mathematics chapter 18 A superset of uncountable set is uncountable. (We say A is a superset of B if B sube A. ) Using cardinatility of sets in discrete mathematics the value of N is real numbers Currently using elements of discrete mathematics by Richard Hammack chapter 18 Let A be a collection of sets such that X in A if and only if $$X \supset N\ \text{and} |X| = n$$ for some n in N. Prove that $$|A| = |N|$$. Im confused on this question for Discrete Mathematics.
Let $$\displaystyle{A}_{{{2}}}$$ be the set of all multiples of 2 except for 2. Let $$\displaystyle{A}_{{{3}}}$$ be the set of all multiples of 3 except for 3. And so on, so that $$\displaystyle{A}_{{{n}}}$$ is the set of all multiples of n except for n, for any $$\displaystyle{n}\geq{2}$$. Describe (in words) the set $$\displaystyle{A}_{{{2}}}\cup{A}_{{{3}}}\cup{A}_{{{4}}}\cup\ldots$$. in DISCRETE MATHEMATICS & APPLICATIONS Write a note about application of mathematical induction in daily life. Give two examples. Suppose n is an integer. Using the definitions of even and odd, prove that n is odd if and only if 3n+1 is even. Use symbols to write the logical form of the following arguments. If valid, iden- tify the rule of inference that guarantees its validity. Otherwise, state whether the converse or the inverse error has been made. If you study hard for your discrete math final you will get an A. Jane got an A on her discrete math final. ‘Therefore, Jane must have studied hard.   Prove or disaprove that if a|bc, where a, b, and c are positive integers and $$\displaystyle{a}≠{0}{a}$$, then a|b or a|c. Let $$\displaystyle{F}_{{i}}$$ be in the $$\displaystyle{i}^{{{t}{h}}}$$ Fibonacc number, and let n be ary positive eteger $$\displaystyle\ge{3}$$
$$\displaystyle{F}_{{n}}=\frac{1}{{4}}{\left({F}_{{{n}-{2}}}+{F}_{{n}}+{F}_{{{n}+{2}}}\right)}$$