# MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:

Save this PDF as:

Size: px
Start display at page:

Download "MATH 289 PROBLEM SET 1: INDUCTION. 1. The induction Principle The following property of the natural numbers is intuitively clear:"

## Transcription

1 MATH 89 PROBLEM SET : INDUCTION The induction Principle The following property of the natural numbers is intuitively clear: Axiom Every nonempty subset of the set of nonnegative integers Z 0 = {0,,, 3, } has a smallest element This axiom can be thought of a instance of the extremal principle which will be discussed later Suppose that k is an integer and we want to prove that P (n) is true for every positive integer n, where P (n) is a proposition (statement) which depends on a positive integer n Proving P (), P (), P (3) individually, would take an infinite amount of time Instead, we can use the Induction Principle: Theorem (Induction Principle) Assume that k is an integer and P (n) is a proposition for all n k () Suppose that P (k) is true, and () for any integer m k for which P (m) is true, P (m + ) is true Then P (n) is true for all integers n k For k =, the induction principle can be compared to an infinite sequence of dominos tiles, numbered,,3, etc If the m-th domino tile falls, it will hit the (m + )-th domino tile and the (m + )-th domino tile will fall as well If the first domino tile falls, then all domino tiles will fall down (Here P (n) is the statement: the n-th domino tile falls down ) Proof of the Induction Principle Let S to be the set of all nonnegative integers i for which P (k + i) is false If S is nonempty, then S has a smallest element, say l by Axiom By property ()), P (k) is true and l > 0 The statement P (k + l ) is true because l is the minimal element of S Therefore, statement P (k + l) is true because of property () Hence l S Contradiction! We conclude that S is empty, and P (n) is true for all n k A typical example of the induction principle is the following:

2 Example 3 Prove that () n = for every positive integer n n(n + ) Proof We prove () by induction on n For n = we check that = Suppose that () is true for n = m Then ( + ) m + (m + ) = ( m) + (m + ) = m(m + ) (m + )(m + ) = + (m + ) = So () is true for n = m + Now () is true for all positive integers n by the induction principle Remark 4 When the German mathematician Carl Friedrich Gauss ( ) was 0 years old, his school teacher gave the class an assignment to add all the numbers from to 00 Gauss gave the answer almost immediately: 5050 This is how (we think) he did it: Write the numbers from to 00 from left to right Write under that the numbers from to 00 in reverse order } 0 0 {{ 0 } 00 Each of the 00 column sums is 0 This shows that and ( ) = = This easily generalizes to a proof of () 00 0 = 50 0 = 5050 A formula similar to () exists for the sums of squares, namely () n = Example 5 Give and prove a formula for n 3 n(n + )(n + ) 6 We have seen similar examples, namely () and () We can also add the formula n 0 = n Let p k (n) = k + k + 3 k + + n k where k Z 0 The examples so far suggest that p k (n) is a polynomial of degree k + (and that the leading coefficient is ) Let us assume that p k+ 3(n) is a polynomial of degree 4

3 Since p 3 (0) is an empty sum, we have that p 3 (0) = 0 We can write p 3 (n) = an 4 + bn 3 + cn + dn for certain real numbers a, b, c, d We have (3) n 3 = p 3 (n) p 3 (n ) = a(n 4 (n ) 4 )+b(n 3 (n ) 3 )+c(n (n ) )+d(n (n )) = = a(4n 3 6n + 4n ) + b(3n 3n + ) + c(n ) + d = = n 3 (4a) + n ( 6a + 3b) + n(4a 3b + c) + ( a + b c + d) Comparing coefficients in (3) gives us the linear equations: (4) (5) (6) (7) = 4a 0 = 6a + 3b 0 = 4a 3b + c 0 = a + b c + d We solve the system of equations and find a =, b =, c = and d = 0 We now should 4 4 conjecture the following formula: n 3 = 4 n4 + n3 + 4 n Finding this formula was the hard part It is now not so hard to prove this formula by induction: Proof We will prove that (8) n 3 = 4 n4 + n3 + 4 n by induction on n The case n = 0 is clear, because both sides of the equation are equal to 0 If (8) is true for n = m, then From this follows that (m ) 3 = 4 (m )4 + (m )3 + 4 (m ) (m ) 3 + m 3 = 4 (m )4 + (m )3 + 4 (m ) + m 3 = = 4 (m4 4m 3 + 6m 4m + ) + (m3 3m + 3m ) + 4 (m m + ) + m 3 = = 4 m4 + m3 + 4 m, so (8) is true for n = m By induction follows that (8) is true for all n Z 0 Notice that 4 m4 + m3 + 4 m = ( n(n + )) which leads to the following aesthetic formula: Example 6 What is the value of n 3 = ( n) ? 3

4 Let us compute the partial sums Perhaps we will find a pattern + 3 = = 3, = 3 + = 8 + = 9 = 3 4, = = = 6 0 = 4 5 A pattern emerges Namely, it seems that (9) Proof By induction on n we prove: (0) For n = we check If (0) is true for n = m, then n(n + ) = n n(n + ) = n + = m(m + ) + (m + )(m + ) = = ( ) + ( m + m + m + ) = m + Hence (0) is true for n = m + By induction, (0) is true for all integers n We have = lim ( ) = n n + Example 7 (UMUMC, 988) Let S n be the set of all pairs (x, y) with integral coordinates such that x 0, y 0 and x + y n Show that S n cannot be covered by the union of n straight lines First we should try a few small cases, say n = 0,,, 3, 4: n=0 n= n= n=3 n=4 Notice that S n is a subset of S n+ This will be helpful for our induction proof: 4

5 Proof We prove the statement by induction on n, the case n = 0 being trivial Suppose that one needs at least n + lines to cover S n Define C n+ = S n+ \ S n The set C n+ consists of n + points on the line x + y = n + Suppose that k lines l, l,, l k cover S n+ case : One of the lines is equal to the line x + y = n + Without loss of generality we may assume that l k is equal to the line x + y = n + Then l, l,, l k cover S n because l k S n = From the induction hypothesis follows that k n +, so k n + case : None of the lines are equal to the line x+y = n+ Then each of the lines intersects the line x + y = n + in at most one point, and therefore it intersects the set C n+ in at most one point Since C n+ has n + elements, there must be at least n + lines So in both cases we conclude that one needs at least n + lines to cover S n+ Strong Induction The following example illustrates that sometimes one has to make a statement stronger in order to be able to prove it by induction Example 8 Prove that () , 999, 000, 000 < 000 Since 000 =, 000, 000 one might suggest that n n < n for all n Let us try to prove () We can check () for small n (which gives some validity to our conjecture that this inequality holds) Suppose that () holds for n = m: () We have to prove () for n = m + : (3) If we divide (3) by () we obtain (4) m m < m m + m + < m + m + m + m m + If () and (4) are true, then (3) is true By squaring (4) we see that (4) is equivalent to ( ) m + m m + m + and to (5) (m + ) (m + )(m) So if (5) is true then our induction proof is complete Unfortunately (5) is not true and we are stuck Sometimes it is easier to prove a stronger statement by induction: 5

6 Proof We prove (6) 3 4 n n by induction on n The case n = is clear because < 3 < n + Suppose that (6) is true for n = m: (7) 3 4 m m < m + Since (m + )(m + 3) = (m + ) < (m + ) we have that ( ) m + < m + m + m + 3 and m + m + (8) m + < m + 3 Multiplying (7) by (8) yields 3 (9) 4 m + m + <, m + 3 so (6) is true for n = m + This shows that (6) is true for all positive integers n In particular, for n = 500, 000 we get , 999, 000, 000 < <, 000, Below is a trickier proof of Example 8 Proof Let and Clearly A < B because It follows that and A < 000 A = B = , , 000, , 000, , 000, 00 < 3, 3 4 < 4 5,, 999, 999, 000, 000 A < AB = <, 000, 000, 000, 00, 000, 00 <, 000, 000 Example 9 Prove that every integer n is a product of prime numbers 6

7 Proof Let Q(n) be the statement: every integer r with r n is a product of prime numbers We use induction on n to prove that Q(n) holds for all integers n For n = the statement is true because is a prime number Suppose that Q(m) is true We will prove Q(m + ) Suppose that r m + If r m then r is a product of prime numbers because Q(m) is true Suppose that r = m + If m + is a prime number, then m + is a product of prime numbers and we are done Otherwise, m + can be written as a product ab with a, b m Because Q(m) is true, both a and b are products of prime numbers Hence m + = ab is a product of prime numbers We have shown that Q(n) holds for all n In particular, every integer r is a product of prime numbers because Q(r) is true 3 Induction in definitions We can also use induction in a definition For example, the Fibonacci numbers is a sequence of numbers F 0, F, F, defined by F 0 = 0, F = and F n+ = F n + F n, n By (strong) induction on n we can prove that F n is well-defined for all integers n 0 The first few Fibonacci numbers are: 0,,,, 3, 5, 8, 3,, 34, 55, 89, The sum notation is an example of a recursive definition function If a, b are integers and a b + then we define b f(n) as follows and (0) a f(n) = 0 b b f(n) = f(b) + f(n) if b a One can then formally prove by induction that c b f(n) = f(n) + c n=b+ f(n) if a, b, c Z and a b c (Induction on c Start with c = b) Similarly we have the product notation a f(n) = 7 Suppose that f(n) is some

8 and b b f(n) = f(b) f(n) if b a For nonnegative integers m and n with m n we define a binomial coefficient by ( ) { n = ) ( if m = 0 or m = n m + n ) if 0 < m < n ( n m If we arrange the binomial coefficients in a triangular shape, we get Pascal s triangle: ( 0 ( ) 0) ( ( 0 ) ( ) ) ( ( 0 3 ) ( 3 ) ( 3 ) ) ( 3 ( 0 4 ) ( 4 ) ( 4 ) ( 4 ) 3) ( ) m After evaluating the binomial coefficients we get: Exercise * Prove that for all positive integers n Exercise * Show that for all n N Exercise 3 * Prove that 4 Exercises n = n(n + )(n + ) n n = n + + n n n ( ) ( ) m + i m + n + = m m + i=0 for all nonnegative integers m and n Exercise 4 * Prove that Exercise 5 * (a + b) n = a n + 0 a n b + 8 a n b + + b n n

9 (a) Prove that + x + x + + x n = xn+ x for every real number x and every positive integer n (b) If x is a real number with x < then + x + x + = x Exercise 6 ** Show that the sum of the squares of two consecutive Fibonacci numbers is again a Fibonacci number Exercise 7 ** Cut out a corner of a n n chess board (n ) Show that the remainder of the chess board can be covered with L-shaped tiles (see picture) The case n = is shown below Exercise 8 ** Find and prove a formula for Exercise 9 ** Show that as follows: Define f(x) = ( + x) n = n 4 = m n! m! (n m)! + 0 x + + and consider f (k) (0) (f (k) (x) is the k-th derivative of f(x)) x n n Exercise 0 ** Define a sequence a, a, by a = 5 and a n+ = a n for n Give an explicit formula for a n and prove it Exercise (Division with remainder) ** Suppose that n is a nonnegative integer, and m is a positive integer Prove that there exist integers q and r with n = qm + r and 0 r < m Exercise ** Give and prove a formula for n (n + ) (n + ) 9

10 Exercise 3 (Expansion in base b) *** Suppose that n is a positive integer, and b is an integer Show that there exist an nonnegative integer m, and integers a 0, a,, a m {0,,,, b } such that () n = a m b m + a m b m + + a 0 and a m 0 Moreover, show that m and a 0, a,, a m are uniquely determined by n (We will write (a m a m a 0 ) b for the right-hand side in ()) Exercise 4 (Zeckendorf s Theorem) *** Suppose that n is a positive integer Show that we can write n = F i + F i + + F ik where k is a positive integer, i and i j i j + for j =, 3,, k Also show that k and i,, i k are uniquely determined by n Exercise 5 (Putnam 985, B) *** Define polynomials f n (x) for n 0 by f 0 (x) =, f n (0) = 0 for n, and d dx (f n+(x)) = (n + )f n (x + ) for n 0 Find, with proof, the explicit factorization of f 00 () into powers of distinct primes Exercise 6 (Putnam 987, B) *** Let r, s and t be integers with 0 r, 0 s and r + s t Prove that ( s ( s ( s ( 0) t + ( ) t ) + + s) t + ( t ) = r) (t + s) ( t s) r+ r+s r Exercise 7 **** Let n = k Prove that we can select n integers from any (n ) integers such that their sum is divisible by n Exercise 8 *** Find the sum of all fractions /xy such that gcd(x, y) =, x n, y n, x + y > n Exercise 9 **** Find and prove a formula for π sin n (x) dx 0 Exercise 0 **** Suppose that a, a,, a n are positive integers such that a a a n Prove that a + a + + a n = implies that a n < n! Exercise *** Generalize example 7: Let S n,d R d be the set of all integer vectors (x,, x d ) such that x i 0 for all i and x + x + + x d n Show that S n,d cannot be covered with n hyperplanes in R d 0

### 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)

### Taylor and Maclaurin Series

Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions

### 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

### 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

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### 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

### 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

### 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

### 3. INNER PRODUCT SPACES

. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.

### 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

### 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

### 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

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### MATH 289 PROBLEM SET 4: NUMBER THEORY

MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides

### 1. LINEAR EQUATIONS. A linear equation in n unknowns x 1, x 2,, x n is an equation of the form

1. LINEAR EQUATIONS A linear equation in n unknowns x 1, x 2,, x n is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b, where a 1, a 2,..., a n, b are given real numbers. For example, with x and

### Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

### MATH10040 Chapter 2: Prime and relatively prime numbers

MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive

### Taylor Polynomials and Taylor Series Math 126

Taylor Polynomials and Taylor Series Math 26 In many problems in science and engineering we have a function f(x) which is too complicated to answer the questions we d like to ask. In this chapter, we will

### Some Notes on Taylor Polynomials and Taylor Series

Some Notes on Taylor Polynomials and Taylor Series Mark MacLean October 3, 27 UBC s courses MATH /8 and MATH introduce students to the ideas of Taylor polynomials and Taylor series in a fairly limited

### 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

### 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

### 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,

### 9.2 Summation Notation

9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a

### 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

### PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include 2 + 5.

PUTNAM TRAINING POLYNOMIALS (Last updated: November 17, 2015) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include

### Inner Product Spaces

Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and

### 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

### 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

### 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

### 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

### Lectures 5-6: Taylor Series

Math 1d Instructor: Padraic Bartlett Lectures 5-: Taylor Series Weeks 5- Caltech 213 1 Taylor Polynomials and Series As we saw in week 4, power series are remarkably nice objects to work with. In particular,

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### 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

### 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

### 8 Primes and Modular Arithmetic

8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.

### 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

### 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

### Lectures on Number Theory. Lars-Åke Lindahl

Lectures on Number Theory Lars-Åke Lindahl 2002 Contents 1 Divisibility 1 2 Prime Numbers 7 3 The Linear Diophantine Equation ax+by=c 12 4 Congruences 15 5 Linear Congruences 19 6 The Chinese Remainder

### Stanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions

Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in

### I remember that when I

8. Airthmetic and Geometric Sequences 45 8. ARITHMETIC AND GEOMETRIC SEQUENCES Whenever you tell me that mathematics is just a human invention like the game of chess I would like to believe you. But I

### 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

### arxiv:math/0202219v1 [math.co] 21 Feb 2002

RESTRICTED PERMUTATIONS BY PATTERNS OF TYPE (2, 1) arxiv:math/0202219v1 [math.co] 21 Feb 2002 TOUFIK MANSOUR LaBRI (UMR 5800), Université Bordeaux 1, 351 cours de la Libération, 33405 Talence Cedex, France

### Continued Fractions. Darren C. Collins

Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### 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

### 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

### Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00

18.781 Problem Set 7 - Fall 2008 Due Tuesday, Oct. 28 at 1:00 Throughout this assignment, f(x) always denotes a polynomial with integer coefficients. 1. (a) Show that e 32 (3) = 8, and write down a list

### 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,

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### 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

### 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

### 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,

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### 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

### MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set. Vector space A vector space is a set V equipped with two operations, addition V V (x,y) x + y V and scalar

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### 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

### Handout NUMBER THEORY

Handout of NUMBER THEORY by Kus Prihantoso Krisnawan MATHEMATICS DEPARTMENT FACULTY OF MATHEMATICS AND NATURAL SCIENCES YOGYAKARTA STATE UNIVERSITY 2012 Contents Contents i 1 Some Preliminary Considerations

### 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

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### 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

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### 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

### Series Convergence Tests Math 122 Calculus III D Joyce, Fall 2012

Some series converge, some diverge. Series Convergence Tests Math 22 Calculus III D Joyce, Fall 202 Geometric series. We ve already looked at these. We know when a geometric series converges and what it

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### ARITHMETICAL FUNCTIONS II: CONVOLUTION AND INVERSION

ARITHMETICAL FUNCTIONS II: CONVOLUTION AND INVERSION PETE L. CLARK 1. Sums over divisors, convolution and Möbius Inversion The proof of the multiplicativity of the functions σ k, easy though it was, actually

### Chapter 3. Distribution Problems. 3.1 The idea of a distribution. 3.1.1 The twenty-fold way

Chapter 3 Distribution Problems 3.1 The idea of a distribution Many of the problems we solved in Chapter 1 may be thought of as problems of distributing objects (such as pieces of fruit or ping-pong balls)

### Metric Spaces Joseph Muscat 2003 (Last revised May 2009)

1 Distance J Muscat 1 Metric Spaces Joseph Muscat 2003 (Last revised May 2009) (A revised and expanded version of these notes are now published by Springer.) 1 Distance A metric space can be thought of

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### STUDENT S SOLUTIONS MANUAL ELEMENTARY NUMBER THEORY. Bart Goddard. Kenneth H. Rosen AND ITS APPLICATIONS FIFTH EDITION. to accompany.

STUDENT S SOLUTIONS MANUAL to accompany ELEMENTARY NUMBER THEORY AND ITS APPLICATIONS FIFTH EDITION Bart Goddard Kenneth H. Rosen AT&T Labs Reproduced by Pearson Addison-Wesley from electronic files supplied

### Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

### Just the Factors, Ma am

1 Introduction Just the Factors, Ma am The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive

### Course Notes for Math 162: Mathematical Statistics Approximation Methods in Statistics

Course Notes for Math 16: Mathematical Statistics Approximation Methods in Statistics Adam Merberg and Steven J. Miller August 18, 6 Abstract We introduce some of the approximation methods commonly used

### TAKE-AWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION

TAKE-AWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf take-away?f have become popular. The purpose of this paper is to determine the

### 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

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### 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

### THE BANACH CONTRACTION PRINCIPLE. Contents

THE BANACH CONTRACTION PRINCIPLE ALEX PONIECKI Abstract. This paper will study contractions of metric spaces. To do this, we will mainly use tools from topology. We will give some examples of contractions,

### 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

### 4. An isosceles triangle has two sides of length 10 and one of length 12. What is its area?

1 1 2 + 1 3 + 1 5 = 2 The sum of three numbers is 17 The first is 2 times the second The third is 5 more than the second What is the value of the largest of the three numbers? 3 A chemist has 100 cc of

### The thing that started it 8.6 THE BINOMIAL THEOREM

476 Chapter 8 Discrete Mathematics: Functions on the Set of Natural Numbers (b) Based on your results for (a), guess the minimum number of moves required if you start with an arbitrary number of n disks.

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### 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

### 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

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Putnam Notes Polynomials and palindromes

Putnam Notes Polynomials and palindromes Polynomials show up one way or another in just about every area of math. You will hardly ever see any math competition without at least one problem explicitly concerning

### 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

### Solutions Manual for How to Read and Do Proofs

Solutions Manual for How to Read and Do Proofs An Introduction to Mathematical Thought Processes Sixth Edition Daniel Solow Department of Operations Weatherhead School of Management Case Western Reserve

### 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

### SOLUTIONS FOR PROBLEM SET 2

SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such

### Catalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.

7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,

### March 29, 2011. 171S4.4 Theorems about Zeros of Polynomial Functions

MAT 171 Precalculus Algebra Dr. Claude Moore Cape Fear Community College CHAPTER 4: Polynomial and Rational Functions 4.1 Polynomial Functions and Models 4.2 Graphing Polynomial Functions 4.3 Polynomial

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### 5.1 Commutative rings; Integral Domains

5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following