CRN 12107: HW 2

Revision as of 21:16, 10 September 2013

Problem 6. Is the statement $\quad\exists !\,x\in\mathbb{R} : (x-2=\sqrt{x+7}) \quad$ true or false? Prove your conjecture.

Problem 7. Let $A,B$ and $C$ be arbitrary sets. Recall that $A\setminus B=\{x \ |\ x\in A\ \wedge\ x\not\in B\}$. We define $A\bigtriangleup B:=(A\setminus B)\cup(B \setminus A)$. Prove or disprove:

1. $A \bigtriangleup B= B \bigtriangleup A$.
2. $(A \bigtriangleup B)\bigtriangleup C=A \bigtriangleup (B \bigtriangleup C)$.

Problem 8. Let $A$ and $B$ be arbitrary sets. Prove or disprove:

1. ${\cal P}(A\cap B)\subseteq {\cal P}(A)\cap {\cal P}(B)$.
2. ${\cal P}(A)\cap {\cal P}(B)\subseteq {\cal P}(A\cap B)$.

Problem 9. Given two real numbers $a<b$, the open interval $(a,b)$ is defined to be the set $\displaystyle{\{x\in\mathbb{R}\ |\ (a<x) \wedge (x<b)\}}$.

For $n\in\mathbb{N}$, let $A_n$ be the open interval $\displaystyle{(\frac{1}{2}-\frac{1}{n}, \frac{1}{2}+\frac{1}{n})}$. Find $\displaystyle{\bigcup_{n\in\mathbb{N}} A_n}$ and $\displaystyle{\bigcap_{n\in\mathbb{N}} A_n}$. Confirm your conjectures by proofs.

Problem 10. Critique the following proof. Is the proof correct or flawed? Explain!

Recall that a positive integer $p$ is prime if it is divisible by exactly two positive integers, namely $1$ and $p$.

Theorem. There are infinitely many primes.

Proof: Suppose there are only finitely many primes, say the list of all primes is $\{p_1,p_2,p_3,\ldots, p_n\}$ for some positive integer $n$. Set \[p=1+p_1\cdot p_2 \cdot p_3 \cdots p_n.\] Then $p$ leaves a remainder of 1 when divided by any of the $p_n$'s and thus must be a prime not on the list of all primes.