Homework 9. (n + 1)! = 1 1

Similar documents
4 Mathematical Induction

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

Math 140A Elementary Analysis Homework Questions 1

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

Math 155 (Lecture 3)

1. By using truth tables prove that, for all statements P and Q, the statement

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.

Math F215: Induction April 7, 2013

SOME TRIBONACCI IDENTITIES

Lecture 1. January 8, 2018

Mathematical Induction

Fermat s Little Theorem. mod 13 = 0, = }{{} mod 13 = 0. = a a a }{{} mod 13 = a 12 mod 13 = 1, mod 13 = a 13 mod 13 = a.

Week 5-6: The Binomial Coefficients

3 Gauss map and continued fractions

2.4 Sequences, Sequences of Sets

Infinite Sequences and Series

Homework 2 January 19, 2006 Math 522. Direction: This homework is due on January 26, In order to receive full credit, answer

Math 104: Homework 2 solutions

Hoggatt and King [lo] defined a complete sequence of natural numbers

MATH 304: MIDTERM EXAM SOLUTIONS

Lecture 10: Mathematical Preliminaries

If a subset E of R contains no open interval, is it of zero measure? For instance, is the set of irrationals in [0, 1] is of measure zero?

Law of the sum of Bernoulli random variables

Lecture Notes for CS 313H, Fall 2011

Bertrand s Postulate

Test One (Answer Key)

Modern Algebra 1 Section 1 Assignment 1. Solution: We have to show that if you knock down any one domino, then it knocks down the one behind it.

Combinatorics and Newton s theorem

SOLVED EXAMPLES

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

Exercises 1 Sets and functions

Regent College Maths Department. Further Pure 1. Proof by Induction

The Boolean Ring of Intervals

1 Introduction. 1.1 Notation and Terminology

Different kinds of Mathematical Induction

n=1 a n is the sequence (s n ) n 1 n=1 a n converges to s. We write a n = s, n=1 n=1 a n

The Borel hierarchy classifies subsets of the reals by their topological complexity. Another approach is to classify them by size.

Lecture 2. The Lovász Local Lemma

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Cardinality Homework Solutions

The multiplicative structure of finite field and a construction of LRC

The Structure of Z p when p is Prime

MAT1026 Calculus II Basic Convergence Tests for Series

Basic Sets. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4

Chapter 0. Review of set theory. 0.1 Sets

Measure and Measurable Functions

Assignment 5: Solutions

Summer High School 2009 Aaron Bertram

Solutions to Math 347 Practice Problems for the final

Induction proofs - practice! SOLUTIONS

Theorem 3. A subset S of a topological space X is compact if and only if every open cover of S by open sets in X has a finite subcover.

Definition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California

Statistical Machine Learning II Spring 2017, Learning Theory, Lecture 7

Enumerative & Asymptotic Combinatorics

Axioms of Measure Theory

Seunghee Ye Ma 8: Week 5 Oct 28

Examples on Mathematical Induction: Sum of product of integers Created by Mr. Francis Hung Last updated: December 4, 2017

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Math 2112 Solutions Assignment 5

Fundamental Theorem of Algebra. Yvonne Lai March 2010

Complex Numbers Solutions

Optimal Littlewood-Offord inequalities in groups

Metric Space Properties

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

Section 5.1 The Basics of Counting

Math 120 Answers for Homework 23

Chain conditions. 1. Artinian and noetherian modules. ALGBOOK CHAINS 1.1

Class notes on sec+ons 4.2, 5.1, 5.2 and 5.3

MT5821 Advanced Combinatorics

PERIODS OF FIBONACCI SEQUENCES MODULO m. 1. Preliminaries Definition 1. A generalized Fibonacci sequence is an infinite complex sequence (g n ) n Z

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

6.3 Testing Series With Positive Terms

Math 299 Supplement: Real Analysis Nov 2013

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Part A, for both Section 200 and Section 501

M A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O

Lecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =

CS / MCS 401 Homework 3 grader solutions

Arkansas Tech University MATH 2924: Calculus II Dr. Marcel B. Finan

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

Math 25 Solutions to practice problems

Pb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2

MATH1035: Workbook Four M. Daws, 2009

Let us consider the following problem to warm up towards a more general statement.

a 2 +b 2 +c 2 ab+bc+ca.

SEQUENCES AND SERIES

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

REVIEW FOR CHAPTER 1

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

GROUPOID CARDINALITY AND EGYPTIAN FRACTIONS

Lecture 7: Properties of Random Samples

Mathematical Induction. How do you program a robot to climb infinite stairs? Let s use that as a proof method. 22c:19 Chapter 4 Hantao Zhang

Objective Mathematics

1 Last time: similar and diagonalizable matrices

Math 220A Fall 2007 Homework #2. Will Garner A

Problem 4: Evaluate ( k ) by negating (actually un-negating) its upper index. Binomial coefficient

A detailed proof of the irrationality of π

Transcription:

. Chapter : Questio 8 If N, the Homewor 9 Proof. We will prove this by usig iductio o. 2! + 2 3! + 3 4! + + +! +!. Base step: Whe the left had side is. Whe the right had side is 2! 2 +! 2 which proves the equality is true whe. Iductive step: Let. We will assume that + 2 + 3 + +. Our goal is to 2! 3! 4! +! +! show that + 2 + 3 + + +. Usig our iductive assumptio we have 2! 3! 4! ++! ++! 2! + 2 3! + 3 4! + + + + +! + +! + + +! + 2! +! + + 2! + +! + 2 +! + 2 + +!. By iductio we have thus show that + 2 + 3 + + 2! 3! 4!. 2. Chapter : Questio For ay iteger, it follows that 3 5 2. for all atural umbers +! +! Proof. We will assume to the cotrary that there is some iteger where 3 does ot divide 5 2. This meas that there is some smallest iteger such that 3 5 2. Sice is smallest for ay iteger i with i < we ow 3 5 2i. Note that sice if we have 5 2 ad 3. Sice we ca assume that >. Sice > we ow that ad is less tha so by our previous assumptios 3 5 2. By defiitio of divides we have for some iteger m that 5 2 3m 255 2 253m 5 2 25 75m 5 2 75m + 24 325m + 8 which cotradicts our assumptio that 3 5 2. Hece 3 5 2 for all itegers. 3. Chapter : Questio 8 Suppose A, A 2,..., A are sets i some uiversal set U, ad 2. Prove that A A 2 A A A 2 A.

Proof. We will prove this by usig iductio o. Base step: 2. We ow wheever we have two sets A ad A 2 i the uiversal set U by DeMorga s law A A 2 A A 2. Iductive step: Let 2. We will assume that give ay subsets B, B 2,..., B of U that B B 2 B B B 2 B. Our goal is to show that give ay + subsets A, A 2,..., A + of U that A A 2 A + A A 2 A +. So let A, A 2,..., A + be ay + sets which are subsets of the uiversal set U. Note that the A, A 2,..., A is a collectio of subsets of U so we ca apply our iductive assumptio to this collectio of sets. Usig DeMorga s law ad our iductive assumptio we have that which proves our statemet by iductio. 4. Chapter : Questio 22 If N, the 2 4 A A 2 A A + A A 2 A A + 8 Proof. We will prove this by usig iductio o. A A 2 A A + A A 2 A A + 2 6 4 + 2. + Base step: Whe the left had side is. Whe the right had side is + 2 2 4 2 + 2 ad sice the iequality is true for. 2 2 Iductive step: Let. We will assume that 2 4 8 6 2 +. Our goal is to show that 4 2 + 2 4 8 6 2 +. Usig + 4 2 ++ our iductive assumptio we have [ 2 ] [ 2 4 8 6 2 + 4 + ] 2 + 2 + 4 + 2 + 4 2 + 2 + 2 + 4 + 2 + 4 2 + Because we ow 2 + 2 + 4 so 4 + 2 + Thus we have show 2 4 8 2 4 8 6 3 4 2 + 4 + 3 2 + 4 + 2 + 4 + 4 + 2 + 4 4 2 2 ++ 6 2 + + 4 for all N. 2 + 2 4 + 5. Prove that if m N is a multiple of 4 the F m is a multiple of 3. 3 4 2 +. 2 ++. Hece by iductio The Fiboacci umbers are defied to be F, F 2, ad F F + F 2 for > 2.

Proof. We will show that whe m 4 for ay iteger we have that F m F 4 is a multiple of 3. We will prove this by iductig o. Base step: Whe we have m 4 4 ad F m F 4 F 3 +F 2 F 2 +F +F 2 ++ 3 which is a multiple of 3. Iductive step: Let we will assume that F 4 is a multiple of 3 ad show that F 4+ is also a multiple of 3. Sice F 4 is a multiple of 3 we ow F 4 3x for some iteger x. Usig the Fiboacci recurrece we have F 4+ F 4+4 F 4+3 + F 4+2 F 4+2 + F 4+ + F 4+ + F 4 F 4+ + F 4 + F 4+ + F 4+ + F 4 3F 4+ + 2F 4 3F 4+ + 23x 3F 4+ + 2x. Hece F 4+ is also a multiple of 3. Therefore, by iductio we ca coclude that F 4 is a multiple of 3 for all N. 6. Show usig iductio for ay iteger ad x, y R that x + y x y. We defie for itegers ad the biomial coefficiet to be {!!! ad otherwise where factorial is! 2... 2 with!. Proof. Let x ad y be real umbers. Base step: Whe the left had side is x + y. The right had side is x y x y, so we ca see the equality is true whe. Iductive step: Let. We will assume that x + y x y. Our goal is to show that x + y + + + x y +. First ote that by the give defiitio of biomial coefficiets that + +. Also by the defiitio we have that! +! +! +!!!!!! + +! +!! +!! +! + +.

Usig our iductive assumptio ad the facts we established above we have x + y + x + y x + y x y x + y x + y + x y + + x y + + x y + x y + + x + y + x y + + x y + x y + + x y + + x y + + x + y x y + + x y + + x y + + x + y y + + + x y + + x + + + + x y + + x y + + x + y + + + + + x y +. Hece, by iductio x + y x y for all itegers. 7. The Triboacci umbers are defied as T, T 2, T 3, ad T T + T 2 + T 3 for > 3. Show that for all N that T 2. Proof. We will prove the statemet by iductig o. Base steps: Whe we have T which is less tha 2 2. Whe 2 we have T 2 ad 2 2. Whe 3 we have T 3 ad 2 3. Hece, the statemet is true for equal to, 2, ad 3. Iductive step: Let 3. We will assume for all positive itegers that T 2. Our goal is to show that T + 2 +. Usig our iductive hypotheses ad the defiitio of Triboacci umbers we have T + T + T + T 2 2 + 2 + 2 2 2 2 4 + 2 + 2 2 7 2 2 8 2 +. Hece, T + 2 +. This proves by iductio that T 2 for all positive itegers.

8. For N let B be the set of all -digit biary umbers. For example B 3 {,,,,,,, }. a Show that B 2. Proof. We will prove this by iductio o. First a small otatioal ote. If we have two biary words x ad y we will let xy deote their cocateatio. Meaig if x ad y the xy. Further this will mae x ad x. Base steps: Whe the set B {, } has cardiality 2 2. Thus, the statemet is true for. Iductive step: Let. We will assume that B 2 ad will show that B + 2 +. Let S {x B + : x starts with a } {x : x B } ad S {x B + : x starts with a } {x : x B }. Ay word i the set B + will start with a or start with a so S S B +. Sice a word caot both start with a ad a we ow S S. We ca see that S {x : x B } has the same umber of elemets as B so S B 2. Similarly, S {x : x B } has the same umber of elemets as B so S B 2. Fact: If a fiite set C ca be writte as a uio C A B with A B the C A + B. Sice S S B + ad S S we ow B + S + S 2 + 2 2 +. Hece, by iductio B 2 for all atural umbers. b Chapter : Questio 32 Prove that the umber of -digit biary umbers that have o cosecutive s is the Fiboacci umber F +2. Proof. We will use the set B ad the otatio defied for cocateatio of biary words itroduced i part a. We will let C {x B : x has o cosecutive s}. Our goal is to prove that C F +2 which we will prove by usig iductio o. Base steps: Whe the set C {, } has cardiality 2 F 3 F +2. Whe 2 the set C 2 {,, } has cardiality 3 F 4 F 2+2. Thus, the statemet is true for ad 2. Iductive step: Let 2. We will assume for all positive itegers that C F +2 ad will show that C + F ++2 F +3. Let R {x C + : x starts with a }. We will show that R {x : x C }. Let y R the certaily y x for some biary word x of legth. Sice y C + we ow y does ot have ay cosecutive s so x does t have ay cosecutive s so x C. Thus, y {x : x C } ad R {x : x C }. Let y {x : x C } the y x for some x C. Sice x has o cosecutive s ad puttig a at the frot of x does t create ay cosecutive s we ow y does t have ay cosecutive s, starts with a, ad has legth +. Hece, y R ad R {x : x C }. We ca see ow that R C F +2 by our iductive assumptio. Let R {x C + : x starts with a }.

We will show that R {x : x C }. Let y R the certaily y x for some biary word x of legth. Sice y C + we ow y does ot have ay cosecutive s meaig that the secod umber i the word y must be a else we have cosecutive s. Now we have y z for some z C which implies that y {x : x C } ad R {x : x C }. Say istead that y {x : x C }. The y x for some x C. Sice x has o cosecutive s ad placeig a before x does t create ay cosecutive s we ow y x has o cosecutive s, y starts with a, ad has legth +. Hece y R ad R {x : x C }. We ca see ow that R C F +2 F + by our iductive assumptio. Ay word i the set C + will start with a or start with a so R R C +. Sice a word caot both start with a ad a we ow R R. Fact: If a fiite set C ca be writte as a uio C A B with A B the C A + B. Sice R R C + ad R R we ow C + R + R F +2 + F + F +3. Hece, by iductio C F +2 for all atural umbers. c Use parts a ad b to show F +2 2 where F meas the th Fiboacci umber. Proof. We will use the same otatio for sets itroduced i parts a ad b. I part a we had B the collectio of all biary words legth ad B 2. I part b we had C the collectio of all biary words legth with o cosecutive s ad C F +2. Sice ay biary word of legth with o cosecutive s is a biary word legth we have C B for all atural umbers. Sice these are fiite sets their cardialities satisfy the iequality C B which implies that F +2 2 for all atural umbers.