Problems on Discrete Mathematics 1

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Problems on Discrete Mathematics 1 Chung-Chih Li Kishan Mehrotra 3 L A TEX at July 18, No part of this book can be reproduced without permission from the authors Illinois State University, Normal, Illinois 3 Syracuse University, Syracuse, New York

2

3 Chapter 3 Mathematical Induction To develop the skill of correct thinking is in the first place to learn what you have to disregard In order to go on, you have to leave out; this is the essence of effective thinking Kurt Gödel

4

5 31 Concepts Concepts Mathematical induction is one of the most important and powerful techniques for verifying mathematical statements Many complicated mathematical theorems about integers can be proved easily by mathematical induction It is easy because the frame of the proof is unique and the underlying idea of mathematical induction is intuitively understandable Think of infinitely many dominoes lined up The proof by mathematical induction is like the domino effect illustrated in the following figure: If the first domino falls, and for any n if the fall of the n th domino would result in the knockdown of the (n + 1) st domino, then any domino in the line will fall 311 Necessary Conditions of Using Mathematical Induction In the domino analogue above, to be able to (1) line up the dominoes, and () identify the first domino in the line are two necessary conditions for knocking down all of the dominoes The two conditions are exactly the same necessary conditions for being able to make use of mathematical induction Suppose a given mathematical statement is about a property over the domain S If all elements in S can be well ordered, ie, (1) we can enumerate all elements in S one by one, and () we can identify the first element in the enumeration, then mathematical induction is very likely to be the approach for verifying the statement In particular, any well-ordered set S can be represented as S = {s 0, s 1, s, } In this representation, (1) for any element a in S, there is n N such that a = s n (all dominoes have been lined up properly), and () s 0 is identified, which is called the least element (s 0 serves as the first domino in the line to fall) Example 31 Sets such as natural numbers, integers, even numbers, odd

6 104 3 Mathematical Induction numbers, multiples of, etc, are typical well-ordered sets that are often encountered in mathematics They can be represented as: Natural numbers : {1,, 3, 4, }; Integers : {0, 1, 1,,, 3, 3, }; Even numbers : {0,,, 4, 4, }; Odd numbers : {1, 1, 3, 3,,, }; Multiples of : {0,,, 10, 10, } For more advanced mathematical inductive proof, the domain set may be rational numbers, prime numbers, or any other well-ordered sets 31 The Underlying Theory of Mathematical Induction The underlying theory of mathematical induction is very simple It is nothing but repeated application of the logical rule, Modus Ponens Suppose and we have proved that S = {s 0, s 1, s, }, [P (s 0 ) = T ] and [ n NP (s n ) P (s n+1 )] Given any i N, we can claim that P (s i ) = T by the following inferences steps reasons 1 P (s 0 ) proved P (s 0 ) P (s 1 ) proved 3 P (s 1 ) 1,, Modus Ponens 4 P (s 1 ) P (s ) proved P (s ) 3,4, Modus Ponens 6 P (s ) P (s 3 ) proved 7 P (s 3 ),6, Modus Ponens P (s i 1 ) Modus Ponens P (s i 1 ) P (s i ) proved P (s i ) Modus Ponens Therefore, we can claim that for all a in S, P (a) is a true statement Comment: In most problems, to prove P (s 0 ) = T is trivial The main task is to prove that P (s n ) P (s n+1 ) for any n

7 31 Concepts Mathematical Induction of the First Form (Weak Induction) Suppose that the universal set (domain) is the set of non-negative integers, and P (n) is any property of non-negative integers We wish to prove that P (n) is true for all n = 0, 1,, ; ie, np (n) Then the following procedure can be applied Step 1: Prove that P (0) is true This step is known as the basis step, and the proved result, P (0) = T, is called the basis of induction Step : Let n be an arbitrary fixed integer, and assume that P (n) is true This assumption is called the weak inductive hypothesis Step 3: Use the assumption in step to prove that P (n + 1) is true This step is known as the inductive step If we can prove the basis in step 1 and the implication in step 3, then we can claim that P (n) is true for all n = 0, 1,, This method of proof is known as the mathematical induction of the first form or the weak induction Comment: The above proof procedure is an application of the following rule of inference, 1 P (0) n[p (n) P (n + 1)] 3 np (n), where the first assertion, P (0), is proved in step 1, and the second assertion, n[p (n) P (n + 1)], is shown by picking an arbitrary value of n for P (n) in step and by the implication proved in step 3 Comment: One should not be confused by the statement in step let n be an arbitrary fixed integer, and assume that P (n) = T and the goal for all n P (n) = T that we want to prove The letter n in step denotes an instance in the domain, and the letter n in the statement np (n) is a variable that ranges over the domain After step, the instance n is fixed The following modification makes the difference explicit, but it also makes the proof awkward, and hence, for simplicity, most textbooks do not use it Step : For the inductive hypothesis, we assume that P (n) = T when n = i for some i in the domain Step 3: In the inductive step, we prove that P (i) P (i + 1)

8 106 3 Mathematical Induction Then we conclude that for all n in the domain, P (n) = T Comment: In some instances, a weak inductive hypothesis cannot provide sufficient ground to prove that P (n + 1) is true in step 3 We need a stronger inductive hypothesis that is introduced in the next subsection 314 Mathematical Induction of the Second Form (Strong Induction) Suppose that the universal set (domain) is the set of non-negative integers, and P (n) is any property of non-negative integers We wish to prove that P (n) is true for all n = 0, 1,, ; ie, np (n) The following procedure can be applied Step 1: Prove that P (0) is true This step is known as the basis step, and the proved result P (0) = T is called the basis of induction Step : Let n be an arbitrary fixed integer in the domain, and assume that P (0), P (1),, and P (n) are true This assumption is called the strong inductive hypothesis Step 3: Use the assumption to prove that P (n + 1) is true This step is known as the inductive step If we can prove the basis in step 1 and the implication in step 3, then we can claim that that P (n) is true for all n = 0, 1,, This method of proof is known as the mathematical induction of the second form, or the strong induction Comment: The above proof procedure is an application of the following rule of inference, 1 P (0) n[(p (0) P (1) P (n)) P (n + 1)] 3 np (n) Comment: Sometimes we prove that P (n) is true for n S, where S = {s 0, s 1, s, }, and s 0 may not be equal to 0, or in some cases S may not be a set of numbers at all If that is the case, the basis step changes to: Step 1: Show that P (s 0 ) is true Comment: In some problems, one may claim that P (n) is true for all n {0, 1,, }, but the basis is not P (0), but P (1) or P () It is important to recognize this property; otherwise, incorrect proofs are obtained See problem 17 in the problem section of this chapter and its note on page 33

9 3 Mathematical Induction and Recursive Definition Mathematical Induction and Recursive Definition Mathematical induction and recursive definitions are intimately related They should be viewed as two sides of the same coin Recursion is a very useful apparatus for defining sets, functions, 1 and the programming syntax 31 Recursive Definitions for Functions Theoretically, any computable function can be defined recursively In the following we take the point of view that the argument of the function f takes values in the set of non-negative integers In general, recursively defined functions have an infinitely large domain set A function f can be recursively defined as follows: 1: Define the value of the function at a few points For example, f(0), f(1) are specified Such values are called the initial values : Define the value of the function at n + 1 in terms of f(0), f(1),, f(n), and n itself 3: Write a closing statement that in most cases reads Steps 1 and are the only two steps that define the function f Comment: The essence of recursive definition is its simplicity that helps us to understand the function being defined, but not its efficiency when we are asked to actually find the value of the function We prefer to compute a function by using its closed-form formula instead of by using its recursive definition directly Mathematical induction has nothing to do with finding a closed-form formula for a given function, 3 but it is a powerful technique for verifying that a given closed-form formula is a correct one for the recursively defined function Example 3 Let f be a function taking a non-negative integer as its argument, and be recursively defined as follows 1: f(0) = 0 1 Basic concepts associated with functions are considered in Chapter The definition 6 in Chapter is an example of recursive definitions for the syntax of well-formed formulas 3 Chapter 8 will discuss details about solving recurrence relations

10 108 3 Mathematical Induction : For all n 0, f(n + 1) = f(n) + (n + 1) We note that f(0) = 0, f(1) = f(0) + 1 = = 1, f() = f(1) + = = 3, f(3) = f() + 3 = = 6, and conjecture that f(n) is the summation of the first n natural numbers, ie, the closed-form of f is given as f(n) = n(n + 1), for all n 0 (31) We can use mathematical induction to prove that equality (1) is correct 4 Inductive Basis: The initial value of f serves as the basis of the induction In particular, we prove that f(0) = 0 (0+1) It s clear that the equality (1) holds when n = 0, and hence the basis holds Note: f(0) = 0 is given as a part of the definition of f, and we have verified it by using formula (1) Inductive Hypothesis: (1) holds, ie, Assume that given any fixed n 0, the equality f(n) = n(n + 1) Note: We removed the universal quantifier in the equality (1), because n is fixed after this step Inductive Step: In this step, we need to prove that f(n + 1) = (n + 1)(n + ) We first use the recursive definition of f to have f(n + 1) = f(n) + (n + 1) (3) 4 We do not explicitly define a predicate to be proved true in its domain for this example Implicitly, the predicate is: n(n + 1) P (n) : f(n) =, and D n = N 0 In general, if the predicate is clear from the problem context, we can omit it to improve the compactness of the proof Please compare the solutions to Problems 6 and 7 On the other hand, if the subject is not clear, a well-stated predicate and its domain can help us to move the first step (see Problem 3) We will explicitly define a predicate in most solutions in Section 0

11 3 Mathematical Induction and Recursive Definition 109 Then, we use the hypothesis to replace f(n) in () by n(n+1) We have f(n + 1) = f(n) + (n + 1) n(n + 1) = + (n + 1) n(n + 1) + (n + 1) = (n + 1)(n + ) = Therefore, we can claim that for all n 0, f(n) = n(n+1), and hence the given closed-form for f is correct 3 Recursive Definitions for Sets and Structural Induction We will introduce an important variant of mathematical induction called structural induction in this subsection Let us first study how to define a set by using recursive definitions The idea is: (1) give a few initial elements for the set, and () specify a few rules to construct new elements by using old elements that are already in the set A set S can be recursively defined as follows: 1: Identify a few elements of the set S : Explain how to obtain new elements of the set S from the old elements of the set 3: Write a closing statement that in most cases reads (1) and () are the only two ways to generate elements of the desired set S Example 33 Let set S be a set of strings of 1 s and 0 s and be recursively defined as follows: 1: 1 S, 100 S : If s S, then 11s S 3: If s S, then 00s S 4: Nothing but strings generated according to rules 1,, and 3 are elements in S The following table shows some elements in the set and the rules used to

12 110 3 Mathematical Induction generate each element in the table, respectively elements rules used s s , 3 s ,, 3, s , 3, 3,, 3 s , 3, 3,, 3, s , 3, 3,, 3, 3 In the example above, given any element s S, according to the rules we can construct two new elements from s, ie, 11s (using rule ) and 00s (using rule 3) For example, if we know that s 3 S, then we can apply rules and 3 to s 3 to obtain 11s 3 and 00s 3 which are s 4 and s, respectively, and they are also to be included in S On the other hand, 1111, for example, is not a member of S because we cannot have 1111 by using the given rules Now, the question is, what is the relation between a recursively defined set and mathematical induction? To answer this question, let s observe the elements s 0,, s of the set S obtained above We find that every element has an even number of 0 s and an odd number of 1 s Is this observation correct in general How can we prove it? The best technique for proving this kind of problem is mathematical induction In general, if a set is recursively defined and we observe that the recursive definition gives a common property shared by all elements in the set, then we can use mathematical induction to prove the observation The difficulty is that the order of elements in the set S is no longer obvious (although S is still a well-ordered set) To overcome this problem, we introduce a variant of mathematical induction called structural induction We do not visually line up the elements in the set Instead, we imagine that the elements in the set are lined up according to the numbers of times the rules used to generate them For example, if s is somewhere in the line, then the next elements are 00s and 11s, because 00s and 11s are obtained from s by applying one of the given rules one more time Therefore, if a given property P is claimed to be universal in the set S, then we should be able to prove the implication: s S [P (s) P (00s) P (11s)] The steps of proof by structural induction are stated below In general, let set S be recursively defined as follows: 1 s 0, s 1,, s k S If s S, then r 0 (s), r 1 (s),, r l () S 3 Only elements specified in 1 or generated by rules in are elements in S

13 33 Nested Induction 111 We wish to prove that all elements in S have the property P, ie, s S [P (s) = T ] Then the following procedure can be applied Step 1: Prove that P (s 0 ), P (s 1 ),, P (s k ) are all true This step is the basis step of structure induction Step : Let s be any arbitrary fixed element in the set S, and assume that P (s) is true This is the inductive hypothesis Step 3: Use the assumption to prove that P (r 0 (s)), P (r 1 (s)),, P (r l (s)) are all true This step is the inductive step If we can prove the basis in step 1 and the implication in step 3, then we can claim that that P (s) is true for all s S This method is called structural induction, because we are examining the structure of the elements in the set, where the structure is given by the rules Any non-initial element can be decomposed into a few small fragments, and its property is the result of its fragments properties Example 34 Consider the set S defined in the example on page 9 Prove by structural induction that every element in S has an even number of 0 s and an odd number of 1 s Inductive Basis: It is clear that both strings 1 and 100 have an even number of 0 s and an odd number of 1 s Thus the inductive basis holds Inductive Hypothesis: Assume s S and s has an even number of 0 s and an odd number of 1 s Inductive Step: It is clear that, if the assumption is true, then both 00s and 11s have an even number of 0 s and an odd number of 1 s Therefore, the observation is correct 33 Nested Induction Nested induction is a special form of mathematical induction, by which we can prove a mathematical statement that has more than one variables involved Nested induction is also known as double induction in case that the subject mathematical statement has two variables Consider the Ackerman function

14 11 3 Mathematical Induction A : N N N defined as follows For every m, n N, (i) A(0, m) = m + 1; (ii) A(n + 1, 0) = A(n, 1); (iii) A(n + 1, m + 1) = A(n, A(n + 1, m)) Theorem: For all m, n N, A(n, m) > m We will prove the theorem by nested induction directly before we give its underlying theory to justify our steps Let m and n range over N Basis: ma(0, m) > m It plainly appears from definition (i) Inductive Hypothesis: Fix n N, assume that m[a(n, m) > m] Inductive Steps: We want to prove that m[a(n + 1, m) > m] For m = 0, we have A(n + 1, 0) = A(n, 1) by definition (ii), and by the hypothesis, A(n, 1) > 1, Thus, A(n + 1, 0) > 1 > 0 For m > 0, we have A(n + 1, m) = A(n, A(n + 1, m 1)) by def (iii) > A(n + 1, m 1) by the hypothesis A(n + 1, m) A(n + 1, m 1) + 1 = A(n, A(n + 1, m )) + 1 by def (iii) > A(n + 1, m ) + 1 by the hypothesis A(n + 1, m) A(n + 1, m ) + A(n + 1, m) A(n + 1, m m) + m = A(n + 1, 0) + m = A(n, 1) + m > 1 + m by the hypothesis Therefore, m[a(n + 1, m) > m] 331 The underlying logic of nested induction We use the previous example, and define two-place and one-place predicates Q and P, respectively, over natural numbers as follows Q(n, m) = A(n, m) > m; P (n) = mq(n, m)

15 33 Nested Induction 113 Thus, we can rewrite the theorem according the following logic equivalences n m[a(n, m) > m] n mq(n, m) np (n) To prove np (n) by mathematical induction, we apply the inference rule we have been familiar with: P (0) n[p (n) P (n + 1)] np (n) Use the definition of P, the inference above can be rewritten as: mq(0, m) n[ mq(n, m) mq(n + 1, m)] n mq(n, m) Therefore, in the inductive proof we just shown, the inductive basis is mq(0, m) and the inductive hypothesis is mq(n, m)

16 114 3 Mathematical Induction 34 Problems Conventions for the rest of this chapter: Unless we state otherwise, n ranges over N 0, ie, n {0, 1,, 3, } All indexing variables in notation are integers TH stands for inductive hypothesis Problem 1: The assertion k = n+1, n 1 is incorrect Find the mistake of the invalid proof in the following: 1 Assume that for a fixed n k = n+1 Add n+1 to both sides of the above equality We have k + n+1 = n+1 + n+1 This proves the result k = n k = n+1+1 Problem : Consider the sequence a 0, a 1, a,, defined as: 1: a 0 =, and a 1 = 3 : For n, define a n = a n 1 a n We are given the following assertion: There is no element in the sequence equal to 1 We present the following proof What is wrong with the proof? If we can prove that a 0 1 and the sequence is increasing, ie, for all n, a n+1 > a n, then we can claim that no element in the sequence can be equal to 1

17 34 Problems 11 Inductive Basis: It s clear that a 0 1 [The Basis Holds] Inductive Hypothesis: Assume a n+1 > a n Inductive Step: From the definition of the sequence and the hypothesis, we have Thus, a n+ > a n+1 a n+ = a n+1 a n > a n+1 a n+1 = a n+1 Problem 3: Let n N, and consider 1 1! +! + 3 3! + + n n! (33) 1 Use the notation to express the above expression Find the formula for it Problem 4: Problem : Prove the formula obtained for (3) by mathematical induction Let n N, and consider (3n ) (3n + 1) (34) 1 Use the notation to express the expression above Find the formula for it Problem 6: Problem 7: Problem 8: Problem 9: Problem 10: Prove the formula obtained for (4) by mathematical induction Prove that k(k + 1) = n(n + 1)(n + )/3 Prove by mathematical induction that 0 k n 3 k = (3n+1 1) Prove by mathematical induction that k = Prove by mathematical induction that n(n + 1)(n + 1) (3) 6 k(k 1) = 1 (n + 1)n(n 1) (36) 3

18 116 3 Mathematical Induction Prove the closed form obtained for (8) by mathematical in- Problem 11: Problem 1: Problem 13: duction Prove by mathematical induction that k(k 1)(k ) = 1 (n + 1)n(n 1)(n ) (37) 4 Use the equalities (), (6), and (7) to derive a formula for k 3 (38) Problem 14: Prove by mathematical induction that for all positive odd n, 0 k n ( ) k = 1 3 (1 n+1 ) Problem 1: Prove by mathematical induction that for all n 1, 1 k(k + 1) = 1 1 n + 1 Problem 16: Prove by mathematical induction that for all n 1, k + 1 k (k + 1) = 1 1 (n + 1) Problem 17: Prove the following by mathematical induction : 1 i n A i = 1 i n where n is any integer and n, and A 1,, A n are any sets This is a generalized De Morgan s law Problem 18: Let a and b be two integers Prove by mathematical induction that for all integers n 1, a n b n is a multiple of a b Note that you are asked to prove this by mathematical induction, so you cannot simply use the following fact: a n b n = (a b)(a n 1 + a n b + a n 3 b + + ab n + b n 1 ) Problem 19: Let x be any real number and x > 1 Prove that for all n > 1 A i, (1 + x) n > 1 + nx

19 34 Problems 117 Problem 0: that Let x be any real number such that x > 0 and x 1 Prove is an increasing sequence x, x x, x (xx), x (x(xx)), Problem 1: Prove by mathematical induction that if n is any positive odd integer, then n is divisible by 4 Problem : Prove that the sum of the cubes of any three consecutive integers is divisible by 9 Problem 3: Prove by mathematical induction that for all n Z { ( 1) n 1 if n is even, = 1 if n is odd Z is the set of all integers Problem 4: and for all n 1, Let c(n) be a sequence of integers such that Prove that for all n 0, Problem : c(0) = 1, c(1) = 1, c() = 3, c(n + ) = 3c(n + 1) 3c(n) + c(n 1) Define b(n) as follows: c(n) = n n + 1 b(n + ) + b(n + 1) + b(n) = 0, n 0, and b(0) = 1 and b(1) = 1 Prove that b(n) = (1 n)( 1) n, n 0 Problem 6: Using the same definition of b(n) given in problem, prove that if b(0) = 1 and b(1) = 3, then Problem 7: b(n) = (1 + n)( 1) n, n 0 Let us consider a famous sequence called Fibonacci numbers: f 0 = 0, f 1 = 1, f n = f n 1 + f n, for n Prove by mathematical induction that, for all n 0, (( ) n ( ) n ) f n =

20 118 3 Mathematical Induction Problem 8: Let S be a set with n elements Prove by mathematical induction that the total number of subsets of S having exactly two elements is n(n 1)/ Problem 9: Let p(n) be the maximum number of intersection points of n distinct lines in the plane Prove by mathematical induction that for all integers n, p(n) = n(n 1)/ Problem 30: Let x 1 = 1 and x n+1 = x n + 1 x Prove by mathematical n induction that for all n 1, 1 x n n Problem 31: Define the harmonic numbers as H n = 1 i, n 1 1 i n Prove by mathematical induction that ( H n 1 + n ), n 0 Problem 3: Let λ denote the empty string Let A be any finite nonempty set A palindrome over A can be defined as a string that reads the same forward as backward For example, mom and dad are palindromes over the set of English alphabets We define a set S as follows: 1 λ S a A, a S 3 a A x S, axa S 4 All the elements in S must be generated by the rules above Prove by structural induction that S equals the set of all palindromes over A Problem 33: Let set S be a set of strings of a s and b s recursively defined as follows: 1 a S, b S If µ S and ν S, then µν S 3 Nothing but strings generated according to rules 1 and are elements in S We also recursively define the reverse operation R on S as: 1 R(a) = a, and R(b) = b If µ S, then R(aµ) = R(µ)a, and R(bµ) = R(µ)b

21 34 Problems 119 Prove by structural induction that for all µ, ν S, R(µν) = R(ν)R(µ) Problem 34: Let S and R be as defined in the previous problem Prove that, for all µ S, R(R(µ)) = µ Problem 3: Let Σ = {a, b} and Λ be the null string Define A Σ by the following rules 1 Λ A If ω A, then aωb A 3 If µ, ν A, then µν A 4 Every ω A must come from a finite number of applications of rules 1,, or 3 Prove by mathematical induction that, for every ω A, ω has equally many a s and b s Problem 36: Let A be defined as the previous problem Prove by mathematical induction that, if ω A, then the number of a s is equal to or greater than the number of b s in every prefix of ω Note: A prefix of ω is Λ or any initial segment of ω For example, if ω = aabbad, then Λ, a, aa, aab, aabb, aabba, and aabbab are all possible prefixes of ω

22 10 3 Mathematical Induction 3 Solutions Solution 1: The basis of the induction is not proved It is incorrect, because for n = 1, k = 1 =, which is not equal to 1+1 = 4 1 k 1 Solution : The proof is incorrect The proof shows that a 0 1 and claims that it is the basis of the induction According to the hypothesis given in the proof, the correct basis is a 0 1 and a 1 > a 0 To see the mistake more clearly, let s change the initial values of the sequence to a 0 = 3, and a 1 = We thus have a = 1 The inductive basis only proves that a 0 1, but does not mention the problem that a 0 > a 1 Solution 3: 1 1 1! +! + 3 3! + + n n! = k k! In order to obtain a closed form for the sum above, we note that k = (k + 1) 1 for any k Thus, 1 1! +! + 3 3! + + n n! = ( 1! 1!) + (3!!) + (4 3! 3!) + + ((n + 1) n! n!) = (! 1!) + (3!!) + (4! 3!) + + ((n + 1)! n!) = (n + 1)! 1 Therefore, k k! = (n + 1)! 1 (39)

23 3 Solutions 11 Solution 4: values of n 1 Recall that our goal is to prove that equation (9) holds for all by mathematical induction: Inductive Basis: n = 1 1 k 1 k k! = 1 1! = 1, (1 + 1)! 1 = 1 That means both sides of (9) are equal to 1 [The Basis Holds] Inductive Hypothesis: Suppose k k! = (n + 1)! 1 Inductive Step: k k! = k k! + (n + 1) (n + 1)! +1 = (n + 1)! 1 + (n + 1) (n + 1)! [by IH] = (n + ) (n + 1)! 1 = (n + )! 1 Therefore, for all n N, (9) is correct Solution : (3n ) (3n + 1) = 1 (3k ) (3k + 1) In this problem we make use of the equality, for any k, 1 k n, ( k 1 ) = 1 3k + 1 3k + 3k (3k )(3k + 1) 1 = (3k )(3k + 1)

24 1 3 Mathematical Induction (3n ) (3n + 1) = 1 3 ( ) ( ) ( ) ( 1 3n 1 3n + 1 ) = 1 ( n 1 ) 3n + 1 = 1 ( 1 1 ) 3 3n + 1 Therefore, the closed form expression of the sum is 1 (3k ) (3k + 1) = 1 ( 1 1 ) (310) 3 3n + 1 Solution 6: Our goal is to prove (10) by mathematical induction Inductive Basis: n = 1 1 LHS = = 1 4, RHS = 1 ( ) 1 1 = [The Basis Holds] Inductive Hypothesis: Suppose 1 (3k ) (3k + 1) = 1 ( 1 1 ) 3 3n + 1

25 3 Solutions 13 Inductive Step: 1 (3k ) (3k + 1) +1 = 1 (3k ) (3k + 1) = 1 ( 1 1 ) n + 1 = 1 ( n = 1 ( ) 3n (3n + 1) (3n + 4) = 1 ( ) 3n (3n + 1) (3n + 4) = 1 ( 1 1 ) 3 3n (3n + 1) (3n + 4) ) (3n + 1) (3n + 4) 1 (3n + 1) (3n + 4) [by IH] Therefore, for all n N, (10) is correct Solution 7: Let D n = N, and P (n) 6 : Inductive Basis: n = 1 Therefore, P (1) = T k(k + 1) = 1 n(n + 1)(n + ) 3 1 = 1 (1 3) 3 Inductive Hypothesis: Assume P (n) = T, ie k(k + 1) = 1 n(n + 1)(n + ) 3 [The Basis Holds] Beginning from this problem and onwards, we will explicitly define the predicate and its domain 6 Note: P (n) is a predicate; for any fixed value of n, its value is either T rue or F alse It does not represent the sum or its value on the other side of the equality, ie, P (n) X k(k + 1) and P (n) 1 n(n + 1)(n + ) 3

26 14 3 Mathematical Induction Inductive Step: We want to prove that P (n + 1) = T rue In other words, we want to prove that the following equality is correct: k(k + 1) = 1 (n + 1)(n + )(n + 3) k(k + 1) = k(k + 1) + (n + 1)((n + 1) + 1) n(n + 1)(n + ) = + (n + 1)(n + ) [by IH] 3 n(n + 1)(n + ) = + (n + 1)(n + ) 3 n(n + 1)(n + ) + 3(n + 1)(n + ) = 3 (n + 1)(n + )(n + 3) = 3 (n + 1)((n + 1) + 1)((n + 1) + ) = 3 = 1 (n + 1)(n + )(n + 3) 3 P (n + 1) = T Therefore, n D n, P (n) is true Solution 8: Let D n = N, and P (n) : 0 k n 3 k = (3n+1 1) Inductive Basis: Therefore, P (1) = T Inductive Hypothesis: n = 1 0 k 1 ( ) 3 k = = 4, = 9 1 = 4 Assume P (n) = T, ie, 0 k n 3 k = (3n+1 1) [The Basis Holds]

27 3 Solutions 1 Inductive Step: to prove that We want to prove that P (n + 1) is true, ie, we want 0 k n+1 3 k = (3n+ 1) 0 k n+1 3 k = 0 k n = 3n k + 3 n+1 = 3n n+1 = 3 3n+1 1 = 3n = 3n n+1 [by IH] P (n + 1) = T Therefore, P (n) is true for all n in D n Solution 9: Let D n = N, and P (n) : k = 1 n(n + 1)(n + 1) 6 Inductive Basis: n = 1 1 = Therefore, P (1) is true Inductive Hypothesis: [The Basis Holds] Let i D n, and assume P (i) = T, ie, 1 k i k = 1 i(i + 1)(i + 1) 6

28 16 3 Mathematical Induction Inductive Step: Consider P (i + 1), 1 k i+1 k = ( i ) + (i + 1) = 1 k i k + (i + 1) = 1 6 i(i + 1)(i + 1) + (i + 1) [by IH] = 1 (i + 1)(i(i + 1) + 6(i + 1)) 6 = 1 6 (i + 1)(i + 7i + 6) = 1 (i + 1)(i + )(i + 3)) 6 = 1 (i + 1)((i + 1) + 1)((i + 1) + 1)) 6 P (i + 1) = T Therefore, n D n, P (n) is T rue Solution 10: Let D n = N, and P (n) : k(k 1) = 1 (n + 1)n(n 1) 3 Inductive Basis: n = 1 1 (1 1) = 1 (1 + 1) 1 (1 1) 3 Therefore, P (1) = T rue [The Basis Holds] Inductive Hypothesis: Let i D n, and assume P (i) = T, ie, 1 k i k(k 1) = 1 (i + 1)i(i 1) 3

29 3 Solutions 17 Inductive Step: Consider P (i + 1), k(k 1) = k(k 1) + (i + 1)((i + 1) 1) 1 k i+1 1 k i = 1 (i + 1)i(i 1) + i(i + 1) [by IH] 3 = 1 (i + 1)i(i 1 + 3) 3 = 1 (i + 1)i(i + ) 3 P (i + 1) = T Therefore, n D n, P (n) is T rue Solution 11: Let D n = N, and P (n) : k(k 1)(k ) = 1 (n + 1)n(n 1)(n ) 4 Inductive Basis: For n = 1, the LHS of P (n) is 1(1 1)(1 ) = 0, and the RHS is 1 4 (1 + 1)1(1 1)(1 ) = 0 Since both sides are equal, P (1) = (0 = 0) = T [The Basis Holds] Inductive Hypothesis: Let i D n, and assume P (i) = T, ie, k(k 1)(k ) = 1 (i + 1)i(i 1)(i ) 4 1 k i Inductive Step: 1 k i+1 1 k i+1 k(k 1)(k ) = To prove that P (i + 1) is true, we need to show that k(k 1)(k ) = 1 (i + )(i + 1)i(i 1) 4 1 k i k(k 1)(k ) + (i + 1)i(i 1) = 1 (i + 1)i(i 1)(i ) + (i + 1)i(i 1) [by IH] 4 = 1 (i + 1)i(i 1) ((i ) + 4) 4 = 1 (i + 1)i(i 1)(i + ) 4

30 18 3 Mathematical Induction P (i + 1) = T Therefore, n D n, P (n) is T rue Solution 1: Let s observe the following properties first Let f(k) and g(k) be two functions of k, and a be any constant We have the following equalities (f(k) + g(k)) = f(k) + g(k) One can verify that, Therefore, k 3 = af(k) = a f(k) k 3 = k(k 1)(k ) + 3k k = k(k 1)(k ) + k(k 1) + k k(k 1)(k ) + k(k 1) + Then, we use the results from the previous problems to get, k 3 = 1 4 (n + 1)n(n 1)(n ) + 3 (n + 1)n(n 1) + 1 n(n + 1)(n + 1) 6 = 1 n(n + 1)[3(n 1)(n ) + 8(n 1) + (n + 1)] 1 = 1 1 n(n + 1)(3n 9n n 8 + 4n + ) = 1 1 n(n + 1)(3n + 3n ) k = 1 4 n (n + 1) Solution 13: Let D n = N, and P (n) : k 3 = 1 4 n (n + 1)

31 3 Solutions 19 Inductive Basis: n = 1 It is easy to verify that, for n = 1, both sides of the equality are 1i, ie, 1 3 = (1 + 1) Therefore, P (1) = T rue [The Basis Holds] Inductive Hypothesis: Let i D n, and assume P (i) = T, ie, k 3 = 1 4 i (i + 1) 1 k i Inductive Step: Consider P (i + 1), k 3 = k 3 + (i + 1) 3 1 k i+1 1 k i = 1 4 i (i + 1) + (i + 1) 3 [by IH] = 1 4 (i + 1) (i + 4(i + 1)) = 1 4 (i + 1) (i + 4i + 4) = 1 4 (i + 1) (i + ) Thus, P (i + 1) = T Therefore, n D n, P (n) = T Solution 14: Let D n = {1, 3,, 7, 9, }, and define, P (n) : ( ) k = 1 3 (1 n+1 ) 0 k n Inductive Basis: n = 1 We choose 1 as the basis because 1 is the first element of D n in our enumeration, and note that the LHS of the equality is ( ) k = ( ) 0 + ( ) 1 = 1, 0 k 1 and the RHS of the equality is Therefore, P (1) = T 1 3 (1 ) = 1 [The Basis Holds]

32 130 3 Mathematical Induction Inductive Hypothesis: Let i D n, and assume P (i) = T, ie, ( ) k = 1 3 (1 i+1 ) 0 k i Inductive Step: Let n = i + We choose i + because i + is the positive odd integer next to i ( ) k = ( ) k + ( ) k 0 k i+ 0 k i i+1 k i+ = 1 3 (1 i+1 ) + ( ) i+1 + ( ) i+ [by IH] = 1 3 [1 i+1 + 3( ) i+1 + 3( ) i+ ] = 1 3 [1 i+1 + 3( ) i+1 + 3( )( ) i+1 ] = 1 3 [1 i+1 + 3( ) i+1 6( ) i+1 ] = 1 3 [1 ( ) i+1 ] = 1 3 (1 ( ) ( ) i+1 ) since i + 1 is even = 1 3 (1 ( )i+3 ) = 1 3 (1 i+3 ) since i + 3 is even P (i + ) = T Therefore, n D n, P (n) is true Solution 1: Define P (n) for all n 1 as, 1 P (n) : k(k + 1) = 1 1 n + 1 Inductive Basis: For n = 1, it is easy to verify that both sides of the equality are equal to 1 LHS = Therefore, P (1) is true 1 k 1 RHS = = 1/ 1 k(k + 1) = 1 1 = 1/ [The Basis Holds]

33 3 Solutions 131 Inductive Hypothesis: Inductive Step: +1 Assume P (n) is true, ie, 1 k(k + 1) = 1 1 n + 1 To prove P (n + 1) is true 1 k(k + 1) = 1 k(k + 1) + 1 (n + 1)(n + ) = 1 1 n (n + 1)(n + ) (n + ) 1 = 1 (n + 1)(n + ) n + 1 = 1 (n + 1)(n + ) = 1 1 n + [by IH] Therefore, P (n + 1) is true Solution 16: Define P (n) for all n 1 as, P (n) : k + 1 k (k + 1) = 1 1 (n + 1) Inductive Basis: n = 1 1 k 1 1 k + 1 k (k + 1) = = 3/4 1 (1 + 1) = 3/4 Therefore, P (1) is true [The Basis Holds] Inductive Hypothesis: Assume P (n) is true, ie k + 1 k (k + 1) = 1 1 (n + 1)

34 13 3 Mathematical Induction Inductive Step: +1 k + 1 k (k + 1) = To prove P (n + 1) is true = 1 k + 1 (n + 1) + 1 k + (k + 1) (n + 1) (n + ) 1 (n + 1) (n + 1) (n + 1) (n + ) [by IH] = 1 (n + ) (n + 1) 1 (n + 1) (n + ) = 1 n + 4n + 4 n 1 (n + 1) (n + ) = 1 n + n + 1 (n + 1) (n + ) (n + 1) = 1 (n + 1) (n + ) 1 = 1 (n + ) Therefore, P (n + 1) is true Solution 17: Let A i denote a set for any i N, and P (n) be the predicate, for n {, 3, 4, }, P (n) : A i = A i 1 i n 1 i n Inductive Basis: For n =, we need to prove that A 1 A = A 1 A It is the classical De Morgan s law in logic, and is known to be true Hence, the basis follows Inductive Hypothesis: Assume n = k and P (k) = T, ie, A i = A i 1 i k 1 i k Inductive Step: Let n = k + 1 A i = ( A i ) A k+1 1 i k+1 1 i k

35 3 Solutions 133 If we take ( A i ) as A, and A k+1 as B, we have 1 i k ( A i ) A k+1 = ( A i ) A k+1 1 i k 1 i k Using the inductive hypothesis, we have ( A i ) A k+1 = ( A i ) A k+1 1 i k = 1 i k 1 i k+1 A i That proves P (k + 1) = T Therefore, n, P (n) is T Note: If we want to claim that [ n 1, P (n)] is also true, we have to prove the special case, n = 1, and the inductive basis, n =, separately It is trivial to prove P (1) is true, but P (1) = T is not the basis of the induction We have to prove P () = T as the inductive basis, because P (1) does not imply P () Solution 18: Let D n = N, and P (n) : (a b) (a n b n ), where (a b) (a n b n ) means a n b n is divisible by a b In other words, we have to prove that for any fixed n, there exists an integer k such that a n b n = a(a b) Note that k may be a function of a, b, and n Inductive Basis: For n = 1, a n b n = a b and it is obvious that (a b) divides (a b), ie, (a b) (a 1 b 1 ) is true Therefore, P (1) = T rue Inductive Hypothesis: [The Basis Holds] Let i D n, i > 1, and assume P (i) = T, ie, (a b) (a i b i ),

36 134 3 Mathematical Induction Inductive Step: We want to know if a i+i b i+1 is divisible by a b a i+1 b i+1 = aa i ba i + ba i bb i = a i (a b) + b(a i b i ) From the inductive hypothesis, we know that there exists an integer k such that, (a i b i ) = k(a b) Therefore, a i+1 b i+1 = a i (a b) + bk(a b) = (a b)(a i + bk) It is clear that a i + bk is an integer because a, b, i, and k are all integers Thus, (a b) (a i+1 b i+1 ) P (i + 1) is true Therefore, for all n 1, a n b n is divisible by a b Solution 19: Suppose x > 0, D n = {, 3, 4, }, and P (n) : (1 + x) n > 1 + nx Inductive Basis: n = (1 + x) = 1 + x + x > 1 + x, because n > 0 [The Basis Holds] Inductive Hypothesis: Let i D n, and assume P (i) = T, ie, (1 + x) i > 1 + ix Inductive Step: We want to prove that P (i + 1) is true (1 + x) i+1 = (1 + x) i (1 + x) > (1 + ix)(1 + x) [by IH] and x > 0 = 1 + (i + 1)x + ix > 1 + (i + 1)x by n > 0, i > 0

37 3 Solutions 13 Note: The given condition x > 0 and the inductive hypothesis are both needed to claim that (1 + x) i (1 + x) > (1 + ix)(1 + x) One can easily find a counter example if x < 0 Solution 0: We express the sequence x, x x, x (xx), x (x(xx)), as Thus, a 1, a, a 3,, a 1 = x, a = x x = x a 1, a 3 = x (xx) = x a, In general, a n = x a n 1 for n Let D n = N, and P (n) : a n < a n+1 We want to prove that, if x > 1, then for all n, P (n) is true Inductive Basis: n = 1 We discuss the two cases: x > 1 and 0 < x < 1 1 Suppose that 0 < x < 1 In this case, we know that log x < 0 Since 0 < x < 1, we have log x < x log x It follows that x < x x If x > 1, then it is clear that x < x x if x > 1 Thus, in both cases, we have a 1 < a, P (1) = T rue [The Basis Holds] Inductive Hypothesis: Assume P (i) is true for some i in D n, ie a i < a i+1

38 136 3 Mathematical Induction Inductive Step: We want to prove P (i + 1) is also true Using the hypothesis, we have a i < a i+1 x ai < x ai+1 because x > 1 P (i + 1) = T Therefore, it is an increasing sequence Solution 1: Let D n be the set of all positive odd integers, ie, D n = {1, 3, }, and define P (n) : n is divisible by 4 Inductive Basis: n = 1 We choose 1 as the base because 1 is the first element in D n Apparently, = 4, which is divisible by 4 Therefore, P (1) = T [The Basis Holds] Inductive Hypothesis: Assume P (n) = T, ie, n is divisible by 4 Note: n is a positive odd integer Inductive Step: We want to prove P (n+) = T, ie, we want to prove that n+ is divisible by 4 Note: We choose n + instead of n + 1 because n + is the odd number next to n fixed in the inductive hypothesis, whereas n + 1 is not an element in D n From the inductive hypothesis, we can assume that n = 4k, where k is an integer We have n+ = n = (1 + 3 n ) n = 4k n = 4(k + 3 n ) Because k and n are integers, k + 3 n must be an integer Therefore, n+ is divisible by 4, and hence P (n + ) = T Therefore, P (n) is true for all n in D n

39 3 Solutions 137 Solution : The domain of this problem includes both positive and negative integers The easiest way is to split the domain into two parts: positive integers and negative integers Then, we prove the statement by mathematical induction in the two sub-domain separately (1) Let D n = {0, 1,, 3, } Define: P (n) : 9 ( n 3 + (n + 1) 3 + (n + ) 3) Inductive Basis: n = = 9 P (0) is true Inductive Hypothesis: [The Basis Holds] Assume i D n, and P (i) is true, ie, i 3 + (i + 1) 3 + (i + ) 3 = 9k, for some integer k Inductive Step: Prove P (i + 1) is true (i + 1) 3 + (i + ) 3 + (i + 3) 3 = (i + 1) 3 + (i + ) 3 + i 3 + 9i + 7i + 7 = (i 3 + (i + 1) 3 + (i + ) 3 ) + 9i + 7i + 7 = 9k + 9(i + 3i + 3) [by IH] = 9(k + i + 3i + 3) Because k + i + 3i + 3 is an integer, therefore 9 ( (i + 1) 3 + (i + ) 3 + (i + 3) 3), P (i + 1) is true () Let D n = {0, 1,, 3, } Define: P (n) : 9 ( n 3 + (n 1) 3 + (n ) 3) Inductive Basis: n = = 9 P (0) is true [The Basis Holds]

40 138 3 Mathematical Induction Inductive Hypothesis: Assume i D n, and P (i) is true, ie, i 3 + (i 1) 3 + (i ) 3 = 9k, for some integer k Inductive Step: Prove P (i 1) is true (i 1) 3 + (i ) 3 + (i 3) 3 = (i 1) 3 + (i ) 3 + i 3 9i + 7i 7 = (i 3 + (i 1) 3 + (i ) 3 ) 9i + 7i 7 = 9k + 9( i + 3i 3) [by IH] = 9(k i + 3i 3) Because k i + 3i 3 is an integer, therefore 9 ( (i 1) 3 + (i ) 3 + (i 3) 3), P (i 1) is true Putting the two domains together, we have that the sum of the cubes of any three consecutive integers is divisible by 9 Solution 3: We first prove that the statement is correct in the non-negative part of the domain Let D n = {0} N, and define { P (n) : ( 1) n 1 if n is even, = 1 if n is odd We will prove that P (n) = T for all n D n Inductive Basis: n = 0 0 is even and ( 1) 0 = 1 Thus P (0) = T [The Basis Holds] Inductive Hypothesis: n = i Suppose P (i) = T, ie, { ( 1) i 1 if i is even, = 1 if i is odd

41 3 Solutions 139 Inductive Step: n = i + 1 ( 1) i+1 = 1 ( 1) i { 1 1 if i is even, = 1 1 if i is odd { 1 if i is even, = 1 if i is odd { 1 if i + 1 is odd, = 1 if i + 1 is even Therefore, P (i + 1) is true We have proved that the predicate is true for all non-negative integers We can use the same technique shown in the previous problem, ie, we can further prove that the statement is correct for the other part of the domain (negative integers) Or, we can use the result we just got and the following arguments From the proved result above, if n is a non-negative integer, we know that n is even and ( 1) n = 1 Observe the following fact: if n N, then ( 1) n = 1 ( 1) n = ( 1)n ( 1) n = ( 1)n Therefore, we can claim that for all i Z, the predicate P (i) is always true That proves the theorem The following is another proof for the above problem It is a bit awkward, but it shows how to reorder the domain so we can examine the entire domain without missing any element of it Let s consider the following ordered sequence, Z : 0, 1, 1,,, 3, 3, 4, 4, It is clear that any number in Z must be in the sequence Z somewhere Let z i denote the i th number in Z, where i 1 Let D n = N Define { 1 if zn is even, P (n) : ( 1) zn = 1 if z n is odd Thus, our original problem can be viewed as: Prove that for all n D n, P (n) is true Inductive Basis: n = 1 z 1 = 0, therefore z 1 is even and ( 1) 0 = 1 Thus P (1) = T [The Basis Holds]

42 140 3 Mathematical Induction Inductive Hypothesis: n = i Suppose P (i) = T, ie { ( 1) z i 1 if zi is even, = 1 if z i is odd Inductive Step: n = i + 1 There are only two possible values for z i+1 in terms of z i, ie, z i+1 = z i if z i is positive or z i+1 = z i + 1 if z i is negative We will discuss this by cases case 1: z i+1 = z i ( 1) z i+1 = ( 1) z i = 1 ( 1) z i = { 1/1 = 1 if zi is even, 1/ 1 = 1 if z i is odd From Z we know that in this case if z i is even, then z i+1 is even, and if z i is odd, then z i+1 is odd Therefore, { 1 if zi+1 is even, ( 1) zi+1 = 1 if z i+1 is odd case : z i+1 = z i + 1 ( 1) z i+1 = ( 1) z i+1 = 1 ( 1) z i = { 1/1 = 1 if zi is even, 1/ 1 = 1 if z i is odd From Z we know that in this case if z i is even, then z i+1 is odd, and if z i is odd, then z i+1 is even Therefore, { 1 if zi+1 is even, ( 1) zi+1 = 1 if z i+1 is odd In both cases, P (i + 1) is true This proves the problem Solution 4: Let us rewrite the recurrent relation first: n 1, c(n + ) = 3c(n + 1) 3c(n) + c(n 1) n 3, c(n) = 3c(n 1) 3c(n ) + c(n 3) Given c(0) = c(1) = 1, and c() = 3 To prove that for all n 0, c(n) = n n + 1, let D n = N 0, and define P (n) : c(n) = n n + 1

43 3 Solutions 141 Inductive Basis: n = 0, 1, c(0) = = 1 c(1) = = 1 c() = = 3 Therefore, P (0) = P (1) = P () = T [The Basis Holds] Inductive Hypothesis: Assume that, for a fixed n D n, if 0 i n, then P (i) = T, ie, c(i) = i i + 1 This is a strong hypothesis Inductive Step: To prove that P (n + 1) = T To calculate the value of c(n+1), we can use the values of c(n), c(n 1), and c(n ) given in the strong inductive hypothesis, because the arguments, n, n 1, and n, are in the domain of the inductive hypothesis We have: Therefore, c(n + 1) c(n) = n n + 1, = 3c(n) 3c(n 1) + c(n ) c(n 1) = (n 1) (n 1) + 1, c(n ) = (n ) (n ) + 1 = 3(n n + 1) 3((n 1) (n 1) + 1) + (n ) (n ) + 1 = 3n 3n + 3 3n + 9n 9 + n n + 7 = n + n + 1 = (n + n + 1) (n + 1) + 1 = (n + 1) (n + 1) + 1 We have the result above by using the definition of c(n + 1) and the hypothesis, and the result agrees with the given closed-form formula for c(n + 1) This completes the proof Solution : Please be careful to adjust the domain of n as shown in the

44 14 3 Mathematical Induction following n 0[b(n + ) + b(n + 1) + b(n) = 0] n 0[b(n + ) = b(n + 1) b(n)] n [b(n) = b(n 1) b(n )] That s why this problem has to state that b(n) is defined by the equation after first two values Please compare this problem to the previous one 7 Define b(0) = b(1) = 1 Let D n = N 0 and P (n) : b(n) = (1 n)( 1) n Inductive Basis: n = 0, and n = 1 We have to take P (0) and P (1) as our basis, because both b( 1) and b( ) are undefined, and hence b(0) and b(1) cannot be obtained by using the equation b(n) = b(n 1) b(n ) in the inductive step [Same reason for the next problem] P (0) = P (1) = T b(0) = 1 = (1 0)( 1) 0 b(1) = 1 = (1 )( 1) 1 Inductive Hypothesis: Let i D n, and 1 i Suppose, if n i, then P (n) = T, ie, n D n, (n i) (b(n) = (1 n)( 1) n ) Inductive Step: Let n = i + 1 b(n) = b(i + 1) = b((i + 1) 1) b((i + 1) ) = b(i) b(i 1) = (1 i)( 1) i (1 (i 1))( 1) i 1 = (1 i)( 1) i (3 i)( 1) i 1 = ( 1) i 1 ( (1 i)( 1) (3 i)) = ( 1) i 1 ( 1 i) = ( 1) ( 1) i 1 (1 i) = (1 (i + 1))( 1) i+1 = (1 n)( 1) n 7 One may ask why we don t define b(n) as n 0[b(n) = b(n + ) b(n + 1)] [The Basis Holds] by using the given equation directly without adjusting the domain of n Can we define a function based on its future values instead of its previous values? Theoretically, the answer is yes, but that s beyond the scope of our interest of using mathematical induction

45 3 Solutions 143 P (i + 1) = T Therefore, n D n, P (n) is true Solution 6: Define b(0) = 1, b(1) = 3 Let D n = N 0, and P (n) : b(n) = (1 + n)( 1) n Inductive Basis: n = 0, and n = 1 b(0) = 1 = (1 + 0)( 1) 0 b(1) = 3 = (1 + )( 1) 1 P (0) = P (1) = T [The Basis Holds] Inductive Hypothesis: Let i D n, and 1 i Suppose, if n i, then P (n) = T, ie n D n, (n i) (b(n) = (1 + n)( 1) n ) Inductive Step: Let n = i + 1 b(n) = b(i + 1) = b((i + 1) 1) b((i + 1) ) = b(i) b(i 1) = (1 + i)( 1) i (1 + (i 1))( 1) i 1 = (1 + i)( 1) i (i 1)( 1) i 1 = ( 1) i 1 ( (1 + i)( 1) (i 1)) = ( 1) i 1 (3 + i) = ( 1) ( 1) i 1 (1 + + i) = (1 + (i + 1))( 1) i+1 = (1 + n)( 1) n P (i + 1) = T Therefore, n D n, P (n) is true Solution 7: Given f 0 = 0, f 1 = 1, f n = f n 1 + f n, for n

46 144 3 Mathematical Induction We want to prove that, for all n 0, (( f n = ) n ( 1 ) n ) Inductive Basis: n = 0 : ( ( 1 1+ ) 0 ( 1 ) ) 0 = 1 (1 1) = 0 = f 0 n = 1 : ( ( 1 1+ ) 1 ( 1 ) ) 1 ( = 1 1+ ( = ) ) = 1 = f 1 Inductive Hypothesis: Assume that, for 1 k n, ( f k = ) k ( 1 ) k [The Basis Holds] Inductive Step: In the following simplification we combine the two positive terms and the two negative terms, and use ( f n+1 = f n + f n 1 = 1 (( ) = 3+, and ) n ( [ ( = 1 1+ ) n ( + [ ( = 1 1+ ) n 1 ( [ ( = 1 1+ ) n 1 ( ( 1 ) = 3 1 ) n ) ( ( ) n 1 ( 3+ ) ( 1+ ) ( [ ( = 1 1+ ) n+1 ( 1 ) ] n+1 ) n 1 ( 1 ) n ( 1 ) n 1 ( 1 ) n 1 ( 1 ) ) n 1 1 ) ] n 1 3 ) ] 1 ) ]

47 3 Solutions 14 Solution 8: Prove by induction that the total number of subsets having exactly two elements in a set of n elements is n(n 1)/ It is clear that if A is a set of elements, the only subset of A with two elements is A itself And since 1 = ( 1)/, the basis holds Suppose we have a set A with elements, and let n And suppose we already know by the inductive hypothesis that there are n(n 1)/ many subsets of A with elements Now, we add a new element a into A, and examine the power set of the new A What are those subsets with elements? They are the old subsets with elements plus every singleton subset of the old A union with {a} Apparently, the old A has n-many singleton subsets Therefore, the new A has (n(n 1)/ + n)-many subsets with elements, where the new size of A is n + 1 And n(n 1) + n = (n + 1)n This proves the inductive step and completes the proof of this problem One may also want to define a recurrent relation according to the discussion above, and prove the result by induction more formally The following is a proof Let t(n) be the number of subsets with elements of a set with n elements Apparently, t(0) = 0 If n 1, we can recursively define t(n) as follows For n 1, t(n) = t(n 1) + (n 1) Now, let s prove the claim that for all n 0, t(n) = n(n 1)/ Define D n = N 0, and P (n) : t(n) = 1 n(n 1) Inductive Basis: n = 0 t(0) = 0 = 1 0 (0 1) Therefore, P (0) = T [The Basis Holds] Inductive Hypothesis: Let i D n Suppose, if n i, then P (n) = T, ie t(n) = 1 n(n 1)

48 146 3 Mathematical Induction Inductive Step: Let n = i + 1 t(n) = t(i + 1) = t(i) + i = 1 i(i 1) + i = 1 i(i 1 + ) = 1 (i + 1)((i + 1) 1) = 1 n(n 1) P (i + 1) = T Therefore, for any set with n elements, the set has n(n 1)/-many subsets having exactly elements Solution 9: Prove by induction that for all integers n the set of all points of intersection of n distinct lines in the plane has no more than n(n 1)/ elements Give examples showing exactly that many, and also fewer Suppose we already have n lines on the plane with the maximum number of intersection points If we draw a new line on the plane, we cannot introduce more than n new intersection points Therefore, if p(n) is the maximum number of the intersection points of n distinct lines, the recurrent relation will be p(n) = p(n 1) + (n 1) This is exactly the same as the recurrence relation in the previous problem We skip the proof here Solution 30: Define P (n) for all n 1 as P (n) : 1 x n n Inductive Basis: n = 1 x 1 = 1, and 1 x 1 1 Therefore, P (1) is true Inductive Hypothesis: Assume P (n) is true, ie, [The Basis Holds] 1 x n n Inductive Step: To prove P (n + 1) is true

49 3 Solutions 147 From the hypothesis, we know that 1 x n n Thus, 1 x n n 1 x n n Because 1 x n 1 x 1, we have n Therefore, P (n + 1) is true x n x x n + 1 n x n + 1 n x n and n + 1 x n + 1 n x x n + 1 n x n + 1 n x n + 1 n 1 x n + 1 x n + 1 n 1 x n+1 n x n+1 n + 1 Method : There is another way to prove the inductive step Inductive Step: To prove P (n + 1) is true From the hypothesis we know 1 x n n, and 1 n 1 x n we know 0 1 n, thus By adding (11) and (1), we get Because n, we have P (n + 1) is true 1 Moreover, 1 x n n (311) 1 n 1 x 1 (31) n n x n + 1 x n + 1 n 1 x n + 1 x n + 1 n 1 x n + 1 x n + 1 n 1 x n+1 n x n+1 n + 1

50 148 3 Mathematical Induction Solution 31: Inductive Basis: n = 0 H n = H 1 = 1 i 1 1 i = Inductive Hypothesis: Assume H n ( 1 + n ) Inductive Step: H n+1 = H n [The Basis Holds] = n + 1 n n n + n = H n + 1 n n n + n 1 + n + 1 n n n + n 1 + n + = 1 + n + n n + n {}} n { 1 n + n + 1 n + n n + n = 1 + n + 1 Therefore, for all n 0, H n ( 1 + n ) Solution 3: Let A denote the set of all possible strings made from A, where λ A Let µ range over A, and let µ denote the length of µ We will prove the theorem by mathematical induction on the length of strings Let us first define the domain and the predicate P (n) D n : {0, 1,, 3, }, P (n) : µ A, [( µ = n) (µ S µ is a palindrome)]

3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

The Foundations: Logic and Proofs. Chapter 1, Part III: Proofs

The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments

Problems on Discrete Mathematics 1

Problems on Discrete Mathematics 1 Chung-Chih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from

Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.

MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P

Sample Induction Proofs

Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given

Applications of Methods of Proof

CHAPTER 4 Applications of Methods of Proof 1. Set Operations 1.1. Set Operations. The set-theoretic operations, intersection, union, and complementation, defined in Chapter 1.1 Introduction to Sets are

Mathematical induction. Niloufar Shafiei

Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of

Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

Basic Proof Techniques

Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note 11

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Note Conditional Probability A pharmaceutical company is marketing a new test for a certain medical condition. According

SECTION 10-2 Mathematical Induction

73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2

CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

CHAPTER 3 Numbers and Numeral Systems

CHAPTER 3 Numbers and Numeral Systems Numbers play an important role in almost all areas of mathematics, not least in calculus. Virtually all calculus books contain a thorough description of the natural,

Section 6-2 Mathematical Induction

6- Mathematical Induction 457 In calculus, it can be shown that e x k0 x k k! x x x3!! 3!... xn n! where the larger n is, the better the approximation. Problems 6 and 6 refer to this series. Note that

Introduction. Appendix D Mathematical Induction D1

Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce

8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

Mathematical Induction. Mary Barnes Sue Gordon

Mathematics Learning Centre Mathematical Induction Mary Barnes Sue Gordon c 1987 University of Sydney Contents 1 Mathematical Induction 1 1.1 Why do we need proof by induction?.... 1 1. What is proof by

Appendix F: Mathematical Induction

Appendix F: Mathematical Induction Introduction In this appendix, you will study a form of mathematical proof called mathematical induction. To see the logical need for mathematical induction, take another

Worksheet on induction Calculus I Fall 2006 First, let us explain the use of for summation. The notation

Worksheet on induction MA113 Calculus I Fall 2006 First, let us explain the use of for summation. The notation f(k) means to evaluate the function f(k) at k = 1, 2,..., n and add up the results. In other

2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.

2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then

def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.

Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

We now explore a third method of proof: proof by contradiction.

CHAPTER 6 Proof by Contradiction We now explore a third method of proof: proof by contradiction. This method is not limited to proving just conditional statements it can be used to prove any kind of statement

Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

Math 3000 Section 003 Intro to Abstract Math Homework 2

Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these

PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions

CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions Theory of Formal Languages In the English language, we distinguish between three different identities: letter, word, sentence.

x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

Math212a1010 Lebesgue measure.

Math212a1010 Lebesgue measure. October 19, 2010 Today s lecture will be devoted to Lebesgue measure, a creation of Henri Lebesgue, in his thesis, one of the most famous theses in the history of mathematics.

C H A P T E R Regular Expressions regular expression

7 CHAPTER Regular Expressions Most programmers and other power-users of computer systems have used tools that match text patterns. You may have used a Web search engine with a pattern like travel cancun

Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

Sets and set operations

CS 441 Discrete Mathematics for CS Lecture 7 Sets and set operations Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square asic discrete structures Discrete math = study of the discrete structures used

CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers

CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)

An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

Lecture 13 - Basic Number Theory.

Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted

1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture No. # 31 Recursive Sets, Recursively Innumerable Sets, Encoding

1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this

Notes on counting finite sets

Notes on counting finite sets Murray Eisenberg February 26, 2009 Contents 0 Introduction 2 1 What is a finite set? 2 2 Counting unions and cartesian products 4 2.1 Sum rules......................................

Cardinality. The set of all finite strings over the alphabet of lowercase letters is countable. The set of real numbers R is an uncountable set.

Section 2.5 Cardinality (another) Definition: The cardinality of a set A is equal to the cardinality of a set B, denoted A = B, if and only if there is a bijection from A to B. If there is an injection

Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

Discrete Mathematics: Solutions to Homework (12%) For each of the following sets, determine whether {2} is an element of that set.

Discrete Mathematics: Solutions to Homework 2 1. (12%) For each of the following sets, determine whether {2} is an element of that set. (a) {x R x is an integer greater than 1} (b) {x R x is the square

INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

Math 115 Spring 2011 Written Homework 5 Solutions

. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence

We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

MATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform

MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish

LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

The Language of Mathematics

CHPTER 2 The Language of Mathematics 2.1. Set Theory 2.1.1. Sets. set is a collection of objects, called elements of the set. set can be represented by listing its elements between braces: = {1, 2, 3,

Solutions for Practice problems on proofs

Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

Cartesian Products and Relations

Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special

Recursive Algorithms. Recursion. Motivating Example Factorial Recall the factorial function. { 1 if n = 1 n! = n (n 1)! if n > 1

Recursion Slides by Christopher M Bourke Instructor: Berthe Y Choueiry Fall 007 Computer Science & Engineering 35 Introduction to Discrete Mathematics Sections 71-7 of Rosen cse35@cseunledu Recursive Algorithms

Student Outcomes. Lesson Notes. Classwork. Discussion (10 minutes)

NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 5 8 Student Outcomes Students know the definition of a number raised to a negative exponent. Students simplify and write equivalent expressions that contain

Answer Key for California State Standards: Algebra I

Algebra I: Symbolic reasoning and calculations with symbols are central in algebra. Through the study of algebra, a student develops an understanding of the symbolic language of mathematics and the sciences.

Sections 2.1, 2.2 and 2.4

SETS Sections 2.1, 2.2 and 2.4 Chapter Summary Sets The Language of Sets Set Operations Set Identities Introduction Sets are one of the basic building blocks for the types of objects considered in discrete

Introduction to Proofs

Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are

Predicate Logic. For example, consider the following argument:

Predicate Logic The analysis of compound statements covers key aspects of human reasoning but does not capture many important, and common, instances of reasoning that are also logically valid. For example,

Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products

Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing

Iteration, Induction, and Recursion

CHAPTER 2 Iteration, Induction, and Recursion The power of computers comes from their ability to execute the same task, or different versions of the same task, repeatedly. In computing, the theme of iteration

Set Theory Basic Concepts and Definitions

Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric

Euclidean Geometry. We start with the idea of an axiomatic system. An axiomatic system has four parts:

Euclidean Geometry Students are often so challenged by the details of Euclidean geometry that they miss the rich structure of the subject. We give an overview of a piece of this structure below. We start

Math 4310 Handout - Quotient Vector Spaces

Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable

Pythagorean Triples. Chapter 2. a 2 + b 2 = c 2

Chapter Pythagorean Triples The Pythagorean Theorem, that beloved formula of all high school geometry students, says that the sum of the squares of the sides of a right triangle equals the square of the

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

Homework 5 Solutions

Homework 5 Solutions 4.2: 2: a. 321 = 256 + 64 + 1 = (01000001) 2 b. 1023 = 512 + 256 + 128 + 64 + 32 + 16 + 8 + 4 + 2 + 1 = (1111111111) 2. Note that this is 1 less than the next power of 2, 1024, which

Vector Spaces II: Finite Dimensional Linear Algebra 1

John Nachbar September 2, 2014 Vector Spaces II: Finite Dimensional Linear Algebra 1 1 Definitions and Basic Theorems. For basic properties and notation for R N, see the notes Vector Spaces I. Definition

11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

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

Handout #1: Mathematical Reasoning

Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or

2.1 Sets, power sets. Cartesian Products.

Lecture 8 2.1 Sets, power sets. Cartesian Products. Set is an unordered collection of objects. - used to group objects together, - often the objects with similar properties This description of a set (without

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

Undergraduate 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

This unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.

Algebra I Overview View unit yearlong overview here Many of the concepts presented in Algebra I are progressions of concepts that were introduced in grades 6 through 8. The content presented in this course

Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete

Homework until Test #2

MATH31: Number Theory Homework until Test # Philipp BRAUN Section 3.1 page 43, 1. It has been conjectured that there are infinitely many primes of the form n. Exhibit five such primes. Solution. Five such

MACM 101 Discrete Mathematics I

MACM 101 Discrete Mathematics I Exercises on Combinatorics, Probability, Languages and Integers. Due: Tuesday, November 2th (at the beginning of the class) Reminder: the work you submit must be your own.

Mathematical Induction

Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How

4 Domain Relational Calculus

4 Domain Relational Calculus We now present two relational calculi that we will compare to RA. First, what is the difference between an algebra and a calculus? The usual story is that the algebra RA is

POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

4.1. Definitions. A set may be viewed as any well defined collection of objects, called elements or members of the set.

Section 4. Set Theory 4.1. Definitions A set may be viewed as any well defined collection of objects, called elements or members of the set. Sets are usually denoted with upper case letters, A, B, X, Y,

Generating Functions Count

2 Generating Functions Count 2.1 Counting from Polynomials to Power Series Consider the outcomes when a pair of dice are thrown and our interest is the sum of the numbers showing. One way to model the

NUMBER SYSTEMS. William Stallings

NUMBER SYSTEMS William Stallings The Decimal System... The Binary System...3 Converting between Binary and Decimal...3 Integers...4 Fractions...5 Hexadecimal Notation...6 This document available at WilliamStallings.com/StudentSupport.html