* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download Assignment 2: Proofs
Survey
Document related concepts
Infinitesimal wikipedia , lookup
Foundations of geometry wikipedia , lookup
Foundations of mathematics wikipedia , lookup
List of first-order theories wikipedia , lookup
Georg Cantor's first set theory article wikipedia , lookup
List of important publications in mathematics wikipedia , lookup
Wiles's proof of Fermat's Last Theorem wikipedia , lookup
Peano axioms wikipedia , lookup
Non-standard calculus wikipedia , lookup
Fermat's Last Theorem wikipedia , lookup
Elementary mathematics wikipedia , lookup
Brouwer–Hilbert controversy wikipedia , lookup
Fundamental theorem of algebra wikipedia , lookup
Natural deduction wikipedia , lookup
Line (geometry) wikipedia , lookup
Transcript
Math 240: Discrete Structures I Due: Wednesday 14th October Assignment 2: Proofs 0. Latex. [10 marks] Bonus for writing your solutions to this assignment using Latex. (You may draw any figures by hand if you want.) 1. Proof Techniques [10 marks] (a) Give a direct proof that: If x is an integer then x3 − x is divisible by 3. (b) Give a contrapositive proof that: Let x and y be real numbers. If the product x · y is irrational then either x or y is an irrational number. 2. Proofs by Contracition. Prove by contradiction that: [10 marks] (a) There are no integers x and y such that 6x + 14y = 1. (b) Let x, y, z be integers. If x2 + y 2 = z 2 then either x or y is even. 3. Proofs by Induction. [10 marks] (a) Prove by induction that, for any integer n ≥ 2, 1 1 1 1 n+1 1 − 2 · 1 − 2 · 1 − 2 · ··· · 1 − 2 = 2 3 4 n 2n (b) Prove by induction that, for any sets A1 , A2 , . . . , An , De Morgan’s Law generalises to A1 ∪ A2 ∪ · · · ∪ An = A1 ∩ A2 ∩ · · · ∩ An 1 4. Predicate Calculus. [10 marks] (a) What is the negation of the statement ∀n ∈ N (the remainder when n2 is divided by 4 is either 0 or 1) (b) Either the original statement in a) is true or its negation is true. Which one is it? 5. More Predicate Calculus. [10 marks] (a) What is the negation of the statement ∀ odd m ∈ N ∃n ∈ N (m = n2 − (n − 1)2 ) (b) Either the original statement in a) is true or its negation is true. Which one is it? 6. Axiomatic Systems. [10 marks] Consider a geometry with lines and points that satisfy the following axioms: (A1) There is at least one line. (A2) For any two distinct points, there is exactly one line that goes through them both. (A3) There is no line that contains every point. (A4) Any two lines intersect in at least one point. Prove that: (a) Any two lines intersect in exactly one point. (b) There is at least one point. (c) No point lies on every line. 2