Mathematical Induction
|
|
- Cathleen Blake
- 5 years ago
- Views:
Transcription
1 Lecture 6 Mathematical Induction The Mathematical Induction is a very powerful tool for proving infinitely many propositions by using only a few steps. In particular, it can be used often when the propositions are involving the nonnegative integer n. Theorem I. (The First Induction) Let fp n g; n m be a family of infinitely many propositions (or statements) involving the integer n, where m is a nonnegative integer. If (i) P m can be proved to be true, and (ii) P kc must be true provided P k is true for any k m, then P n is true for all n m. Theorem II. (The Second Induction) Let fp n g; n m be a family of infinitely many propositions (or statements) involving the integer n, where m is a nonnegative integer. If (i) P m can be proved to be true, and (ii) P kc must be true provided P m ; P mc ; : : : ; P k are all true for any k m, then P n is true for all n m. Note that it seems to be more difficult for using the second induction, since it require more conditions. However it is actually not so. We can use either one freely if necessary. Variations of Mathematical Induction (i) (ii) (iii) (iv) For proving each P n, n ; ; : : :, we can prove P nk ; k ; ; : : : first by induction, and then prove P n for each n. For proving fp n ; n Ng by induction, sometimes it is convenient to prove a stronger proposition Pn 0. For proving fp n ; n n 0 g by induction, sometimes it is convenient to prove P n by induction starting from n n > n 0. The induction can be conducted backwards: (i) Prove each proposition in the subsequence fp nk ; k Ng first, and then (ii) prove that P k is true provided P kc is true.
2 Lecture 6 Mathematical Induction (v) (vi) Cross-Active (or Spiral) Induction: For proving propositions P n ; n 0; ; ; : : : and Q n ; n 0; ; ; : : :, it suffices to show that (i) P 0 and Q 0 are true; (ii) If P k ; Q k are true, then P k ) Q kc ) P kc ) P kc. Multiple Induction: Let fp n;m ; n; m Ng be a sequence of propositions with two independent parameters n and m. If (i) P ;m is true for all m N and P n; are true for all n N; (ii) P nc;mc is true provided P n;mc and P nc;m are true, then P n;m is true for any n; m N. Examples Example. Prove by induction that 3 C 3 C C n 3 n.n C / for each n N. Hence prove that 3 C 3 3 C 5 3 C C.n / 3 n.n / for each n N. Solution Let P n be the statement 3 C 3 C C n 3 n.n C / ; n ; ; : : :: For n, left hand side. C / right hand side, P is proven. Assume that P k is true (k ), i.e. 3 C 3 C C k 3 k.k C /, then for n k C, 3 C 3 C C.k C / 3 3 C 3 C C k 3 C.k C / 3 k.k C / C.k C / 3.k C / Œk C.k C /.k C /.k C / : Thus, P kc is also true. By induction, P n is true for each n N. Now for any positive integer n, 3 C 3 3 C C.n / 3 3 C 3 C C.n/ 3. 3 C 3 C C.n/ 3 /.n/.n C / 3. 3 C 3 C C n 3 / n.n C / 8 n.n C / n.n C / n.n C / n Œ.n C /.n C / n.n /; as desired. Example. (CWMO/008) fa n g is a sequence of real numbers, satisfying a 0 0;, a a 0 ; a nc a n. a n / for all n N. Prove that for any positive
3 Lecture Notes on Mathematical Olympiad 3 integer n, a 0 a a n a 0 C a C C a n : namely Solution The given condition yields a nc a n. a n /; n N 0, hence a nc a n a n. a n / a n a. a / a n a a 0 ; a nc a 0 a a n ; n ; ; : : :: We now prove the original conclusion by induction. For n, a 0 a a 0 C a a 0 C a, the conclusion is proven. Assume that the proposition is true for n k, then for n k C, a 0 a a kc C C C a 0 a a kc a 0 a a k C C C a kc C a 0 a a k a 0 a a k a kc C a 0 a a k : Thus, the proposition is true for n k C also. By induction, the conclusion is true for all n N. Example 3. (IMO/Shortlist/006) The sequence of real numbers a 0 ; a ; a ; : : : is defined recursively by a n k a 0 ; 0 for n : k C Show that a n > 0 for n. k0 k0 Solution The proof goes by induction on n. For n the formula yields a =. Take n and assume a ; : : : ; a n > 0. Write the recurrence formula for n and n C respectively as nc a k n k C 0 and X a k n k C 0: Subtraction yields nc X a k 0.n C / n k C k0.n C /a nc C k0 k0.n C / n C n k C k0 a k n k C n C a k : n k C
4 Lecture 6 Mathematical Induction The coefficient of a 0 vanishes, so a nc n C k n C k n C n k C n C a k n k C k.n k C /.n k C / a k: The coefficients of a ; : : : ; a n are all positive. Therefore, a ; : : : ; a n > 0 implies a nc > 0. Example. (CHNMO/00) (edited) If 0 < x x : : : x s ; 0 < y y : : : y s satisfy the condition that x r C xr C C xr s y C y r C C yr s ; for all r N; prove that x i y i ; i ; ; : : :; s. Solution We prove by induction on s. Let P s ; s ; ; : : : be the statement to be proven. For s, taking r yields x y. Assume that P s is true for s k (k ) i.e., x y ; x y ; : : : ; x k y k : then for s k C, if x kc y kc, without loss of generality we assume that x kc < y kc. Then x y kc r C C xkc y kc r y y kc r r yk C C C : y kc But on the other hand, since 0 < x i < ; i ; ; : : :; k C, letting r! C y kc yields 0, a contradiction. Hence x kc y kc, then the inductive assumption implies that x i y i ; i ; ; : : :; k. Thus, P kc is also true. By induction, P s is true for each s N. Example 5. (AM-GM Inequality) For real numbers a ; a ; : : : ; a n > 0, prove that a Ca C Ca n n np a a a n ;./ and that equality holds if and only if a a a n. Solution We first prove () for n t ; t N by induction on t. When t,./,. p p a a / 0, so it s true.
5 Lecture Notes on Mathematical Olympiad 5 Assume that () is true for t k, then for t k C, by the induction assumption, X kc j a j k X j a j C k X j a j C k k q k Y k j a j C k q k Y k a j C k j k q kc Y kc j a j kc q kc Y kc j a j : Thus, the proposition is proven for t k C. By induction, () is proven for all n t ; t ; ; : : :. Next we prove () for each n N. For any n N which is not of the form t, there exist an s N such that s < n < s. Since a Ca C Ca s s s p a a a s;./ By letting a nc a nc a s np a a a n in (), () yields a C a C C a n C. s n/ np a a a n s sq.a a a n /.a a a n / s n n s n p a a a n ; ) a C a C C a n n n p a a a n ; hence./ is proven for general n N. Example 6. (CMC/007) For each positive integer n >, prove that Solution n 3n C < n C C n C C C n C n < 5 : To prove the left inequality, define f.n/ n C C n C C C n C n Then f.n C / n C C n C 3 C C f.n C / f.n/ n 3n C ; n N: n C n C 3n C, so n C n C n C 3n C.n C /.n C /.3n C /.3n C / n.n C 3/.n C /.n C /.3n C /.3n C / > 0; n C 3n C
6 6 Lecture 6 Mathematical Induction i.e., f.n/ is an increasing function of n. Thus, for n, f.n/ f./ 3 C 7 8 > 0; the left inequality is proven. Below we prove the right inequality by proving a stronger one by induction. Let the proposition P n ; n be is 5 n C C n C C C n C n < 5 n C : When n, the left hand side of P is 3 C 7, and the right hand side 9 7, so P is true. Assume P n is true for n k (k ), i.e., k C C k C C C k C k < 5 Then for n k C, the left hand side of P kc is Since k C 5 0, therefore k C C C k C k C C C k C 5 5 k C C k C C k C k C 5 C k C 5 k C k C C C k C < 5 k C k C C k C k C : k C 3 k C k C :.k C /.k C /.k C /.k C 5/ < k C 5. Thus, P kc is true also. The inductive proof is completed. Example 7. Suppose that a ; a ; ; a n ; are real numbers with 0 a i for i ; ;. Prove that for every n, i C a i n C np a a a n :./ Solution As the first step, we prove the conclusion for all n with the form m by induction on m. For m, the inequality () becomes C C a C a C p a a
7 Lecture Notes on Mathematical Olympiad 7 or equivalently:. C a /. C a /. C a C a /. p a a C /; a C a C a a. C a C a / p a a ; p.a C a /. a a / p p a a. a a / 0;. p p a a / p. a a / 0: Therefore the conclusion is true. Assume that for m k (k ) the conclusion is true, i.e. Then, for m k C X kc i C a i k X i k X i C a i k p : C k a a a k C C a i C a i k X i q pa p C k a a3 a p a kc a kc kc k p : C kc a a a kc C p a i a i Therefore the conclusion is true for all n m ; m N. Next, to show that () is true for all n N, it suffices to show that () is true p for n k.k / if () is true for n k. In fact, by letting a k k a a a k, we have kx i C C a i C k p a a a k k C kp a a a k p k a a a k therefore we have kx i C a i k C k p a a a k : By backward induction, () is true for each n N. k C k p a a a k ; Example 8. Let ff n g, n N be the Fibonacci sequence. Prove that F nc CF n F nc for each n N.
8 8 Lecture 6 Mathematical Induction Solution Let P n W FnC C F n F nc; Q n W F nc F n C FnC F nc for n ; ; : : :. When n, then P ; Q are obvious since F F. When P k ; Q k are true for n k (k ), i.e., F kc C F k F kc and F kc F k C F kc F kc, then F kc C F kc.f kc C F k / C F kc.f kc C F kcf k / C.F k C F kc / F kc C F kc F kc3 F.kC/C ; i.e., P kc is true. Further, P kc and Q k are true yields F kc F kc C F kc.f kc C F k /F kc C F kc.f kc C F kc / C.F kc C F kcf k / F kc3 C F kc F kc F.kC/C ; namely Q kc is true. By the cross-active induction, P n ; Q n are true for each n N. Example 9. m boxes are arranged in a row. Prove that there are different ways to put n identical balls into these boxes..n C m /Š nš.m /Š Solution By F.n; m/ we denote the number of ways to put n identical balls into m boxes. The propositions to be proven are F.n; m/.n C m /Š nš.m /Š for n; m N. For n, we have F.; m/ m mš, hence the conclusion is true.m /Š for n and all m N. For m and any n N, we have F.n; / nš nš, therefore the conclusion is true for m and all n N..n C m/š.n C m/š Suppose that F.nC; m/ and F.n; mc/..n C /Š.m /Š nšmš To evaluate F.n C ; m C /, by considering whether the number of balls in the m C st box is 0 or greater than 0, we have F.n C ; m C /.n C m/š F.n C ; m/ C F.n; m C /.n C /Š.m /Š.n C m/š.m C n C /.m C n C /Š.n C /ŠmŠ.n C /Š.mŠ/ The inductive proof is completed. C.n C m/š nšmš Œ.n C / C.m C / Š :.n C /Š.m C /Š
9 Lecture Notes on Mathematical Olympiad 9 Testing Questions (A) : (USAMO/00) Let S be a set with 00 elements, and let N be an integer with 0 N 00. Prove that it is possible to color every subset of S either blue or red so that the following conditions hold: (a) (b) (c) the union of any two red subsets is red; the union of any two blue subsets is blue; there are exactly N red subsets. : (CHNMO/TST/005) Let k be a positive integer. Prove that it is always possible to partition the set f0; ; ; 3; : : :; kc g into two disjoint subsets fx ; x ; : : : ; x kg and fy ; y ; : : : ; y kg such that for each m f; ; : : :; kg. X k xi m i X k yi m i holds 3: (CMC/006)Let f.x/ x Ca. efine f.x/ f.x/; f n.x/ f.f n.x//, n ; 3; : : : and M fa Rj jf n.0/j for all n Ng. Prove that M ; : : (BELARUS/007) For positive real numbers x ; x ; : : : ; x nc, prove that C x C x x C C x x x n. x x x nc /: x x x 3 x nc 5: (CMC/00) Given the sequence fa n g, a and a nc a a a n C for n ; ; : : :. Prove that a C a C C a n C C 8 C C n n N: 6: (AUSTRIA/009) Prove that 3 n >.nš/ for all positive integers n. 7: (CHNMO/TST/008) Let a and b be positive integers with.a; b/, and a; b having different parities. Let the set S have the following properties: () a; b S; (ii) If x; y; z S, then x C y C z S. Prove that all the integers greater than ab are in S. 8: (USAMO/007) Let S be a set containing n C n elements, for some positive integer n. Suppose that the n-element subsets of S are partitioned into two classes. Prove that there are at least n pairwise disjoint sets in the same class.
10 0 Lecture 6 Mathematical Induction Testing Questions (B) : (CHNMO/TST/00) It is given that the real numbers a i ; b i (i 0; ; : : :; n) satisfy the following three conditions: (i) a i C a ic 0 for i 0; ; : : :; n ; (ii) a j C 0 for j 0; ; : : :; n ; (iii) For any integers p; q with 0 p q n, Prove that. / i a i b i 0, and find the condition under which the equality holds. i0 Xq kp b k > 0. : (USAMO/007) Prove that for every nonnegative integer n, the number 7 7n C is the product of at least n C 3 (not necessarily distinct) primes. 3: (BULGARIA/007) Let a > ; a nc p.n C /a n C ; n ; ; : : :. Prove that (i) a n > n is convergent. n ; n N; (ii) The sequence b n n a n n ; n N : (USAMO/00) There are n students standing in a circle, one behind the other. The students have heights h < h < : : : < h n. If a student with height h k is standing directly behind a student with height h k or less, the two students are permitted to switch places. Prove that it is not possible to make more than n 3 such switches before reaching a position in which no further switches are possible. 5: (IMO/00) In each of six boxes B ; B ; B 3 ; B ; B 5 ; B 6 there is initially one coin. There are two types of operation allowed: Type : Choose a nonempty box B j with j 5. Remove one coin from B j and add two coins to B j C. Type : Choose a nonempty box B k with k. Remove one coin from B k and exchange the contents of (possibly empty) boxes B kc and B kc. etermine whether there is a finite sequence of such operations that results in boxes B ; B ; B 3 ; B ; B 5 being empty and box B 6 containing exactly coins. (Note that a bc a.bc/.)
Axioms for Set Theory
Axioms for Set Theory The following is a subset of the Zermelo-Fraenkel axioms for set theory. In this setting, all objects are sets which are denoted by letters, e.g. x, y, X, Y. Equality is logical identity:
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More informationPUTNAM TRAINING PROBLEMS
PUTNAM TRAINING PROBLEMS (Last updated: December 3, 2003) Remark This is a list of Math problems for the NU Putnam team to be discussed during the training sessions Miguel A Lerma 1 Bag of candies In a
More informationDiscrete Mathematics, Spring 2004 Homework 4 Sample Solutions
Discrete Mathematics, Spring 2004 Homework 4 Sample Solutions 4.2 #77. Let s n,k denote the number of ways to seat n persons at k round tables, with at least one person at each table. (The numbers s n,k
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More information40th Canadian Mathematical Olympiad
40th Canadian Mathematical Olympiad Wednesday, March 26, 2008 Solutions - CMO 2008 1. ABCD is a convex quadrilateral in which AB is the longest side. Points M and N are located on sides AB and BC respectively,
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More information1.2 MATHEMATICAL INDUCTION. Peano s Postulates and Induction. 10 Chapter 1 The Real Numbers
10 Chapter 1 The Real Numbers 1. MATHEMATICAL INDUCTION If a flight of stairs is designed so that falling off any step inevitably leads to falling off the next, then falling off the first step is a sure
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationPUTNAM TRAINING EASY PUTNAM PROBLEMS
PUTNAM TRAINING EASY PUTNAM PROBLEMS (Last updated: September 24, 2018) Remark. This is a list of exercises on Easy Putnam Problems Miguel A. Lerma Exercises 1. 2017-A1. Let S be the smallest set of positive
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 informationINDUCTION AND RECURSION. Lecture 7 - Ch. 4
INDUCTION AND RECURSION Lecture 7 - Ch. 4 4. Introduction Any mathematical statements assert that a property is true for all positive integers Examples: for every positive integer n: n!
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationMath 3450 Homework Solutions
Math 3450 Homework Solutions I have decided to write up all the solutions to prolems NOT assigned from the textook first. There are three more sets to write up and I am doing those now. Once I get the
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationMATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017
MATH 220 (all sections) Homework #12 not to be turned in posted Friday, November 24, 2017 Definition: A set A is finite if there exists a nonnegative integer c such that there exists a bijection from A
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationDefining the Integral
Defining the Integral In these notes we provide a careful definition of the Lebesgue integral and we prove each of the three main convergence theorems. For the duration of these notes, let (, M, µ) be
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationPutnam Greedy Algorithms Cody Johnson. Greedy Algorithms. May 30, 2016 Cody Johnson.
1 Introduction Greedy Algorithms May 0, 2016 Cody Johnson ctj@math.cmu.edu A greedy algorithm is an algorithm that chooses the optimal choice in the short run. 2 Examples 1. Prove that every nonnegative
More informationFinite and Infinite Sets
Chapter 9 Finite and Infinite Sets 9. Finite Sets Preview Activity (Equivalent Sets, Part ). Let A and B be sets and let f be a function from A to B..f W A! B/. Carefully complete each of the following
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 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 informationP-adic Functions - Part 1
P-adic Functions - Part 1 Nicolae Ciocan 22.11.2011 1 Locally constant functions Motivation: Another big difference between p-adic analysis and real analysis is the existence of nontrivial locally constant
More informationASSIGNMENT 1 SOLUTIONS
MATH 271 ASSIGNMENT 1 SOLUTIONS 1. (a) Let S be the statement For all integers n, if n is even then 3n 11 is odd. Is S true? Give a proof or counterexample. (b) Write out the contrapositive of statement
More informationStatistical Inference
Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory
More informationGenerating Functions (Revised Edition)
Math 700 Fall 06 Notes Generating Functions (Revised Edition What is a generating function? An ordinary generating function for a sequence (a n n 0 is the power series A(x = a nx n. The exponential generating
More informationHomework 7 Solutions, Math 55
Homework 7 Solutions, Math 55 5..36. (a) Since a is a positive integer, a = a 1 + b 0 is a positive integer of the form as + bt for some integers s and t, so a S. Thus S is nonempty. (b) Since S is nonempty,
More informationThe Pigeonhole Principle
The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,
More informationCOMBINATORIAL COUNTING
COMBINATORIAL COUNTING Our main reference is [1, Section 3] 1 Basic counting: functions and subsets Theorem 11 (Arbitrary mapping Let N be an n-element set (it may also be empty and let M be an m-element
More information36th United States of America Mathematical Olympiad
36th United States of America Mathematical Olympiad 1. Let n be a positive integer. Define a sequence by setting a 1 = n and, for each k > 1, letting a k be the unique integer in the range 0 a k k 1 for
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 informationMATH 13 SAMPLE FINAL EXAM SOLUTIONS
MATH 13 SAMPLE FINAL EXAM SOLUTIONS WINTER 2014 Problem 1 (15 points). For each statement below, circle T or F according to whether the statement is true or false. You do NOT need to justify your answers.
More informationWeek Some Warm-up Questions
1 Some Warm-up Questions Week 1-2 Abstraction: The process going from specific cases to general problem. Proof: A sequence of arguments to show certain conclusion to be true. If... then... : The part after
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationStanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon Measures
2 1 Borel Regular Measures We now state and prove an important regularity property of Borel regular outer measures: Stanford Mathematics Department Math 205A Lecture Supplement #4 Borel Regular & Radon
More informationMATH 55 - HOMEWORK 6 SOLUTIONS. 1. Section = 1 = (n + 1) 3 = 2. + (n + 1) 3. + (n + 1) 3 = n2 (n + 1) 2.
MATH 55 - HOMEWORK 6 SOLUTIONS Exercise Section 5 Proof (a) P () is the statement ( ) 3 (b) P () is true since ( ) 3 (c) The inductive hypothesis is P (n): ( ) n(n + ) 3 + 3 + + n 3 (d) Assuming the inductive
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
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 informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationOlympiad Combinatorics. Pranav A. Sriram
Olympiad Combinatorics Pranav A. Sriram August 2014 Chapter 4: Existence 1 Copyright notices All USAMO and USA Team Selection Test problems in this chapter are copyrighted by the Mathematical Association
More informationAny Wizard of Oz fans? Discrete Math Basics. Outline. Sets. Set Operations. Sets. Dorothy: How does one get to the Emerald City?
Any Wizard of Oz fans? Discrete Math Basics Dorothy: How does one get to the Emerald City? Glynda: It is always best to start at the beginning Outline Sets Relations Proofs Sets A set is a collection of
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More information(1) Which of the following are propositions? If it is a proposition, determine its truth value: A propositional function, but not a proposition.
Math 231 Exam Practice Problem Solutions WARNING: This is not a sample test. Problems on the exams may or may not be similar to these problems. These problems are just intended to focus your study of the
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 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 informationMath Circle: Recursion and Induction
Math Circle: Recursion and Induction Prof. Wickerhauser 1 Recursion What can we compute, using only simple formulas and rules that everyone can understand? 1. Let us use N to denote the set of counting
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationDivisibility = 16, = 9, = 2, = 5. (Negative!)
Divisibility 1-17-2018 You probably know that division can be defined in terms of multiplication. If m and n are integers, m divides n if n = mk for some integer k. In this section, I ll look at properties
More informationIntroduction and Preliminaries
Chapter 1 Introduction and Preliminaries This chapter serves two purposes. The first purpose is to prepare the readers for the more systematic development in later chapters of methods of real analysis
More informationCSC B36 Additional Notes sample induction and well-ordering proofs. c Nick Cheng
CSC B36 Additional Notes sample induction and well-ordering proofs c Nick Cheng Introduction We present examples of induction proofs here in hope that they can be used as models when you write your own
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationProblem Set 5 Solutions
Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true
More informationMATH 145 LECTURE NOTES. Zhongwei Zhao. My Lecture Notes for MATH Fall
MATH 145 LECTURE NOTES Zhongwei Zhao My Lecture Notes for MATH 145 2016 Fall December 2016 Lecture 1, Sept. 9 Course Orientation and Organization About the Professor Stephen New MC 5419 Ext 35554 Email:
More informationULTRAFILTER AND HINDMAN S THEOREM
ULTRAFILTER AND HINDMAN S THEOREM GUANYU ZHOU Abstract. In this paper, we present various results of Ramsey Theory, including Schur s Theorem and Hindman s Theorem. With the focus on the proof of Hindman
More informationLogical Connectives and Quantifiers
Chapter 1 Logical Connectives and Quantifiers 1.1 Logical Connectives 1.2 Quantifiers 1.3 Techniques of Proof: I 1.4 Techniques of Proof: II Theorem 1. Let f be a continuous function. If 1 f(x)dx 0, then
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationChapter 5: Integer Compositions and Partitions and Set Partitions
Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Winter 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Winter 2017 1 / 32 5.1. Compositions A strict
More informationBaltic Way 2003 Riga, November 2, 2003
altic Way 2003 Riga, November 2, 2003 Problems and solutions. Let Q + be the set of positive rational numbers. Find all functions f : Q + Q + which for all x Q + fulfil () f ( x ) = f (x) (2) ( + x ) f
More informationTopological properties
CHAPTER 4 Topological properties 1. Connectedness Definitions and examples Basic properties Connected components Connected versus path connected, again 2. Compactness Definition and first examples Topological
More informationSummer Jump-Start Program for Analysis, 2012 Song-Ying Li. 1 Lecture 7: Equicontinuity and Series of functions
Summer Jump-Start Program for Analysis, 0 Song-Ying Li Lecture 7: Equicontinuity and Series of functions. Equicontinuity Definition. Let (X, d) be a metric space, K X and K is a compact subset of X. C(K)
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 informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationAustralian Intermediate Mathematics Olympiad 2016
Australian Intermediate Mathematics Olympiad 06 Questions. Find the smallest positive integer x such that x = 5y, where y is a positive integer. [ marks]. A 3-digit number in base 7 is also a 3-digit number
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationSupplementary Notes for W. Rudin: Principles of Mathematical Analysis
Supplementary Notes for W. Rudin: Principles of Mathematical Analysis SIGURDUR HELGASON In 8.00B it is customary to cover Chapters 7 in Rudin s book. Experience shows that this requires careful planning
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationn(n 1) = (n + 1)n(n 1)/ ( 1) n(n 1)(n 2) = (n + 1)n(n 1)(n 2)/4
NOTES FROM THE FIRST TWO CLASSES MIKE ZABROCKI - SEPTEMBER 6 &, 202 main idea of this class + 2 + 3 + + n = n(n + )/2 to r + 2 r + + n r =??? Just to show what we are up against: + 2 + 3 + + n = n(n +
More information9/19/2018. Cartesian Product. Cartesian Product. Partitions
Cartesian Product The ordered n-tuple (a 1, a 2, a 3,, a n ) is an ordered collection of objects. Two ordered n-tuples (a 1, a 2, a 3,, a n ) and (b 1, b 2, b 3,, b n ) are equal if and only if they contain
More informationMASTERS EXAMINATION IN MATHEMATICS SOLUTIONS
MASTERS EXAMINATION IN MATHEMATICS PURE MATHEMATICS OPTION SPRING 010 SOLUTIONS Algebra A1. Let F be a finite field. Prove that F [x] contains infinitely many prime ideals. Solution: The ring F [x] of
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationCompatible probability measures
Coin tossing space Think of a coin toss as a random choice from the two element set {0,1}. Thus the set {0,1} n represents the set of possible outcomes of n coin tosses, and Ω := {0,1} N, consisting of
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationMathematical Structures Combinations and Permutations
Definitions: Suppose S is a (finite) set and n, k 0 are integers The set C(S, k) of k - combinations consists of all subsets of S that have exactly k elements The set P (S, k) of k - permutations consists
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 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 informationChapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms
1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of
More informationHEAGAN & CO., OPP. f>, L. & W. DEPOT, DOYER, N. J, OUR MOTTO! ould Iwv ia immediate vltlui. VEEY BEST NEW Creamery Butter 22c ib,
#4 NN N G N N % XX NY N Y FY N 2 88 N 28 k N k F P X Y N Y /» 2«X ««!!! 8 P 3 N 0»9! N k 25 F $ 60 $3 00 $3000 k k N 30 Y F00 6 )P 0» «{ N % X zz» «3 0««5 «N «XN» N N 00/ N 4 GN N Y 07 50 220 35 2 25 0
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationAnswers and Hints for Selected Exercises
Appendix C Answers and Hints for Selected Exercises Section 1.1 1. Sentences (a), (c),(e), (f), (j) and (k) are statements. Sentence (h) is a statement if we are assuming that n is a prime number means
More informationBounded Derivatives Which Are Not Riemann Integrable. Elliot M. Granath. A thesis submitted in partial fulfillment of the requirements
Bounded Derivatives Which Are Not Riemann Integrable by Elliot M. Granath A thesis submitted in partial fulfillment of the requirements for graduation with Honors in Mathematics. Whitman College 2017 Certificate
More informationImmerse Metric Space Homework
Immerse Metric Space Homework (Exercises -2). In R n, define d(x, y) = x y +... + x n y n. Show that d is a metric that induces the usual topology. Sketch the basis elements when n = 2. Solution: Steps
More informationPart IA. Numbers and Sets. Year
Part IA Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2017 19 Paper 4, Section I 1D (a) Show that for all positive integers z and n, either z 2n 0 (mod 3) or
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
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 informationd(x n, x) d(x n, x nk ) + d(x nk, x) where we chose any fixed k > N
Problem 1. Let f : A R R have the property that for every x A, there exists ɛ > 0 such that f(t) > ɛ if t (x ɛ, x + ɛ) A. If the set A is compact, prove there exists c > 0 such that f(x) > c for all x
More information1.2 The Well-Ordering Principle
36 Chapter 1. The Integers Exercises 1.1 1. Prove the following theorem: Theorem. Let m and a be integers. If m a and a m, thenm = ±a. 2. Prove the following theorem: Theorem. For all integers a, b and
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More informationMATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM
MATH 61-02: PRACTICE PROBLEMS FOR FINAL EXAM (FP1) The exclusive or operation, denoted by and sometimes known as XOR, is defined so that P Q is true iff P is true or Q is true, but not both. Prove (through
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationTopology. Xiaolong Han. Department of Mathematics, California State University, Northridge, CA 91330, USA address:
Topology Xiaolong Han Department of Mathematics, California State University, Northridge, CA 91330, USA E-mail address: Xiaolong.Han@csun.edu Remark. You are entitled to a reward of 1 point toward a homework
More informationMcGill University Math 354: Honors Analysis 3
Practice problems McGill University Math 354: Honors Analysis 3 not for credit Problem 1. Determine whether the family of F = {f n } functions f n (x) = x n is uniformly equicontinuous. 1st Solution: The
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationExtension of continuous functions in digital spaces with the Khalimsky topology
Extension of continuous functions in digital spaces with the Khalimsky topology Erik Melin Uppsala University, Department of Mathematics Box 480, SE-751 06 Uppsala, Sweden melin@math.uu.se http://www.math.uu.se/~melin
More information