Mathematics Homework Solutions
#61007
Denumerable and Induction
1. Show that if A and > are denumerable disjoint sets then A u > is denumerable
2. Show that every set of cardinalty c contains a denumerable subset
3. Show by induction that 6 divides n^3 - n for all n in N
There are three proofs here: one regarding denumerability, one regarding cardinality and denumerable subsets, and a proof of divisibility by induction.
What is this?
By OTA - Overall OTA Rating
Yupei Xiong, PhD - 4.8/5
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
- Plain text response
Why you can trust BrainMass.com
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- Cardinality, Countability and Denumerable Sets - 1. Show that if A and B are countable and disjoint, then A U B is countable. 2. Show that any set, A, of cardinality c contains a subset, B, that is denumerable. 3. Show that the irrational numb ...
- Sets and One-to-one Correspondence : Infinite Sets and Cardinal Numbers - Please see the attached file for the fully formatted problems.
- Proofs : Denumerable Sets and Cartesian Products - Need help in determining the following proof exercise. (See attached file for full problem description) --- Corollary 14.2.4: If A is a denumerable set then so is A^n for every positive integ ...
- Cardinality - Please see the attached file for full problem description.
- Induction and Set theory : Addition Principle, Union and Pairwise Disjoint Finite Sets - Proposition 10.2.1: (the addition principle) Suppose that X and Y are disjoint finite sets. Then X U Y is finite and |X U Y| = |X| + |Y|. Corollary 10.2.2: For a positive integer n, suppose t ...
