CSE 1400 Applied Discrete Mathematics Proofs
|
|
- Hollie McGee
- 6 years ago
- Views:
Transcription
1 CSE 1400 Applied Discrete Mathematics Proofs Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Axioms 1 Logical Axioms 2 Models 2 Number Theory 3 Graph Theory 4 Set Theory 4 Rules of Inference 5 Proof Techniques 5 Vacuous and Trivial Proofs 6 Counterexamples 6 Direct Proofs 7 Proofs by Contradiction 8 Proofs by Contraposition 9 Proofs by Resolution 10 Significant Theorems 10 Fundamental Theorem of Arithmetic 10 Euclid s Lemma 10 The Quotient Remainder Theorem 11 Bézout s Theorem 11 Lamé s Theorem 12 The Binomial Theorem 13 The Prime Number Theorem 13
2 proofs 2 Problems on Proofs 14 Abstract Mathematics seeks to prove statements are always True or always False, or sometimes True and sometimes False. The statements can be about almost anything, but, in computing, can often be reduced to statements about natural numbers. Starting from an initial set of axioms there are several techniques (arguments) that can be used to establish new truths: direct, indirect, Axioms An initial collection of True premises is necessary to establish a mathematical system. The premises, called axioms, model a system that is interesting to reason about. Euclid s axioms of geometry are perhaps the best known axiomatic system. The Peano axioms for the natural numbers may be less well known, but are essential ideas for building a system of discrete mathematics. The Peano axioms are 1. There is natural number called zero denoted by the symbol If n is a natural number, then n + 1 is a natural number. 3. Zero is not the successor of any natural number n. That is, 0 = (n + 1) for any natural number n. 4. If the successor of n equals the successor of m, then n and m are equal. 5. If set A contains zero and the successor of every element in A, then every natural number is in A, that is A = N. Peano s arithmetic also postulate the existence of an equality relation on the natural numbers that satisfies the rules 1. Reflexive: For all natural numbers n, n = n. The axioms of Euclidean geometry are roughly stated as follows. 1. There is a straight line segment between any two points. 2. A straight line segment can be extended indefinitely into a line. 3. A circle can be constructed with center at one end of a radius of a given a straight line segment. 4. All right angles are identical. 5. Two straight lines intersect if they are not parallel. Axiom 5 is called the induction axiom. It is equivalent to the well-ordering property: Every non-empty set of natural numbers has a least element. Peano s axioms are consistent if they are incapable of deriving a well-formed formula that is both True and False. Peano s axioms are complete if any well-formed formula can be proven either True or False. 2. Symmetric: For all natural numbers n and m, if n = m, then m = n. 3. Transitive: For all natural numbers n, m, and o, if n = m and m = o, then n = o. Logical Axioms Logical axioms are universally True. The following are logical axioms. Gödel proved any logical system L in which Peano axioms are True (a) Cannot be both consistent and complete (b) Cannot be proven consistent unless it is inconsistent.
3 proofs 3 1. True is a logical axiom. 2. Every expression p whose Boolean form is a tautology is a logical axiom. 3. Let p be an expression. Then p = p is a logical axiom. 4. Let p 0, p 1 and q 0, q 1 be expressions, and let be a relation. If p 0 = p 1 and q 0 = q 1, then (p 0 q 0 ) (p 1 q 1 ) is a logical axiom. 5. Let p and q be expressions and let f be a function. If p = q, then f (p) = f (q) is a logical axiom. 6. If p is True for all values of its variables, then p is True for any particular assignment of values to these variables. ( x)(p) ( x)(p) 7. If p is True, then p is True for all values of its variables p ( x)(p) 8. If for all variables p q, then for all variables p implies for all variables q. ( x)(p q) (( x)(p) ( x)(q)) Models The word model is overly used in English. Here it means a collection of statements (axioms) that are logically or non-logically True. Axioms come in two forms: One form is axioms that are universally True. These are called logical axioms. The other form is axioms that are True some model, but not in others. These are called non-logical axioms. Models can be loosely classified into one of two types: Discrete models that describe finite or countably infinite things, and continuous models that describe continuous things. Continuous models deal with calculus, differential equations, complex analysis, and other advanced fields. These are not the topics of this course. Computing, by what we understand of its nature, is operations on finite, but perhaps unbounded, collections of things. Numbers, graphs, sets, and languages are fundamental things on which computations are performed. Axioms that are True in no systems are rarely useful. Non-logical is not the same as illlogical. Non-logical axioms arise from a recognition of usefulness in various applications. Number Theory Numbers are a fundamental things used in computing. Number theory is the basis for arithmetic and its extensions into algebra, analysis, and other esoteric subjects. Number theory is based on the vocabulary: The set of natural numbers N = {0, 1,...}. The frequency with which esoteric subjects become useful justifies their study.
4 proofs 4 Four functions 1. The successor function σ(n) = n + 1, n N. 2. An addition function α(n, m) = n + m. 3. A multiplication function µ(n, m) = n m. 4. An exponentiation function ɛ(n, m) = n m. Two relations 1. An equality relation = on pairs (n, m) of natural numbers. 2. A less than relation < on pairs (n, m) of natural numbers. The non-logical axioms of number theory are: Closure of addition: If n and m are natural numbers, then n + m is a natural number. The values of equality and less than are Boolean: True or False. Closure of multiplication: If n and m are natural numbers, then n m is a natural number. Closure of exponentiation: If n and m are natural numbers, then n m is a natural number. Commutativity of addition: If n and m are natural numbers, then n + m = m + n Commutativity of multiplication: If n and m are natural numbers, then n m = m n Associativity of addition: If n, m, and p are natural numbers, then (n + m) + p = n + (m + p) Associativity of multiplication: If n, m, and p are natural numbers, then (n m) p = n (m p) Distribution of multiplication over addition If n, m, and p are natural numbers, then n (m + p) = n m + n p Trichotomy: If n and m are natural numbers, then either n < m, n = m or n > m. Well-Ordered Principle: Every non-empty set of natural numbers has a least element. (This is equivalent to induction.) Non-Triviality: 0 = 1. Existence: 0 is a natural number. The axioms of number theory hope to describe the True properties of the natural numbers N under the operations of addition (+), multiplication ( ), exponentiation ( ), and the two relations: equality (=) and less than (<). Some example expressions in number theory Fundamental questions are: What is True are about arithmetic on the natural numbers? Can we prove every True statement about arithmetic on the natural numbers? Are there True statements about the natural numbers that cannot be proven True?
5 proofs 5 ( n)(n + 2 < n 2 + 1) ( n)(n 2 = n + 1) ( n)( n 1 k=0 k = n(n 1)/2) ( n)( n 1 k=0 2k = 2 n 1) Graph Theory Graph theory hopes to describe the True properties about graphs. Graph theory is based on the vocabulary: The set of vertices V. Two relations 1. An equality relation = on pairs (u, v) of vertices, written u = v. 2. An edge relation E on pairs (u, v) of vertices, written E(u, v). Vertices are also called nodes. Some example expressions in number theory are E(u, u) (There is an edge from u to u, a self-loop) ( u)( v)(e(v, u)) (There is a vertex u such that every vertex v has an edge from v to u) ( u)( v)(e(u, v) E(v, u)) ( u)( v)( w)(e(u, z) E(z, y) E(x, y)) Set Theory Set theory hopes to describe the True properties about collections. Rules of Inference Inference rules allow the discovery of new truths from an initial set of axioms. The most simple sound argument has one premise p and one conclusion c. This sound argument is a demonstration that 1. if p is True, and 2. if p c is True 3. then c is True.
6 This basic rule of inference is called modus ponens. Modus ponens is True because its form is always True. This can be demonstrated by the truth table Input Output p c [p (p c)] c cse 1400 applied discrete mathematics Modus ponens is often written proofs using6 the notation p p c You Read will p is gain True understanding p c isby True. constructing Thereforeac truth is True. table for the Boolean expression c (p (p c)) c There are many useful rules of inferences: modus tollens, reductio ad absurnum, syllogism, resolution, and others. A rule of inference is a statement in propositional calculus that is always True. A rule of inference is a tautology. A tautology is a propositional statement that is always True. The truth table for modus tollens is Proof Techniques Input Output p q [ q (p q)] p A proof of proposition c is a sound argument that c is True. An argument in propositional calculus is a sequence of propositions p 0, p 1,..., p n 1, c. Modus tollens is written as p q p q Read "q is not True and p q is True. Therefore p is not True." Induction is written as p(0) ( n N)(p(n) p(n + 1)) ( n N)p(n) Read p(n) is True for n = 0; there is a natural number n such that if p(n) is True, then p(n + 1) is True. Therefore p is not True." The first n propositions p 0, p 1,..., p n 1 are called premises. The last proposition c is called the conclusion. An argument is valid when the conditional (p 0 p 1 p n 1 ) c is always True. A valid argument is sound when all of the premises are True. In this case, we ll write (p 0 p 1 p n 1 ) = c The argument is valid when any one of the premises is False or when all of the premises are True and the conclusion is True. In this latter case, the argument is sound. and say the premises prove the conclusion.
7 proofs 7 Vacuous and Trivial Proofs Consider a conditional statement. If p, then q This conditional statement is True when p is False. This is called a vacuous proof that the conditional statement If p, then q is True. A conditional statement is also True when q is True. Knowing that q is True provides a trivial proof that the conditional If p, then q is True. Counterexamples A statement of the form By definition, set X is a subset of Y if every element x X is also an element of sety. Therefore, since the statement If x, then x Y is True for every x. This conditional is vacuously True because x always False. That is, is a subset of any set Y. If x A, then x U (the universal set) is a trivial proof that the every set is a subset of the universal set. ( a)(p(a)) can be demonstrated to be False by providing a value for a where p(a) is False. The value a is said to be a counterexample to the statement ( a)(p(a)). The existence of a counterexample a proves that it is not the case that p(a) is true for all elements a, that is, Consider the statements: ( a)( p(a)) 1. For every real number x and for every real number y, the algebraic equation ( x R)( y R)(x 2 y = x + y 2 ) x 2 y = x + y 2 is True. One counterexample happens for x = y = 1, where the left-hand side of the equation is 0 and the right-hand side is Every natural number is the sum of squares of two natural numbers. Notice that 0 = = = But 3 is a counterexample to the statement since 3 cannot be written as the sum of squares of two natural numbers. 3. Every natural number is a prime or composite. Both 0 and 1 are counterexamples. 4. All prime numbers are odd. The number 2 is a counterexample.
8 proofs 8 Direct Proofs Pretend you could prove p (p q) is True. By modus ponens you could draw the conclusion that q is True. This is called a direct proof of q. Input Output p q (p q p) q Direct proofs use modus ponens. To prove q is True, prove or know p = True and prove p implies q is True. For instance, from the True proposition p = ( a, b Z)((a b) 2 0) we can prove the geometric mean is always less than or equal to the arithmetic mean. From p we reason as follows. 0 (a b) 2 = a 2 2ab + b 2 4ab a 2 + 2ab + b 2 = (a + b) 2 The value (a + b)/2 is arithmetic mean of a and b. The value ab is geometric mean of a and b. The direct proof states the geometric mean is less than or equal to the arithmetic mean. (a + b)2 ab 4 a + b ab 2 Proofs by Contradiction Pretend you could prove p False is a True statement. Then you could draw the conclusion that p is True, otherwise the conditional would not be True. This is called the reductio ad absurnum rule of inference: The proof reduces proposition p to an absurdity, and allows the conclusion that the p = True. The reductio ad absurnum schema is: To prove a proposition p is True use a proof by contradiction 1. Pretend p is True.
9 proofs 9 2. Demonstrate that p False is True. Most often the value of False is expressed as q q, where q is some proposition. 3. Conclude p is False, that is, p is True. Euclid s proof that there are infinitely many prime numbers is a classic reductio ad absurnum. Theorem 1 (Euclid s Theorem). There are infinitely many prime numbers. (Proof by contradiction). Pretend there are only finitely many prime numbers and name them p 0, p 1,..., p n 1. Consider their product plus 1. p = (p 0 p 1 p n 1 ) + 1 Assume the negation of the proposition is True. Clearly p is not one of the prime numbers p 0, p 1,..., p n 1 : It is greater than each of them. None of the prime numbers p 0, p 1,..., p n 1 divide p: There is always are remainder of 1 when p is divided by any of the primes p k. Therefore p has only two divisors: 1 and The integer p is not a prime number. This is a propostion, name it q, that is True if there are finitely many primes. p mod p k = 1 for all k = 0, 1,..., n 1. p; and therefore p is prime. Therefore, the assumption there are The statement p is prime is q and it finitely many primes leads to the construction of a natural number p that is both prime and not prime. This contradiction allows the conclusion there are an unbounded number of prime numbers. Another ancient theorem is called the Archimedean property Theorem 2 (Archimedean property). For every real number x there is an integer n such that n > x. (Proof by contradiction). Pretend there is a real number x such that n x for every integer n. Thus there must exist an integer m that is larger than every other integer. But m + 1 is an integer and m < m + 1. A third ancient theorem, that appears in Euclid s Elements is the following. Theorem 3 (Irrational Square Roots). The square root of 2 is not a rational number. Lemma 1. If a 2 is an even integer, then a is even. (Proof by contradiction). Pretend 2 is rational and write 2 = a/b were a and b are integers. We may also pretend that a/b has been reduced to lowest terms by cancelling any common factors. That is, a and b are relatively prime. must be True if there are finitely many primes.
10 proofs 10 Consider the equations 2 = a b 2 = a2 b 2 2b 2 = a 2 2b 2 = 4c 2 b 2 = 2c 2 square both sides clear the denominator a 2 is even, so a = 2c b 2 is even, so b is even Thus both a and b are even, contradicting that they are relatively prime. Proofs by Contraposition Pretend you could prove statement (p q) ( q) is True. You could then draw the conclusion that p is True. ((p q) ( q)) ( p) This is called a proof by contraposition. Input Proofs by Resolution Output p q (p q q) p A proof by contraposition relies on the logical equivalence p q q p. Proofs by contraposition use modus tollens. To prove p is True, prove or know q True and prove or know p q True. Pretend you could prove the conjunction (p q) ( p r) is True. That is, both conditional statements are True. You could then draw the conclusion that q r is True. This is called the resolution rule of inference.
11 proofs 11 Significant Theorems There are many theorems that can be derived from many different axiomatic systems. Theorems about the natural numbers N can be important in discrete mathematics applications. There are several reasons for this. 1. The natural numbers are fundamental for arithmetic: addition and multiplication. 2. The natural numbers provide a counting system. 3. The natural numbers provide a naming or indexing system. Fundamental Theorem of Arithmetic extending the operations to include subtraction and division requires extending the natural numbers to the integers and rationals. So many things to count; so little time. A single natural number can point to a complex descriptive name. Theorem 4 (Fundamental Theorem of Arithmetic). Every natural number m greater than 1 is either prime or the product of unique prime factors. The order of the prime factors is not considered important. Proof. Let n > 1 be a natural number. For the first few values natural numbers the theorem is True. 2, 3, 2 2, 5, 2 3, 7, 2 3 So let s pretend the theorem has been establishes for each natural number k = 2, 3,..., (n 1). Consider the next natural number n. If n is prime the theorem is established. On the other hand, if n is composite there exists natural numbers n 1 and n 2 such that n = n 1 n 2 and each has a unique prime factorization. This establishes a unique factorization of n. Euclid s Lemma Another useful number theoretic fact is Euclid s lemma. Lemma 2 (Euclid s). Let p P be a prime number and let a, b N be natural numbers. If p divides ab, then p divides a or p divides b. Proof. Pretend p divides ab and p does not divide a. That is, ( c N)(pc = ab) (a mod p = r = 0) By the Fundamental Theorem of Arithmetic ab can be factored as a product of primes. Since p does not divide a, p is not one of the prime factors of a. Therefore, since the prime factorization is unique, p must be a prime factor of b. That is, p divides b. The Quotient Remainder Theorem For another instance of a direct proof recall the quotient remainder theorem.
12 proofs 12 Theorem 5 (Quotient-Remainder). Given an integer a Z and an integer n = 0, there exists integers q and r, called the quotient and remainder such that a = q n + r and 0 r < n. Proof. Let us pretend a, n Z, n = 0 are integers and consider the non-empty set of natural numbers A = {a nq 0 : q Z} By the well ordered principle of the natural numbers, A has a least element 0 r = a nq for some q. By contradiction we can show that r n. Consider what happens when you pretend r > n. From For instance, A = {5, 11, 17, 23, 29,...} when a = 23 and n = 6. A is not empty. To see this, let { a/n if n > 0, that is, a nq if a/n q. q = a/n if n < 0, that is, a nq if a/n q. conclude that n < r = a nq 0 < a nq n = a n(q + sgn n) A where and are the floor and ceiling functions. For the first case, q = a/n a/n straightforwardly implies a nq 0. The second case is left as an exercise. But that makes a nq n a member of A smaller than the least member r! Bézout s Theorem Theorem 6 (Bézout s Theorem). Given integers a and b there exists integers s and t such that Proof. Consider the set gcd(a, b) = as + bt A = {as + bt > 0 : s, t Z} By the well ordered principle, there is a least element g = as + bt A. By the quotient remainder theorem there exists integers q and r such that a = gq + r, with 0 r < g Notice that r = a gq = a (as + bt)q = a(1 sq) + btq If r > 0, then r A and r is smaller than g, the least element in A. Therefore r = 0 and g divides a. The same argument holds when b replaces a. Thus, g divides a and b.
13 proofs 13 Lamé s Theorem Lamé s theorem establishes an upper bound on the time complexity of the Euclidean algorithm for computing the greatest common divisor of two integers. The result is that Euclid s algorithm has logarithmic time complexity. Specifically, no more than 3 lg(max(a, n)) divisions are required to compute gcd(a, n), the greatest common divisor of a and n. The Fibonacci numbers are occur in the proof of Lamé s theorem. Theorem 7 (Lamé s Theorem). Let a, b Z + with a b. Let n be the number of divisions in Euclid s algorithm to compute gcd(a, b). Then n 1 3 lg b Proof. Let r 0 = a and r 1 = b. Euclid s algorithm computes r 0 = r 1 q 1 + r 2 0 r 2 < r 1 r 1 = r 2 q 2 + r 3 0 r 3 < r 2. r n 2 = r n 1 q n 1 + r n 0 r n < r n 1 r n 1 = r n q n using n divisions to compute r n = gcd(a, b). Note that q i 1, i = 1, 2,..., n 1 r n < r n 1 q n 2 Let F i denote the i th Fibonacci number. Then r n 1 = F 2 r n 1 = r n q n 2r n 2 = F 3 r n 2 r n 1 + r n F 3 + F 2 = F 4. r 2 r 3 + r 4 F n 1 + F n 2 = F n r 1 r 2 + r 3 F n + F n 1 = F n+1 Using the growth rate of the Fibonacci numbers F n+1 φ n 1, we find b = r 1 F n+1 > φ n 1 Taking the logarithm base φ of both sides of the inequality yields log φ b = lg b lg φ > n 1
14 proofs 14 Since (lg φ) 1 < 3 we have 3 lg b > lg b lg φ > n 1 Another way to state the result is that if b can be represented in k bits, then the number of divisions in Euclid s algorithm is less than 3 times the number of bits in b s binary representation. The Binomial Theorem Theorem 8 (Binomial Theorem). Let x and y be real numbers, and let n be a natural number. Then ( ) n (x + y) n = x n k y k k 0 k n ( ) ( ) ( ) ( ) ( ) n n n n n = x n + x n 1 y + x n 2 y xy n 1 + y n n 1 n The Prime Number Theorem Theorem 9 (Prime Number Theorem). Let P = {2, 3, 5, 7, 11,...} be the set of prime numbers. Then the number of primes less than or equal to x is approximately x/ ln x as x goes to infinity. That is, Problems on Proofs {p P : (p x)} ln x lim x = 1 x 1. Construct a truth table to prove that resolution is a tautology. [(p q) ( p r)] (q r) 2. Let n be an integer. Prove that if n is odd, then n = 4k + 1 or n = 4n + 3 for some integer k. 3. Find a counterexample to prove the statement All shapes that have four sides of equal length are squares. 4. Let a be an integer. Prove that if a 2 is odd, then a is odd. 5. If b < 0 show that the remainder r = a bq is greater than or equal to 0 when the quotient q is has value q = a/b. 6. Is the conditional statement If x then x X. True or False? Explain your answer. 7. Prove that if n is even and n is odd, then n 2 = 2n is a True statement.
15 proofs Let a be a natural number. Prove that if a 2 is a multiple of 3, then a is a multiple of Prove that 3 is irrational. 10. Prove that the greatest common divisor of two consecutive Mersenne numbers is Prove or disprove: The greatest common divisor of two consecutive triangular numbers is Prove of disprove the statement: The 8 bit floating point numbers from the course are closed under multiplication. 13. Prove of disprove the statement: The 8 bit floating point numbers from the course obey the associative law for multiplication. 14. Prove the integers are countable by describing a one-to-one and onto function that maps the natural number to the integers. 15. Prove the Cartesian product N N is countable by describing a one-to-one and onto function that maps the natural number to the N N. (Hint: list the ordered pairs in triangular form (0, 0), (1, 0), (0, 1), (2, 0), (1, 1), (0, 2),... and use the triangular numbers to name the ordered pairs.)
COMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationDiscrete Mathematics Logics and Proofs. Liangfeng Zhang School of Information Science and Technology ShanghaiTech University
Discrete Mathematics Logics and Proofs Liangfeng Zhang School of Information Science and Technology ShanghaiTech University Resolution Theorem: p q p r (q r) p q p r q r p q r p q p p r q r T T T T F T
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics Introductory Notes in Discrete Mathematics Solution Guide Marcel B. Finan c All Rights Reserved 2015 Edition Contents
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationLecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel
Lecture Notes on DISCRETE MATHEMATICS Eusebius Doedel c Eusebius J. Doedel, 009 Contents Logic. Introduction............................................................................... Basic logical
More information586 Index. vertex, 369 disjoint, 236 pairwise, 272, 395 disjoint sets, 236 disjunction, 33, 36 distributive laws
Index absolute value, 135 141 additive identity, 254 additive inverse, 254 aleph, 465 algebra of sets, 245, 278 antisymmetric relation, 387 arcsine function, 349 arithmetic sequence, 208 arrow diagram,
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationFinal Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is
1. Describe the elements of the set (Z Q) R N. Is this set countable or uncountable? Solution: The set is equal to {(x, y) x Z, y N} = Z N. Since the Cartesian product of two denumerable sets is denumerable,
More information1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points
Introduction to Discrete Mathematics 3450:208 Test 1 1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : The inverse of E : The
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationMCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof
MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationCSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
More informationLECTURE NOTES DISCRETE MATHEMATICS. Eusebius Doedel
LECTURE NOTES on DISCRETE MATHEMATICS Eusebius Doedel 1 LOGIC Introduction. First we introduce some basic concepts needed in our discussion of logic. These will be covered in more detail later. A set is
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More informationMATH 115 Concepts in Mathematics
South Central College MATH 115 Concepts in Mathematics Course Outcome Summary Course Information Description Total Credits 4.00 Total Hours 64.00 Concepts in Mathematics is a general education survey course
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationDISCRETE MATH: FINAL REVIEW
DISCRETE MATH: FINAL REVIEW DR. DANIEL FREEMAN 1) a. Does 3 = {3}? b. Is 3 {3}? c. Is 3 {3}? c. Is {3} {3}? c. Is {3} {3}? d. Does {3} = {3, 3, 3, 3}? e. Is {x Z x > 0} {x R x > 0}? 1. Chapter 1 review
More informationnot to be republished NCERT REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results
REAL NUMBERS CHAPTER 1 (A) Main Concepts and Results Euclid s Division Lemma : Given two positive integers a and b, there exist unique integers q and r satisfying a = bq + r, 0 r < b. Euclid s Division
More informationProofs. Chapter 2 P P Q Q
Chapter Proofs In this chapter we develop three methods for proving a statement. To start let s suppose the statement is of the form P Q or if P, then Q. Direct: This method typically starts with P. Then,
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationPacket #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics
CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus
More informationMATH 2200 Final Review
MATH 00 Final Review Thomas Goller December 7, 01 1 Exam Format The final exam will consist of 8-10 proofs It will take place on Tuesday, December 11, from 10:30 AM - 1:30 PM, in the usual room Topics
More informationWUCT121. Discrete Mathematics. Logic. Tutorial Exercises
WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More information5. Use a truth table to determine whether the two statements are equivalent. Let t be a tautology and c be a contradiction.
Statements Compounds and Truth Tables. Statements, Negations, Compounds, Conjunctions, Disjunctions, Truth Tables, Logical Equivalence, De Morgan s Law, Tautology, Contradictions, Proofs with Logical Equivalent
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) I Semester Core Course. FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc (MATHEMATICS) (2011 Admission Onwards) I Semester Core Course FOUNDATIONS OF MATHEMATICS (MODULE I & ii) QUESTION BANK 1) If A and B are two sets
More informationUndergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationBasic Proof Examples
Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques
More information(3,1) Methods of Proof
King Saud University College of Sciences Department of Mathematics 151 Math Exercises (3,1) Methods of Proof 1-Direct Proof 2- Proof by Contraposition 3- Proof by Contradiction 4- Proof by Cases By: Malek
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationDirect Proof MAT231. Fall Transition to Higher Mathematics. MAT231 (Transition to Higher Math) Direct Proof Fall / 24
Direct Proof MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Direct Proof Fall 2014 1 / 24 Outline 1 Overview of Proof 2 Theorems 3 Definitions 4 Direct Proof 5 Using
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationWhat can you prove by induction?
MEI CONFERENCE 013 What can you prove by induction? Martyn Parker M.J.Parker@keele.ac.uk Contents Contents iii 1 Splitting Coins.................................................. 1 Convex Polygons................................................
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationINTEGERS. In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes.
INTEGERS PETER MAYR (MATH 2001, CU BOULDER) In this section we aim to show the following: Goal. Every natural number can be written uniquely as a product of primes. 1. Divisibility Definition. Let a, b
More informationBoolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012
March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions
More information2 Elementary number theory
2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},
More informationReadings: Conjecture. Theorem. Rosen Section 1.5
Readings: Conjecture Theorem Lemma Lemma Step 1 Step 2 Step 3 : Step n-1 Step n a rule of inference an axiom a rule of inference Rosen Section 1.5 Provide justification of the steps used to show that a
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationIntro to Logic and Proofs
Intro to Logic and Proofs Propositions A proposition is a declarative sentence (that is, a sentence that declares a fact) that is either true or false, but not both. Examples: It is raining today. Washington
More informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
More informationMAT 243 Test 1 SOLUTIONS, FORM A
t MAT 243 Test 1 SOLUTIONS, FORM A 1. [10 points] Rewrite the statement below in positive form (i.e., so that all negation symbols immediately precede a predicate). ( x IR)( y IR)((T (x, y) Q(x, y)) R(x,
More informationMAT115A-21 COMPLETE LECTURE NOTES
MAT115A-21 COMPLETE LECTURE NOTES NATHANIEL GALLUP 1. Introduction Number theory begins as the study of the natural numbers the integers N = {1, 2, 3,...}, Z = { 3, 2, 1, 0, 1, 2, 3,...}, and sometimes
More informationTopics in Logic and Proofs
Chapter 2 Topics in Logic and Proofs Some mathematical statements carry a logical value of being true or false, while some do not. For example, the statement 4 + 5 = 9 is true, whereas the statement 2
More information2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.
2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say
More information(e) Commutativity: a b = b a. (f) Distributivity of times over plus: a (b + c) = a b + a c and (b + c) a = b a + c a.
Math 299 Midterm 2 Review Nov 4, 2013 Midterm Exam 2: Thu Nov 7, in Recitation class 5:00 6:20pm, Wells A-201. Topics 1. Methods of proof (can be combined) (a) Direct proof (b) Proof by cases (c) Proof
More informationMATH CSE20 Homework 5 Due Monday November 4
MATH CSE20 Homework 5 Due Monday November 4 Assigned reading: NT Section 1 (1) Prove the statement if true, otherwise find a counterexample. (a) For all natural numbers x and y, x + y is odd if one of
More informationMATH 2200 Final LC Review
MATH 2200 Final LC Review Thomas Goller April 25, 2013 1 Final LC Format The final learning celebration will consist of 12-15 claims to be proven or disproven. It will take place on Wednesday, May 1, from
More informationReview Sheet for the Final Exam of MATH Fall 2009
Review Sheet for the Final Exam of MATH 1600 - Fall 2009 All of Chapter 1. 1. Sets and Proofs Elements and subsets of a set. The notion of implication and the way you can use it to build a proof. Logical
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More informationn Empty Set:, or { }, subset of all sets n Cardinality: V = {a, e, i, o, u}, so V = 5 n Subset: A B, all elements in A are in B
Discrete Math Review Discrete Math Review (Rosen, Chapter 1.1 1.7, 5.5) TOPICS Sets and Functions Propositional and Predicate Logic Logical Operators and Truth Tables Logical Equivalences and Inference
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationChapter 1, Logic and Proofs (3) 1.6. Rules of Inference
CSI 2350, Discrete Structures Chapter 1, Logic and Proofs (3) Young-Rae Cho Associate Professor Department of Computer Science Baylor University 1.6. Rules of Inference Basic Terminology Axiom: a statement
More informationMTH 299 In Class and Recitation Problems SUMMER 2016
MTH 299 In Class and Recitation Problems SUMMER 2016 Last updated on: May 13, 2016 MTH299 - Examples CONTENTS Contents 1 Week 1 3 1.1 In Class Problems.......................................... 3 1.2 Recitation
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationFundamentals of Pure Mathematics - Problem Sheet
Fundamentals of Pure Mathematics - Problem Sheet ( ) = Straightforward but illustrates a basic idea (*) = Harder Note: R, Z denote the real numbers, integers, etc. assumed to be real numbers. In questions
More informationCSCE 222 Discrete Structures for Computing. Review for Exam 1. Dr. Hyunyoung Lee !!!
CSCE 222 Discrete Structures for Computing Review for Exam 1 Dr. Hyunyoung Lee 1 Topics Propositional Logic (Sections 1.1, 1.2 and 1.3) Predicate Logic (Sections 1.4 and 1.5) Rules of Inferences and Proofs
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More informationProofs. Joe Patten August 10, 2018
Proofs Joe Patten August 10, 2018 1 Statements and Open Sentences 1.1 Statements A statement is a declarative sentence or assertion that is either true or false. They are often labelled with a capital
More informationMATH 363: Discrete Mathematics
MATH 363: Discrete Mathematics Learning Objectives by topic The levels of learning for this class are classified as follows. 1. Basic Knowledge: To recall and memorize - Assess by direct questions. The
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationCOT 2104 Homework Assignment 1 (Answers)
1) Classify true or false COT 2104 Homework Assignment 1 (Answers) a) 4 2 + 2 and 7 < 50. False because one of the two statements is false. b) 4 = 2 + 2 7 < 50. True because both statements are true. c)
More informationSection 0. Sets and Relations
0. Sets and Relations 1 Section 0. Sets and Relations NOTE. Mathematics is the study of ideas, not of numbers!!! The idea from modern algebra which is the focus of most of this class is that of a group
More informationLogic and Proof. Aiichiro Nakano
Logic and Proof Aiichiro Nakano Collaboratory for Advanced Computing & Simulations Department of Computer Science Department of Physics & Astronomy Department of Chemical Engineering & Materials Science
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationOutline Goals and Assumptions Real Numbers Rational and Irrational. L11: Numbers. Alice E. Fischer
L11: Numbers Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing March 5-8, 2018 1 Goals and Assumptions 2 Real Numbers 3 Rational and Irrational Assumptions We rely the following assumptions:
More informationChapter 5. Number Theory. 5.1 Base b representations
Chapter 5 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,
More informationThe Process of Mathematical Proof
1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an
More informationProofs. Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm. Reading (Epp s textbook)
Proofs Methods of Proof Divisibility Floor and Ceiling Contradiction & Contrapositive Euclidean Algorithm Reading (Epp s textbook) 4.3 4.8 1 Divisibility The notation d n is read d divides n. Symbolically,
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationReview 1. Andreas Klappenecker
Review 1 Andreas Klappenecker Summary Propositional Logic, Chapter 1 Predicate Logic, Chapter 1 Proofs, Chapter 1 Sets, Chapter 2 Functions, Chapter 2 Sequences and Sums, Chapter 2 Asymptotic Notations,
More informationMath 10850, fall 2017, University of Notre Dame
Math 10850, fall 2017, University of Notre Dame Notes on first exam September 22, 2017 The key facts The first midterm will be on Thursday, September 28, 6.15pm-7.45pm in Hayes-Healy 127. What you need
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationHANDOUT AND SET THEORY. Ariyadi Wijaya
HANDOUT LOGIC AND SET THEORY Ariyadi Wijaya Mathematics Education Department Faculty of Mathematics and Natural Science Yogyakarta State University 2009 1 Mathematics Education Department Faculty of Mathematics
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationUNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations
UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS 2013 MATH 122: Logic and Foundations Instructor and section (check one): K. Mynhardt [A01] CRN 12132 G. MacGillivray [A02] CRN 12133 NAME: V00#: Duration: 3
More informationModule 1. Integers, Induction, and Recurrences
Module 1. Integers, Induction, and Recurrences This module will look at The integers and the natural numbers. Division and divisors, greatest common divisors Methods of reasoning including proof by contradiction
More informationCMPSCI 250: Introduction to Computation. Lecture 11: Proof Techniques David Mix Barrington 5 March 2013
CMPSCI 250: Introduction to Computation Lecture 11: Proof Techniques David Mix Barrington 5 March 2013 Proof Techniques Review: The General Setting for Proofs Types of Proof: Direct, Contraposition, Contradiction
More information