CRN 12107: HW 2
HelmutKnaust (Talk | contribs) |
HelmutKnaust (Talk | contribs) |
||
Line 26: | Line 26: | ||
p=1+p1⋅p2⋅p3⋯pn. | p=1+p1⋅p2⋅p3⋯pn. | ||
Then p leaves a remainder of 1 when divided by any of the pn's and thus p must be a prime not on the list of all primes. | Then p leaves a remainder of 1 when divided by any of the pn's and thus p must be a prime not on the list of all primes. | ||
+ | |||
+ | [[Image:Alice3.gif]] |
Latest revision as of 22:28, 10 September 2013
Problem 6. Is the statement ∃!x∈R:(x−2=√x+7) true or false? Prove your conjecture.
Problem 7. Let A,B and C be arbitrary sets. Recall that A∖B={x | x∈A ∧ x∉B}. We define A△B:=(A∖B)∪(B∖A). Prove or disprove:
- A△B=B△A.
- (A△B)△C=A△(B△C).
Problem 8. Let A and B be arbitrary sets. Prove or disprove the following power set relations:
- P(A∩B)⊆P(A)∩P(B).
- P(A)∩P(B)⊆P(A∩B).
Problem 9. Given two real numbers a<b, the open interval (a,b) is defined to be the set {x∈R | (a<x)∧(x<b)}.
For n∈N, let An be the open interval (12−12n,12+13n). Find ⋃n∈NAn and ⋂n∈NAn. 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. The five smallest primes are 2,3,5,7,11.
Theorem. There are infinitely many primes.
Proof: Suppose there are only finitely many primes, say the list of all primes is {p1,p2,p3,…,pn} for some positive integer n. Set p=1+p1⋅p2⋅p3⋯pn. Then p leaves a remainder of 1 when divided by any of the pn's and thus p must be a prime not on the list of all primes.