Fibonacci Numbers. Justin Stevens. Lecture 5. Justin Stevens Fibonacci Numbers (Lecture 5) 1 / 10
|
|
- Walter James
- 5 years ago
- Views:
Transcription
1 Fibonacci Numbers Lecture 5 Justin Stevens Justin Stevens Fibonacci Numbers (Lecture 5) 1 / 10
2 Outline 1 Fibonacci Numbers Justin Stevens Fibonacci Numbers (Lecture 5) 2 / 10
3 Fibonacci Numbers The Fibonacci numbers show up in many unexpected situations and have many beautiful properties. We present a motivating example: Justin Stevens Fibonacci Numbers (Lecture 5) 3 / 10
4 Fibonacci Numbers The Fibonacci numbers show up in many unexpected situations and have many beautiful properties. We present a motivating example: Example. Consider a board of length n. How many ways are there to tile this board with squares (length 1) and dominos (length 2)? Justin Stevens Fibonacci Numbers (Lecture 5) 3 / 10
5 Fibonacci Numbers The Fibonacci numbers show up in many unexpected situations and have many beautiful properties. We present a motivating example: Example. Consider a board of length n. How many ways are there to tile this board with squares (length 1) and dominos (length 2)? Let the number of tilings of an n-board be f (n). Justin Stevens Fibonacci Numbers (Lecture 5) 3 / 10
6 Fibonacci Numbers The Fibonacci numbers show up in many unexpected situations and have many beautiful properties. We present a motivating example: Example. Consider a board of length n. How many ways are there to tile this board with squares (length 1) and dominos (length 2)? Let the number of tilings of an n-board be f (n). We calculate f (4): Table 1: The five tilings of a 4-board Hence f (4) = 5. For larger values of n, we need a different strategy. Justin Stevens Fibonacci Numbers (Lecture 5) 3 / 10
7 Fibonacci Numbers 2 Observe that if an n-board begins with a square, then we have to tile an n 1 board. However, if the n-board begins with a domino, then we have to tile an n 2 board. Justin Stevens Fibonacci Numbers (Lecture 5) 4 / 10
8 Fibonacci Numbers 2 Observe that if an n-board begins with a square, then we have to tile an n 1 board. However, if the n-board begins with a domino, then we have to tile an n 2 board. Therefore, f (n) = f (n 1) + f (n 2). Justin Stevens Fibonacci Numbers (Lecture 5) 4 / 10
9 Fibonacci Numbers 2 Observe that if an n-board begins with a square, then we have to tile an n 1 board. However, if the n-board begins with a domino, then we have to tile an n 2 board. Therefore, f (n) = f (n 1) + f (n 2). We see that f (1) = 1 and f (2) = 2, so we can compute: f (3) = f (2) + f (1) = = 3 f (4) = f (3) + f (2) = = 5 f (5) = f (4) + f (3) = = 8. Justin Stevens Fibonacci Numbers (Lecture 5) 4 / 10
10 Fibonacci Numbers 2 Observe that if an n-board begins with a square, then we have to tile an n 1 board. However, if the n-board begins with a domino, then we have to tile an n 2 board. Therefore, f (n) = f (n 1) + f (n 2). We see that f (1) = 1 and f (2) = 2, so we can compute: f (3) = f (2) + f (1) = = 3 f (4) = f (3) + f (2) = = 5 f (5) = f (4) + f (3) = = 8. The only difference between this and the Fibonacci numbers are that the latter begins with an extra 1. Therefore, f (n) = F n+1. Using this n-tiling, we can prove several identities regarding Fibonacci numbers. Justin Stevens Fibonacci Numbers (Lecture 5) 4 / 10
11 Property Example. Show that f (m + n) = f (m)f (n) + f (m 1)f (n 1). Justin Stevens Fibonacci Numbers (Lecture 5) 5 / 10
12 Property Example. Show that f (m + n) = f (m)f (n) + f (m 1)f (n 1). The left-hand side is simply the number of tilings of an (m + n)-board. Justin Stevens Fibonacci Numbers (Lecture 5) 5 / 10
13 Property Example. Show that f (m + n) = f (m)f (n) + f (m 1)f (n 1). The left-hand side is simply the number of tilings of an (m + n)-board. For the right-hand side, we have two cases: Justin Stevens Fibonacci Numbers (Lecture 5) 5 / 10
14 Property Example. Show that f (m + n) = f (m)f (n) + f (m 1)f (n 1). The left-hand side is simply the number of tilings of an (m + n)-board. For the right-hand side, we have two cases: If there is no domino at square m, we have f (m)f (n) tilings: 1 2 m 1 m m + 1 m + 2 m + n Justin Stevens Fibonacci Numbers (Lecture 5) 5 / 10
15 Sum Property If there is a domino at square m, we have f (m 1)f (n 1) tilings: 1 2 m 1 m m + 1 m + 2 m + 3 m + n Hence, f (m + n) = f (m)f (n) + f (m 1)f (n 1) as desired. Justin Stevens Fibonacci Numbers (Lecture 5) 6 / 10
16 Sum Property If there is a domino at square m, we have f (m 1)f (n 1) tilings: 1 2 m 1 m m + 1 m + 2 m + 3 m + n Hence, f (m + n) = f (m)f (n) + f (m 1)f (n 1) as desired. Substituting m = a and n = b 1 gives the Fibonacci identity F a+b = F a+1 F b + F a F b 1. Justin Stevens Fibonacci Numbers (Lecture 5) 6 / 10
17 Fibonacci Divisibility Example. Prove that F m F mq for all natural q. Justin Stevens Fibonacci Numbers (Lecture 5) 7 / 10
18 Fibonacci Divisibility Example. Prove that F m F mq for all natural q. We use induction. For q = 1, F m F m. For q = 2, F 2m = F m+1 F m + F m F m 1. Justin Stevens Fibonacci Numbers (Lecture 5) 7 / 10
19 Fibonacci Divisibility Example. Prove that F m F mq for all natural q. We use induction. For q = 1, F m F m. For q = 2, F 2m = F m+1 F m + F m F m 1. Suppose the statement is true for q = k, implying that F m F mk. Justin Stevens Fibonacci Numbers (Lecture 5) 7 / 10
20 Fibonacci Divisibility Example. Prove that F m F mq for all natural q. We use induction. For q = 1, F m F m. For q = 2, F 2m = F m+1 F m + F m F m 1. Suppose the statement is true for q = k, implying that F m F mk. We show it holds for q = k + 1. From the identity with a = mk and b = m: F mk+m = F mk+1 F m + F mk F m 1. Justin Stevens Fibonacci Numbers (Lecture 5) 7 / 10
21 Fibonacci Divisibility Example. Prove that F m F mq for all natural q. We use induction. For q = 1, F m F m. For q = 2, F 2m = F m+1 F m + F m F m 1. Suppose the statement is true for q = k, implying that F m F mk. We show it holds for q = k + 1. From the identity with a = mk and b = m: F mk+m = F mk+1 F m + F mk F m 1. Since F m F mk (hypothesis), F m F mk+m by the linear combination theorem. Hence, the statement is proven for q = k + 1. Justin Stevens Fibonacci Numbers (Lecture 5) 7 / 10
22 Consecutive Fibonacci Numbers Example. Show that consecutive Fibonacci numbers are relatively prime. Justin Stevens Fibonacci Numbers (Lecture 5) 8 / 10
23 Consecutive Fibonacci Numbers Example. Show that consecutive Fibonacci numbers are relatively prime. Proof. gcd(f n+2, F n+1 ) = gcd(f n+1, F n ) = gcd(f n, F n 1 ) = = gcd(f 2, F 1 ) = 1. Justin Stevens Fibonacci Numbers (Lecture 5) 8 / 10
24 Fibonacci GCD Example. Show that gcd(f m, F n ) = F gcd(m,n). Write m = nq + r using the division algorithm. Using the Fibonacci identity, Justin Stevens Fibonacci Numbers (Lecture 5) 9 / 10
25 Fibonacci GCD Example. Show that gcd(f m, F n ) = F gcd(m,n). Write m = nq + r using the division algorithm. Using the Fibonacci identity, F m = F nq+r = F nq+1 F r + F nq F r 1. Justin Stevens Fibonacci Numbers (Lecture 5) 9 / 10
26 Fibonacci GCD Example. Show that gcd(f m, F n ) = F gcd(m,n). Write m = nq + r using the division algorithm. Using the Fibonacci identity, F m = F nq+r = F nq+1 F r + F nq F r 1. Since F n F nq, we can subtract multiples of F n using Euclidean algorithm: gcd(f m, F n ) = gcd(f nq+1 F r + F nq F r 1, F n ) = gcd(f nq+1 F r, F n ). Justin Stevens Fibonacci Numbers (Lecture 5) 9 / 10
27 Fibonacci GCD Example. Show that gcd(f m, F n ) = F gcd(m,n). Write m = nq + r using the division algorithm. Using the Fibonacci identity, F m = F nq+r = F nq+1 F r + F nq F r 1. Since F n F nq, we can subtract multiples of F n using Euclidean algorithm: gcd(f m, F n ) = gcd(f nq+1 F r + F nq F r 1, F n ) = gcd(f nq+1 F r, F n ). Finally, gcd(f nq+1, F n ) = 1 since consecutive Fibonacci numbers are relatively prime: gcd(f m, F n ) = gcd(f r, F n ). Justin Stevens Fibonacci Numbers (Lecture 5) 9 / 10
28 Fibonacci GCD Example. Show that gcd(f m, F n ) = F gcd(m,n). Write m = nq + r using the division algorithm. Using the Fibonacci identity, F m = F nq+r = F nq+1 F r + F nq F r 1. Since F n F nq, we can subtract multiples of F n using Euclidean algorithm: gcd(f m, F n ) = gcd(f nq+1 F r + F nq F r 1, F n ) = gcd(f nq+1 F r, F n ). Finally, gcd(f nq+1, F n ) = 1 since consecutive Fibonacci numbers are relatively prime: gcd(f m, F n ) = gcd(f r, F n ). For example, if m = 182 and n = 65, gcd(182, 65) = 13 and gcd(f 182, F 65 ) = gcd(f 65, F 52 ) = gcd(f 52, F 13 ) = F 13. Justin Stevens Fibonacci Numbers (Lecture 5) 9 / 10
29 Fibonacci GCD Example. Show that gcd(f m, F n ) = F gcd(m,n). Write m = nq + r using the division algorithm. Using the Fibonacci identity, F m = F nq+r = F nq+1 F r + F nq F r 1. Since F n F nq, we can subtract multiples of F n using Euclidean algorithm: gcd(f m, F n ) = gcd(f nq+1 F r + F nq F r 1, F n ) = gcd(f nq+1 F r, F n ). Finally, gcd(f nq+1, F n ) = 1 since consecutive Fibonacci numbers are relatively prime: gcd(f m, F n ) = gcd(f r, F n ). For example, if m = 182 and n = 65, gcd(182, 65) = 13 and gcd(f 182, F 65 ) = gcd(f 65, F 52 ) = gcd(f 52, F 13 ) = F 13. The conclusion is equivalent to gcd(f m, F n ) = F gcd(m,n). Justin Stevens Fibonacci Numbers (Lecture 5) 9 / 10
30 Other Properties The below properties can all be proved using the tiling method: F 1 + F 2 + F F n = F n+2 1. F 1 + F 3 + F F 2n 1 = F 2n. F1 2 + F F F n 2 = F n F n+1. F n+1 = ( n) ( 0 + n 1 ) ( 1 + n 2 ) 2 +. Try them out yourself! Justin Stevens Fibonacci Numbers (Lecture 5) 10 / 10
Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationChapter 5.1: Induction
Chapter.1: Induction Monday, July 1 Fermat s Little Theorem Evaluate the following: 1. 1 (mod ) 1 ( ) 1 1 (mod ). (mod 7) ( ) 8 ) 1 8 1 (mod ). 77 (mod 19). 18 (mod 1) 77 ( 18 ) 1 1 (mod 19) 18 1 (mod
More informationThe Euclidean Algorithm
MATH 324 Summer 2006 Elementary Number Theory Notes on the Euclidean Algorithm Department of Mathematical and Statistical Sciences University of Alberta The Euclidean Algorithm Given two positive integers
More informationMathematical Induction
Mathematical Induction Let s motivate our discussion by considering an example first. What happens when we add the first n positive odd integers? The table below shows what results for the first few values
More informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationCS 220: Discrete Structures and their Applications. Mathematical Induction in zybooks
CS 220: Discrete Structures and their Applications Mathematical Induction 6.4 6.6 in zybooks Why induction? Prove algorithm correctness (CS320 is full of it) The inductive proof will sometimes point out
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationLecture 3.2: Induction, and Strong Induction
Lecture 3.2: Induction, and Strong Induction CS 250, Discrete Structures, Fall 2015 Nitesh Saxena Adopted from previous lectures by Cinda Heeren, Zeph Grunschlag Course Admin Mid-Term 1 Graded; to be returned
More informationFall 2017 Test II review problems
Fall 2017 Test II review problems Dr. Holmes October 18, 2017 This is a quite miscellaneous grab bag of relevant problems from old tests. Some are certainly repeated. 1. Give the complete addition and
More informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationMathematical Induction
Mathematical Induction MAT30 Discrete Mathematics Fall 018 MAT30 (Discrete Math) Mathematical Induction Fall 018 1 / 19 Outline 1 Mathematical Induction Strong Mathematical Induction MAT30 (Discrete Math)
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationNotes 6: Polynomials in One Variable
Notes 6: Polynomials in One Variable Definition. Let f(x) = b 0 x n + b x n + + b n be a polynomial of degree n, so b 0 0. The leading term of f is LT (f) = b 0 x n. We begin by analyzing the long division
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 4 1 Principle of Mathematical Induction 2 Example 3 Base Case 4 Inductive Hypothesis 5 Inductive Step When Induction Isn t Enough
More informationOlympiad Number Theory Through Challenging Problems
Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister. Justin Contents
More information12 Sequences and Recurrences
12 Sequences and Recurrences A sequence is just what you think it is. It is often given by a formula known as a recurrence equation. 12.1 Arithmetic and Geometric Progressions An arithmetic progression
More information2301 Assignment 1 Due Friday 19th March, 2 pm
Show all your work. Justify your solutions. Answers without justification will not receive full marks. Only hand in the problems on page 2. Practice Problems Question 1. Prove that if a b and a 3c then
More informationQuiz 1, Mon CS 2050, Intro Discrete Math for Computer Science
Quiz 1, Mon 09-6-11 CS 050, Intro Discrete Math for Computer Science This quiz has 10 pages (including this cover page) and 5 Problems: Problems 1,, 3 and 4 are mandatory ( pages each.) Problem 5 is optional,
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationMathematical Induction
Mathematical Induction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Mathematical Induction Fall 2014 1 / 21 Outline 1 Mathematical Induction 2 Strong Mathematical
More informationWriting Assignment 2 Student Sample Questions
Writing Assignment 2 Student Sample Questions 1. Let P and Q be statements. Then the statement (P = Q) ( P Q) is a tautology. 2. The statement If the sun rises from the west, then I ll get out of the bed.
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationPROBLEM SET 1 SOLUTIONS 1287 = , 403 = , 78 = 13 6.
Math 7 Spring 06 PROBLEM SET SOLUTIONS. (a) ( pts) Use the Euclidean algorithm to find gcd(87, 0). Solution. The Euclidean algorithm is performed as follows: 87 = 0 + 78, 0 = 78 +, 78 = 6. Hence we have
More informationLinear Algebra III Lecture 11
Linear Algebra III Lecture 11 Xi Chen 1 1 University of Alberta February 13, 2015 Outline Minimal Polynomial 1 Minimal Polynomial Minimal Polynomial The minimal polynomial f (x) of a square matrix A is
More informationMAS114: Solutions to Exercises
MAS114: s to Exercises Up to week 8 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.
More informationEvery subset of {1, 2,...,n 1} can be extended to a subset of {1, 2, 3,...,n} by either adding or not adding the element n.
11 Recurrences A recurrence equation or recurrence counts things using recursion. 11.1 Recurrence Equations We start with an example. Example 11.1. Find a recurrence for S(n), the number of subsets of
More information12x + 18y = 50. 2x + v = 12. (x, v) = (6 + k, 2k), k Z.
Math 3, Fall 010 Assignment 3 Solutions Exercise 1. Find all the integral solutions of the following linear diophantine equations. Be sure to justify your answers. (i) 3x + y = 7. (ii) 1x + 18y = 50. (iii)
More informationInput Decidable Language -- Program Halts on all Input Encoding of Input -- Natural Numbers Encoded in Binary or Decimal, Not Unary
Complexity Analysis Complexity Theory Input Decidable Language -- Program Halts on all Input Encoding of Input -- Natural Numbers Encoded in Binary or Decimal, Not Unary Output TRUE or FALSE Time and Space
More informationTILING PROOFS OF SOME FIBONACCI-LUCAS RELATIONS. Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN , USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A18 TILING PROOFS OF SOME FIBONACCI-LUCAS RELATIONS Mark Shattuck Department of Mathematics, University of Tennessee, Knoxville, TN
More information1.1 Inductive Reasoning filled in.notebook August 20, 2015
1.1 Inductive Reasoning 1 Vocabulary Natural or Counting Numbers Ellipsis Scientific Method Hypothesis or Conjecture Counterexample 2 Vocabulary Natural or Counting Numbers 1, 2, 3, 4, 5... positive whole
More informationNotes for Recitation 6
6.042/18.062J Mathematics for Computer Science February 18, 2005 Srini Devadas and Eric Lehman Notes for Recitation 6 1 The Pulverizer We saw in lecture that the greatest common divisor (GCD) of two numbers
More informationName: Mathematics 1C03
Name: Student ID Number: Mathematics 1C03 Day Class Instructor: M. Harada Duration: 2.5 hours April 2018 McMaster University PRACTICE Final Examination This is a PRACTICE final exam. The actual final exam
More informationSum of Squares. Defining Functions. Closed-Form Expression for SQ(n)
CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 22: Induction Overview Recursion A programming strategy that solves a problem by reducing it to simpler
More informationMAS114: Exercises. October 26, 2018
MAS114: Exercises October 26, 2018 Note that the challenge problems are intended to be difficult! Doing any of them is an achievement. Please hand them in on a separate piece of paper if you attempt them.
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationAnnouncements. Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Existence Proofs. Non-constructive
Announcements Homework 2 Due Homework 3 Posted Due next Monday Quiz 2 on Wednesday Read Section 2.1 (Sets), 2.2 (Set Operations) and 5.1 (Mathematical Induction) Exam 1 in two weeks Monday, February 19
More information21 Induction. Tom Lewis. Fall Term Tom Lewis () 21 Induction Fall Term / 14
21 Induction Tom Lewis Fall Term 2010 Tom Lewis () 21 Induction Fall Term 2010 1 / 14 Outline 1 The method of induction 2 Strong mathematical induction Tom Lewis () 21 Induction Fall Term 2010 2 / 14 Pessimists
More informationRecursive Definitions. Recursive Definition A definition is called recursive if the object is defined in terms of itself.
Recursion Recursive Definitions Recursive Definition A definition is called recursive if the object is defined in terms of itself. Base Case Recursive definitions require a base case at which to either
More informationRecursive Definitions. Recursive Definition A definition is called recursive if the object is defined in terms of itself.
Recursion Recursive Definitions Recursive Definition A definition is called recursive if the object is defined in terms of itself. Base Case Recursive definitions require a base case at which to either
More informationDivisibility properties of Fibonacci numbers
South Asian Journal of Mathematics 2011, Vol. 1 ( 3 ) : 140 144 www.sajm-online.com ISSN 2251-1512 RESEARCH ARTICLE Divisibility properties of Fibonacci numbers K. Raja Rama GANDHI 1 1 Department of Mathematics,
More informationINDUCTION AND RECURSION. Lecture 7 - Ch. 4
INDUCTION AND RECURSION Lecture 7 - Ch. 4 4. Introduction Any mathematical statements assert that a property is true for all positive integers Examples: for every positive integer n: n!
More informationIntroduction to Cryptology. Lecture 19
Introduction to Cryptology Lecture 19 Announcements HW6 due today HW7 due Thursday 4/20 Remember to sign up for Extra Credit Agenda Last time More details on AES/DES (K/L 6.2) Practical Constructions of
More informationNumber Theory Proof Portfolio
Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by
More informationInduction and Recursion
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Induction and Recursion
More informationCOM S 330 Lecture Notes Week of Feb 9 13
Monday, February 9. Rosen.4 Sequences Reading: Rosen.4. LLM 4.. Ducks 8., 8., Def: A sequence is a function from a (usually infinite) subset of the integers (usually N = {0,,, 3,... } or Z + = {,, 3, 4,...
More informationMATH 501 Discrete Mathematics. Lecture 6: Number theory. German University Cairo, Department of Media Engineering and Technology.
MATH 501 Discrete Mathematics Lecture 6: Number theory Prof. Dr. Slim Abdennadher, slim.abdennadher@guc.edu.eg German University Cairo, Department of Media Engineering and Technology 1 Number theory Number
More informationGrade 7/8 Math Circles. Continued Fractions
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing A Fraction of our History Grade 7/8 Math Circles October th /2 th Continued Fractions Love it or hate it,
More information9 MODULARITY AND GCD PROPERTIES OF GENERALIZED FIBONACCI NUMBERS
#A55 INTEGERS 14 (2014) 9 MODULARITY AND GCD PROPERTIES OF GENERALIZED FIBONACCI NUMBERS Rigoberto Flórez 1 Department of Mathematics and Computer Science, The Citadel, Charleston, South Carolina rigo.florez@citadel.edu
More informationExam 2 Solutions. In class questions
Math 5330 Spring 2018 Exam 2 Solutions In class questions 1. (15 points) Solve the following congruences. Put your answer in the form of a congruence. I usually find it easier to go from largest to smallest
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: Rule of Inference Mathematical Induction: Conjecturing and Proving Mathematical Induction:
More informationChapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms
1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of
More informationOutline. We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction
Outline We will cover (over the next few weeks) Induction Strong Induction Constructive Induction Structural Induction Induction P(1) ( n 2)[P(n 1) P(n)] ( n 1)[P(n)] Why Does This Work? I P(1) ( n 2)[P(n
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationInduction and recursion. Chapter 5
Induction and recursion Chapter 5 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms Mathematical Induction Section 5.1
More informationCHARACTERIZATION OF THE STRONG DIVISIBILITY PROPERTY FOR GENERALIZED FIBONACCI POLYNOMIALS
#A14 INTEGERS 18 (2018) CHARACTERIZATION OF THE STRONG DIVISIBILITY PROPERTY FOR GENERALIZED FIBONACCI POLYNOMIALS Rigoberto Flórez 1 Department of Mathematics and Computer Science, The Citadel, Charleston,
More informationWollongong College Australia
Wollongong College Australia University of Wollongong Diploma in Information Technology WUCT121 Discrete Mathematics Mid-Term Test #2 Autumn Session 2008 SOLUTIONS Time Allowed: 50 minutes DIRECTIONS TO
More informationLecture 7 Feb 4, 14. Sections 1.7 and 1.8 Some problems from Sec 1.8
Lecture 7 Feb 4, 14 Sections 1.7 and 1.8 Some problems from Sec 1.8 Section Summary Proof by Cases Existence Proofs Constructive Nonconstructive Disproof by Counterexample Nonexistence Proofs Uniqueness
More informationMa/CS 6a Class 2: Congruences
Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts
More informationDRAFT (Justin Stevens) Updated December 29, 2017
Intermediate Number Theory Justin Stevens FOURTH EDITION Mathematics is the queen of sciences and number theory is the queen of mathematics. Carl Friedrich Gauss c 017 Justin Stevens. All rights reserved.
More information1.2 The Well-Ordering Principle
36 Chapter 1. The Integers Exercises 1.1 1. Prove the following theorem: Theorem. Let m and a be integers. If m a and a m, thenm = ±a. 2. Prove the following theorem: Theorem. For all integers a, b and
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationNumber Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some. Notation: b Fact: for all, b, c Z:
Number Theory Basics Z = {..., 2, 1, 0, 1, 2,...} For, b Z, we say that divides b if z = b for some z Z Notation: b Fact: for all, b, c Z:, 1, and 0 0 = 0 b and b c = c b and c = (b + c) b and b = ±b 1
More informationChuck Garner, Ph.D. May 25, 2009 / Georgia ARML Practice
Some Chuck, Ph.D. Department of Mathematics Rockdale Magnet School for Science Technology May 25, 2009 / Georgia ARML Practice Outline 1 2 3 4 Outline 1 2 3 4 Warm-Up Problem Problem Find all positive
More informationNOTES ON INTEGERS. 1. Integers
NOTES ON INTEGERS STEVEN DALE CUTKOSKY The integers 1. Integers Z = {, 3, 2, 1, 0, 1, 2, 3, } have addition and multiplication which satisfy familar rules. They are ordered (m < n if m is less than n).
More informationDiscrete Mathematics. Spring 2017
Discrete Mathematics Spring 2017 Previous Lecture Principle of Mathematical Induction Mathematical Induction: rule of inference Mathematical Induction: Conjecturing and Proving Climbing an Infinite Ladder
More informationCSC 344 Algorithms and Complexity. Proof by Mathematical Induction
CSC 344 Algorithms and Complexity Lecture #1 Review of Mathematical Induction Proof by Mathematical Induction Many results in mathematics are claimed true for every positive integer. Any of these results
More informationMathematical Induction. Rosen Chapter 4.1,4.2 (6 th edition) Rosen Ch. 5.1, 5.2 (7 th edition)
Mathematical Induction Rosen Chapter 4.1,4.2 (6 th edition) Rosen Ch. 5.1, 5.2 (7 th edition) Motivation Suppose we want to prove that for every value of n: 1 + 2 + + n = n(n + 1)/2. Let P(n) be the predicate
More informationIntroduction to Number Theory. The study of the integers
Introduction to Number Theory The study of the integers of Integers, The set of integers = {... 3, 2, 1, 0, 1, 2, 3,...}. In this lecture, if nothing is said about a variable, it is an integer. Def. We
More informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationMath Circle at FAU 10/27/2018 SOLUTIONS
Math Circle at FAU 10/27/2018 SOLUTIONS 1. At the grocery store last week, small boxes of facial tissue were priced at 4 boxes for $5. This week they are on sale at 5 boxes for $4. Find the percent decrease
More informationSolutions to Practice Final 3
s to Practice Final 1. The Fibonacci sequence is the sequence of numbers F (1), F (2),... defined by the following recurrence relations: F (1) = 1, F (2) = 1, F (n) = F (n 1) + F (n 2) for all n > 2. For
More informationDiophantine triples in a Lucas-Lehmer sequence
Annales Mathematicae et Informaticae 49 (01) pp. 5 100 doi: 10.33039/ami.01.0.001 http://ami.uni-eszterhazy.hu Diophantine triples in a Lucas-Lehmer sequence Krisztián Gueth Lorand Eötvös University Savaria
More informationOlympiad Number Theory Through Challenging Problems
Olympiad Number Theory Justin Stevens Page 1 Olympiad Number Theory Through Challenging Problems Authors Justin Stevens Editor and L A TEX Manager David Altizio Dedicated to my sister Justin Contents 0
More informationHW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).
Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately
More informationMat Week 8. Week 8. gcd() Mat Bases. Integers & Computers. Linear Combos. Week 8. Induction Proofs. Fall 2013
Fall 2013 Student Responsibilities Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Proof Worksheets Attendance: Strongly Encouraged Overview 3.6 Integers and Algorithms 3.7
More informationStudent Responsibilities Week 8. Mat Section 3.6 Integers and Algorithms. Algorithm to Find gcd()
Student Responsibilities Week 8 Mat 2345 Week 8 Reading: Textbook, Section 3.7, 4.1, & 5.2 Assignments: Sections 3.6, 3.7, 4.1 Induction Proof Worksheets Attendance: Strongly Encouraged Fall 2013 Week
More informationLecture Notes. Advanced Discrete Structures COT S
Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section
More informationAppendix G: Mathematical Induction
Appendix G: 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
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More informationMath 13, Spring 2013, Lecture B: Midterm
Math 13, Spring 2013, Lecture B: Midterm Name Signature UCI ID # E-mail address Each numbered problem is worth 12 points, for a total of 84 points. Present your work, especially proofs, as clearly as possible.
More information(e) Commutativity: a b = b a. (f) Distributivity of times over plus: a (b + c) = a b + a c and (b + c) a = b a + c a.
Math 299 Midterm 2 Review Nov 4, 2013 Midterm Exam 2: Thu Nov 7, in Recitation class 5:00 6:20pm, Wells A-201. Topics 1. Methods of proof (can be combined) (a) Direct proof (b) Proof by cases (c) Proof
More informationMath 31 Lesson Plan. Day 2: Sets; Binary Operations. Elizabeth Gillaspy. September 23, 2011
Math 31 Lesson Plan Day 2: Sets; Binary Operations Elizabeth Gillaspy September 23, 2011 Supplies needed: 30 worksheets. Scratch paper? Sign in sheet Goals for myself: Tell them what you re going to tell
More informationModular Arithmetic (Read Sections 4.1 thro 4.4)
Modular Arithmetic (Read Sections 4.1 thro 4.4) Set of all integers Set of positive integers less than m We want to perform arithmetic in Z m Equivalence Classes Say m = 5 Z m ={0,1,2,3,... m 1} EC of
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Midterm 1 Thursday July 17, 2014, 12:40pm-2:00pm. Instructions: Do not turn over this page until the proctor tells you to. Don t
More informationMa/CS 6a Class 2: Congruences
Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts
More informationAlgorithm Complexity Comparison between Methods Factorization and Euclidean Algorithm to Find the Greatest Common Divisor
Algorithm Complexity Comparison between Methods Factorization and Euclidean Algorithm to Find the Greatest Common Divisor Saskia Imani 1351714 Program Studi Teknik Informatika Sekolah Teknik Elektro dan
More informationConjectures and proof. Book page 24-30
Conjectures and proof Book page 24-30 What is a conjecture? A conjecture is used to describe a pattern in mathematical terms When a conjecture has been proved, it becomes a theorem There are many types
More informationMathematical Induction
Chapter 6 Mathematical Induction 6.1 The Process of Mathematical Induction 6.1.1 Motivating Mathematical Induction Consider the sum of the first several odd integers. produce the following: 1 = 1 1 + 3
More information5: The Integers (An introduction to Number Theory)
c Oksana Shatalov, Spring 2017 1 5: The Integers (An introduction to Number Theory) The Well Ordering Principle: Every nonempty subset on Z + has a smallest element; that is, if S is a nonempty subset
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationMATHEMATICAL INDUCTION
MATHEMATICAL INDUCTION MATH 3A SECTION HANDOUT BY GERARDO CON DIAZ Imagine a bunch of dominoes on a table. They are set up in a straight line, and you are about to push the first piece to set off the chain
More informationThe Euclidean Algorithm and Multiplicative Inverses
1 The Euclidean Algorithm and Multiplicative Inverses Lecture notes for Access 2009 The Euclidean Algorithm is a set of instructions for finding the greatest common divisor of any two positive integers.
More informationFIBONACCI NUMBER AND ITS DISTRIBUTION MODULO 3 k
FIBONACCI NUMBER AND ITS DISTRIBUTION MODULO 3 k A Project Report submitted by Partial Fulfilment of the Requirements for the Degree of MASTER OF SCIENCE in MATHEMATICS by Rajesh Bishi (Roll Number: 411MA2071)
More information3 - Induction and Recursion
November 14, 2017 3 - Induction and Recursion William T. Trotter trotter@math.gatech.edu Using Recurrence Equations (1) Basic Problem How many regions are determined by n lines that intersect in general
More informationFunctional Programming Laboratory 3
Functional Programming Laboratory 3 Define new functions, Recursion Isabela Drămnesc March 12, 2014 1 Concepts Bound and free variables Recursive functions Simple and double recursion 2 Questions from
More informationAll variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points.
Math 152, Problem Set 2 solutions (2018-01-24) All variables a, b, n, etc are integers unless otherwise stated. Each part of a problem is worth 5 points. 1. Let us look at the following equation: x 5 1
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 3
EECS 70 Discrete Mathematics and Probability Theory Spring 014 Anant Sahai Note 3 Induction Induction is an extremely powerful tool in mathematics. It is a way of proving propositions that hold for all
More informationCounting on Chebyshev Polynomials
DRAFT VOL. 8, NO., APRIL 009 1 Counting on Chebyshev Polynomials Arthur T. Benjamin Harvey Mudd College Claremont, CA 91711 benjamin@hmc.edu Daniel Walton UCLA Los Angeles, CA 90095555 waltond@ucla.edu
More information