Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
|
|
- Daisy Nicholson
- 5 years ago
- Views:
Transcription
1 Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006
2 Fibonacci Numbers F n+2 = F n+1 + F n n F n n F n n F n n F n
3 Lucas Numbers L n+2 = L n+1 + L n n L n n L n n L n n L n
4 Fundamental Questions Is there a formula for the n th Fibonacci number? Which Fibonacci numbers divide other Fibonacci numbers? Which primes divide the Fibonacci numbers? What is the entry point for each prime? What about the Lucas numbers?
5 Guess: F n = r n for some r. Recurrence Relations F n+2 = F n+1 + F n
6 Recurrence Relations Guess: F n = r n for some r. F n+2 = F n+1 + F n r n+2 = r n+1 + r n r n (r 2 r 1)=0
7 Recurrence Relations Guess: F n = r n for some r. F n+2 = F n+1 + F n r n+2 = r n+1 + r n r n (r 2 r 1)=0 r 1 =φ= 1+ 2 r 2 =φ = 1 2 = =
8 Recurrence Relations Guess: F n = r n for some r. F n+2 = F n+1 + F n r n+2 = r n+1 + r n r n (r 2 r 1)=0 r 1 =φ= 1+ 2 r 2 =φ = 1 2 = = φ φ = 1 φ n =F n φ+f n 1
9 Binet s Formula General Solution: F n = c 1 r n 1 + c 2 r n 2
10 Binet s Formula General Solution: F n = c 1 r n 1 + c 2 r n 2 F 0 =0,F 1 =1 = c 1 = 1,c 2 = 1 F n = 1 ( φ n φ n)
11 Binet s Formula General Solution: F n = c 1 r n 1 + c 2 r n 2 F 0 =0,F 1 =1 = c 1 = 1,c 2 = 1 F n = 1 ( φ n φ n) L 0 =2,L 1 =1 = c 1 =1,c 2 =1 L n =φ n +φ n
12 Generating Functions F n x n = n=0 x 1 x x 2
13 Generating Functions F n x n = n=0 = x 1 x x 2 x (1 φx)(1 φ x)
14 F n x n = n=0 Generating Functions = x 1 x x 2 x (1 φx)(1 φ x) = φx φ x
15 F n x n = n=0 Generating Functions x 1 x x 2 x = (1 φx)(1 φ x) = φx φ x = 1 n=0 (φx) n 1 n=0 (φ x) n
16 F n x n = n=0 Generating Functions x 1 x x 2 x = (1 φx)(1 φ x) = φx φ x = 1 = n=0 n=0 (φx) n 1 1 ( φ n φ n) x n n=0 (φ x) n
17 Consequences lim n F n+1 F n = lim n L n+1 L n = φ
18 Consequences lim n F n+1 F n = lim n L n+1 L n = φ lim n L n F n =
19 Consequences lim n F n+1 F n = lim n L n+1 L n = φ lim n L n F n = F 2n = F n L n
20 Consequences lim n F n+1 F n = lim n L n+1 L n = φ lim n L n F n = ( Proof. F 2n = F n L n 1 ( φ 2n φ 2n) = 1 ( φ n φ n) (φ n + φ n))
21 F n = F n 1 + F n 2 Super Cool Formula
22 Super Cool Formula F n = F n 1 + F n 2 =(F n 2 +F n 3 )+F n 2 =2F n 2 +1F n 3
23 Super Cool Formula F n = F n 1 + F n 2 =(F n 2 +F n 3 )+F n 2 =2(F n 3 +F n 4 )+F n 3 =2F n 2 +1F n 3 =3F n 3 +2F n 4
24 Super Cool Formula F n = F n 1 + F n 2 =(F n 2 +F n 3 )+F n 2 =2(F n 3 +F n 4 )+F n 3 =2F n 2 +1F n 3 =3F n 3 +2F n 4 =3(F n 4 +F n )+2F n 4 =F n 4 +3F n
25 Super Cool Formula F n = F n 1 + F n 2 =(F n 2 +F n 3 )+F n 2 =2(F n 3 +F n 4 )+F n 3 =2F n 2 +1F n 3 =3F n 3 +2F n 4 =3(F n 4 +F n )+2F n 4 =F n 4 +3F n F m+n =F m F n+1 + F m 1 F n L m+n = F m L n+1 + F m 1 L n
26 Theorem. F n divides F kn for all integers k.
27 Theorem. F n divides F kn for all integers k. Proof. F n divides F n, so the theorem is true for k =1. Suppose F n divides F kn. Then F (k+1)n = F kn F n+1 + F kn 1 F n is also divisible by F n. By induction, the theorem is true for all k!
28 Theorem. F n divides F kn for all integers k. Proof. F n divides F n, so the theorem is true for k =1. Suppose F n divides F kn. Then F (k+1)n = F kn F n+1 + F kn 1 F n is also divisible by F n. By induction, the theorem is true for all k! Theorem. L n divides L kn for all odd integers k.
29 Theorem. F n divides F kn for all integers k. Proof. F n divides F n, so the theorem is true for k =1. Suppose F n divides F kn. Then F (k+1)n = F kn F n+1 + F kn 1 F n is also divisible by F n. By induction, the theorem is true for all k! Theorem. L n divides L kn for all odd integers k. Proof. Same proof, except L (2l+1)n = F 2ln L n+1 + F 2ln 1 L n and L n divides F 2n, which in turn divides F 2ln.
30 Greatest Common Divisors Theorem. gcd(f m,f n )=F gcd(m,n). Ex: gcd(144, 284) = 8.
31 Greatest Common Divisors Theorem. gcd(f m,f n )=F gcd(m,n). Ex: gcd(144, 284) = 8. Proof. Let d = gcd(m, n). By the previous theorem, F d divides F m and F n. Thus, F d divides gcd(f m,f n ).
32 Greatest Common Divisors Theorem. gcd(f m,f n )=F gcd(m,n). Ex: gcd(144, 284) = 8. Proof. Let d = gcd(m, n). By the previous theorem, F d divides F m and F n. Thus, F d divides gcd(f m,f n ). d may be written as am + bn for some integers a and b. Then F d = F am+bn = F am F bn+1 + F am 1 F bn Since F m divides F am and F n divides F bn, F d can be written as a linear combination of F m and F n. Hence, gcd(f m,f n ) divides F d.
33 Question: Which Fibonacci numbers divide other Fibonacci numbers? Answer: F n divides F m if and only if n divides m.
34 Question: Which Fibonacci numbers divide other Fibonacci numbers? Answer: F n divides F m if and only if n divides m. For example, the Fibonacci numbers which divide F 30 = are F 3 =2,F =,F 6 =8,F 10 =, and F 1 = 610.
35 Question: Which Fibonacci numbers divide other Fibonacci numbers? Answer: F n divides F m if and only if n divides m. For example, the Fibonacci numbers which divide F 30 = are F 3 =2,F =,F 6 =8,F 10 =, and F 1 = 610. In order for F n to be prime, n must be prime. The converse is not true, since F 19 =4181=
36 Prime Divisibility Question: Which primes divide the Fibonacci numbers?
37 Prime Divisibility Question: Which primes divide the Fibonacci numbers? Answer: All of them! If p, then p divides either F p 1 or F p+1.
38 Prime Divisibility Question: Which primes divide the Fibonacci numbers? Answer: All of them! If p, then p divides either F p 1 or F p+1. For example, 7 divides F 8 = 21 and 11 divides F 10 =. Note that F = is the only exception.
39 Lemma. φ p φ (mod p) if p 1, 4 (mod ) φ (mod p) if p 2, 3 (mod )
40 Lemma. φ p φ (mod p) if p 1, 4 (mod ) φ (mod p) if p 2, 3 (mod ) Proof. φ p = 1 2 p ( 1+ ) p
41 Lemma. φ p φ (mod p) if p 1, 4 (mod ) φ (mod p) if p 2, 3 (mod ) Proof. φ p = 1 2 p ( 1+ ) p = 1 ( 1+ ( ) ( p + + p 2 p 1 p 1 )( ) p 1 + ( ) p )
42 Lemma. φ p φ (mod p) if p 1, 4 (mod ) φ (mod p) if p 2, 3 (mod ) Proof. φ p = 1 2 p ( 1+ ) p = 1 ( 1+ ( ) ( p + + p 2 p (1+ p 1 2 ) p 1 )( ) p 1 + ( ) p ) (mod p)
43 Lemma. φ p φ (mod p) if p 1, 4 (mod ) φ (mod p) if p 2, 3 (mod ) Proof. φ p = 1 2 p ( 1+ ) p = 1 ( 1+ ( ) ( p + + p 2 p (1+ p 1 2 ) 1 2 p 1 ( 1+ ( )( ) p 1 + ( ) p ) p ) ) (mod p)
44 Lemma. φ p φ (mod p) if p 1, 4 (mod ) φ (mod p) if p 2, 3 (mod ) Proof. φ p = 1 2 p ( 1+ ) p = 1 ( 1+ ( ) ( p + + p 2 p (1+ p 1 2 ) 1 2 p 1 ( 1+ ( )( ) p 1 + ( ) p ) p ) ) (mod p) ( ) p =1ifp 1,4 (mod ) and ( p ) = 1 ifp 2,3 (mod ).
45 Theorem. p divides F p 1 if p 1, 4 (mod ). (Ex: 11 F 10 =.) p divides F p+1 if p 2, 3 (mod ). (Ex: 7 F 8 = 21.)
46 Theorem. p divides F p 1 if p 1, 4 (mod ). (Ex: 11 F 10 =.) p divides F p+1 if p 2, 3 (mod ). (Ex: 7 F 8 = 21.) Proof. If p 1, 4 (mod ), then φ p φ (mod p). Dividing by φ, φ p 1 1 (mod p). F p 1 = 1 ( φ p 1 φ p 1) 1 ( 1 1 ) 0 (mod p).
47 Theorem. p divides F p 1 if p 1, 4 (mod ). (Ex: 11 F 10 =.) p divides F p+1 if p 2, 3 (mod ). (Ex: 7 F 8 = 21.) Proof. If p 1, 4 (mod ), then φ p φ (mod p). Dividing by φ, φ p 1 1 (mod p). F p 1 = 1 ( φ p 1 φ p 1) 1 ( 1 1 ) 0 (mod p). If p 2, 3 (mod ), then φ p φ (mod p). Multiplying by φ, φ p+1 1 (mod p). F p+1 = 1 ( φ p+1 φ p+1) 1 ( 1+1 ) 0 (mod p).
48 Theorem. If p k divides F n for some k 1, then p k+1 divides F pn.
49 Theorem. If p k divides F n for some k 1, then p k+1 divides F pn. Proof. Homework problem.
50 Theorem. If p k divides F n for some k 1, then p k+1 divides F pn. Proof. Homework problem. Corollary. Every positive integer divides F n for some n. For example, 1000 = 8 12 divides F 6 12 = F 70.
51 Entry Points The smallest n such that p divides F n is called the entry point of p. We use e F (p) for the entry point of p into the Fibonacci numbers and e L (p) for the entry point of p into the Lucas numbers.
52 Entry Points The smallest n such that p divides F n is called the entry point of p. We use e F (p) for the entry point of p into the Fibonacci numbers and e L (p) for the entry point of p into the Lucas numbers. From the previous theorem, e F (p) divides either p 1orp+1. For example, we know that 13 divides the 14 th Fibonacci number. However, 13 also divides F 7 = 13, so e F (13) = 7. On the other hand, 13 does not divide any Lucas number. We say that e L (13) is undefined in this case.
53 Entry Points for the Lucas Numbers If e F (p) is even, then e L (p) = e F(p) 2. If e F (p) is odd, then p does not divide any Lucas number. This follows from F 2n = F n L n. For example, e F (29) = 14 and e L (29) = 7. Question: Which primes divide the Lucas numbers?
54 One More Formula L 2 n F 2 n =4 ( 1) n
55 One More Formula L 2 n F 2 n =4 ( 1) n Lemma. If p does not divide L n for any n, then p 1 (mod 4). Proof. Suppose n = e F (p) is odd, that is, p F n for some odd n. L 2 n 4 (mod p) = 1 is a square mod p = p 1 (mod 4).
56 One More Formula L 2 n F 2 n =4 ( 1) n Lemma. If p does not divide L n for any n, then p 1 (mod 4). Proof. Suppose n = e F (p) is odd, that is, p F n for some odd n. L 2 n 4 (mod p) = 1 is a square mod p = p 1 (mod 4). Corollary. All primes p 3 (mod 4) divide the Lucas numbers.
57 L 2 n F 2 n =4 ( 1) n Lemma. If p 1 (mod 4) and p 2, 3 (mod ), then p does not divide L n for any n.
58 L 2 n F 2 n =4 ( 1) n Lemma. If p 1 (mod 4) and p 2, 3 (mod ), then p does not divide L n for any n. Proof. Suppose p L n. Then F 2 n 4 ( 1) n (mod p) = ± is a square mod p. By quadratic reciprocity, ± are not squares when p 1 (mod 4) and p 2, 3 (mod ).
59 p 1 (mod 4) p 3 (mod 4) p 1, 4 (mod ) p 2, 3 (mod )
60 p 1 (mod 4) p 3 (mod 4) p 1, 4 (mod ) p L n for some n p 2, 3 (mod ) p L n for some n
61 p 1 (mod 4) p 3 (mod 4) p 1, 4 (mod ) p L n for some n p 2, 3 (mod ) p L n for any n p L n for some n
62 p 1 (mod 4) p 3 (mod 4) p 1, 4 (mod )? p L n for some n p 2, 3 (mod ) p L n for any n p L n for some n
63 Suppose p 1 (mod 4) and p 1, 4 (mod ) such that p L n for some n. We may assume n p 1 2. Then L n = φ n + φ n 0 (mod p) φ n φ n (mod p) φ 2n ( 1) n+1 (mod p)
64 φ 2n ( 1) n+1 (mod p) If n = p 1 4 is odd, then φ p (mod p) means φ is a square mod p. Hence, 1 2 of the primes p (mod 8) divide L p 1. 4 If n = p 1 4 is even, then φ p (mod p) means φ is not a square mod p. Hence, 1 2 of the primes p 1 (mod 8) divide L p 1. 4
65 φ 2n ( 1) n+1 (mod p) If n = p 1 8 is odd, then φ p (mod p) means φ is a fourth power mod p. Hence, 1 4 of the primes p 9 (mod 16) divide L p 1. 8 If n = p 1 8 is even, then φ p (mod p) means φ is a square but not a fourth power mod p. Hence, 1 4 of the primes p 1 (mod 16) divide L p 1. 8
66 Question: How many primes divide the Lucas numbers? Answer: = 1 2 ( 1 4 n=0 ) n = 2 3 The density of the primes dividing the Lucas numbers is 2 3!
67 Conclusions F n divides F m if and only if n divides m.
68 Conclusions F n divides F m if and only if n divides m. L n divides L m if and only if m is an odd multiple of n.
69 Conclusions F n divides F m if and only if n divides m. L n divides L m if and only if m is an odd multiple of n. Every positive integer divides the Fibonacci numbers.
70 Conclusions F n divides F m if and only if n divides m. L n divides L m if and only if m is an odd multiple of n. Every positive integer divides the Fibonacci numbers. 2 3 of the primes divide the Lucas numbers.
71 Conclusions F n divides F m if and only if n divides m. L n divides L m if and only if m is an odd multiple of n. Every positive integer divides the Fibonacci numbers. 2 3 of the primes divide the Lucas numbers. The Fibonacci and Lucas numbers are cool!
Algebra 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 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 information4 Powers of an Element; Cyclic Groups
4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)
More informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationFibonacci Numbers. Justin Stevens. Lecture 5. Justin Stevens Fibonacci Numbers (Lecture 5) 1 / 10
Fibonacci Numbers Lecture 5 Justin Stevens Justin Stevens Fibonacci Numbers (Lecture 5) 1 / 10 Outline 1 Fibonacci Numbers Justin Stevens Fibonacci Numbers (Lecture 5) 2 / 10 Fibonacci Numbers The Fibonacci
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 informationDiscrete Structures Lecture Primes and Greatest Common Divisor
DEFINITION 1 EXAMPLE 1.1 EXAMPLE 1.2 An integer p greater than 1 is called prime if the only positive factors of p are 1 and p. A positive integer that is greater than 1 and is not prime is called composite.
More informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
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 informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationElementary Number Theory Review. Franz Luef
Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then
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 informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest
More information2. THE EUCLIDEAN ALGORITHM More ring essentials
2. THE EUCLIDEAN ALGORITHM More ring essentials In this chapter: rings R commutative with 1. An element b R divides a R, or b is a divisor of a, or a is divisible by b, or a is a multiple of b, if there
More informationRings and modular arithmetic
Chapter 8 Rings and modular arithmetic So far, we have been working with just one operation at a time. But standard number systems, such as Z, have two operations + and which interact. It is useful to
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a k for some integer k. Notation
More informationBasic elements of number theory
Cryptography Basic elements of number theory Marius Zimand 1 Divisibility, prime numbers By default all the variables, such as a, b, k, etc., denote integer numbers. Divisibility a 0 divides b if b = a
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 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 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 informationCh 4.2 Divisibility Properties
Ch 4.2 Divisibility Properties - Prime numbers and composite numbers - Procedure for determining whether or not a positive integer is a prime - GCF: procedure for finding gcf (Euclidean Algorithm) - Definition:
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationinv lve a journal of mathematics 2009 Vol. 2, No. 2 Bounds for Fibonacci period growth mathematical sciences publishers Chuya Guo and Alan Koch
inv lve a journal of mathematics Bounds for Fibonacci period growth Chuya Guo and Alan Koch mathematical sciences publishers 2009 Vol. 2, No. 2 INVOLVE 2:2(2009) Bounds for Fibonacci period growth Chuya
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 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 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 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 information4 Linear Recurrence Relations & the Fibonacci Sequence
4 Linear Recurrence Relations & the Fibonacci Sequence Recall the classic example of the Fibonacci sequence (F n ) n=1 the relations: F n+ = F n+1 + F n F 1 = F = 1 = (1, 1,, 3, 5, 8, 13, 1,...), defined
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
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 informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
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 informationPrimes and Modular Arithmetic! CSCI 2824, Fall 2014!!
Primes and Modular Arithmetic! CSCI 2824, Fall 2014!!! Scheme version of the algorithm! for finding the GCD (define (gcd a b)! (if!(= b 0)!!!!a!!!!(gcd b (remainder a b))))!! gcd (812, 17) = gcd(17, 13)
More informationMathematics of Cryptography
Modulo arithmetic Fermat's Little Theorem If p is prime and 0 < a < p, then a p 1 = 1 mod p Ex: 3 (5 1) = 81 = 1 mod 5 36 (29 1) = 37711171281396032013366321198900157303750656 = 1 mod 29 (see http://gauss.ececs.uc.edu/courses/c472/java/fermat/fermat.html)
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 informationHOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS
HOMEWORK 4 SOLUTIONS TO SELECTED PROBLEMS 1. Chapter 3, Problem 18 (Graded) Let H and K be subgroups of G. Then e, the identity, must be in H and K, so it must be in H K. Thus, H K is nonempty, so we can
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 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 informationOn arithmetic functions of balancing and Lucas-balancing numbers
MATHEMATICAL COMMUNICATIONS 77 Math. Commun. 24(2019), 77 1 On arithmetic functions of balancing and Lucas-balancing numbers Utkal Keshari Dutta and Prasanta Kumar Ray Department of Mathematics, Sambalpur
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
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 informationArithmetic Algorithms, Part 1
Arithmetic Algorithms, Part 1 DPV Chapter 1 Jim Royer EECS January 18, 2019 Royer Arithmetic Algorithms, Part 1 1/ 15 Multiplication à la Français function multiply(a, b) // input: two n-bit integers a
More informationPRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION. Predrag Terzic Podgorica, Montenegro
PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION Predrag Terzic Podgorica, Montenegro pedja.terzic@hotmail.com Abstract. We present deterministic primality test for Fermat numbers, F
More informationMATH 3330 ABSTRACT ALGEBRA SPRING Definition. A statement is a declarative sentence that is either true or false.
MATH 3330 ABSTRACT ALGEBRA SPRING 2014 TANYA CHEN Dr. Gordon Heier Tuesday January 14, 2014 The Basics of Logic (Appendix) Definition. A statement is a declarative sentence that is either true or false.
More informationChapter 1. Number of special form. 1.1 Introduction(Marin Mersenne) 1.2 The perfect number. See the book.
Chapter 1 Number of special form 1.1 Introduction(Marin Mersenne) See the book. 1.2 The perfect number Definition 1.2.1. A positive integer n is said to be perfect if n is equal to the sum of all its positive
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
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 informationEUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972)
Intro to Math Reasoning Grinshpan EUCLID S ALGORITHM AND THE FUNDAMENTAL THEOREM OF ARITHMETIC after N. Vasiliev and V. Gutenmacher (Kvant, 1972) We all know that every composite natural number is a product
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationMATH 215 Final. M4. For all a, b in Z, a b = b a.
MATH 215 Final We will assume the existence of a set Z, whose elements are called integers, along with a well-defined binary operation + on Z (called addition), a second well-defined binary operation on
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 informationGreatest Common Divisor MATH Greatest Common Divisor. Benjamin V.C. Collins, James A. Swenson MATH 2730
MATH 2730 Greatest Common Divisor Benjamin V.C. Collins James A. Swenson The world s least necessary definition Definition Let a, b Z, not both zero. The largest integer d such that d a and d b is called
More informationThe Jacobi Symbol. q q 1 q 2 q n
The Jacobi Symbol It s a little inconvenient that the Legendre symbol a is only defined when the bottom is an odd p prime You can extend the definition to allow an odd positive number on the bottom using
More informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationCovering Subsets of the Integers and a Result on Digits of Fibonacci Numbers
University of South Carolina Scholar Commons Theses and Dissertations 2017 Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers Wilson Andrew Harvey University of South Carolina
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 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 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 information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationPELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série tome 05 207 23 245 https://doiorg/02298/pim7523f PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER Bernadette Faye and Florian Luca Abstract We show
More informationNumber Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru
Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove
More informationCS280, Spring 2004: Prelim Solutions
CS280, Spring 2004: Prelim Solutions 1. [3 points] What is the transitive closure of the relation {(1, 2), (2, 3), (3, 1), (3, 4)}? Solution: It is {(1, 2), (2, 3), (3, 1), (3, 4), (1, 1), (2, 2), (3,
More informationLP03 Chapter 5. A prime number is a natural number greater that 1 that has only itself and 1 as factors. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
LP03 Chapter 5 Prime Numbers A prime number is a natural number greater that 1 that has only itself and 1 as factors. 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, Question 1 Find the prime factorization of 120.
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationExercises Exercises. 2. Determine whether each of these integers is prime. a) 21. b) 29. c) 71. d) 97. e) 111. f) 143. a) 19. b) 27. c) 93.
Exercises Exercises 1. Determine whether each of these integers is prime. a) 21 b) 29 c) 71 d) 97 e) 111 f) 143 2. Determine whether each of these integers is prime. a) 19 b) 27 c) 93 d) 101 e) 107 f)
More informationNumber Theory Solutions Packet
Number Theory Solutions Pacet 1 There exist two distinct positive integers, both of which are divisors of 10 10, with sum equal to 157 What are they? Solution Suppose 157 = x + y for x and y divisors of
More informationOn the least absolute remainder Euclidean algorithm
Bridgewater State University Virtual Commons - Bridgewater State University Mathematics and Computer Science Faculty Publications Mathematics and Computer Science Department 1992 On the least absolute
More informationTHE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS
THE ORDER OF APPEARANCE OF PRODUCT OF CONSECUTIVE FIBONACCI NUMBERS DIEGO MARQUES Abstract. Let F n be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest
More informationLecture notes: Algorithms for integers, polynomials (Thorsten Theobald)
Lecture notes: Algorithms for integers, polynomials (Thorsten Theobald) 1 Euclid s Algorithm Euclid s Algorithm for computing the greatest common divisor belongs to the oldest known computing procedures
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 informationMAT 243 Test 2 SOLUTIONS, FORM A
MAT Test SOLUTIONS, FORM A 1. [10 points] Give a recursive definition for the set of all ordered pairs of integers (x, y) such that x < y. Solution: Let S be the set described above. Note that if (x, y)
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationMidterm 3 Review. Terms. Formulas and Rules to Use. Math 1010, Fall 2011 Instructor: Marina Gresham. Odd Root ( n x where n is odd) Exponent
Math 1010, Fall 2011 Instructor: Marina Gresham Terms Midterm 3 Review Exponent Polynomial - Monomial - Binomial - Trinomial - Standard Form - Degree - Leading Coefficient - Constant Term Difference of
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More information1. Introduction. Let P and Q be non-zero relatively prime integers, α and β (α > β) be the zeros of x 2 P x + Q, and, for n 0, let
C O L L O Q U I U M M A T H E M A T I C U M VOL. 78 1998 NO. 1 SQUARES IN LUCAS SEQUENCES HAVING AN EVEN FIRST PARAMETER BY PAULO R I B E N B O I M (KINGSTON, ONTARIO) AND WAYNE L. M c D A N I E L (ST.
More informationSECOND-ORDER RECURRENCES. Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C
p-stability OF DEGENERATE SECOND-ORDER RECURRENCES Lawrence Somer Department of Mathematics, Catholic University of America, Washington, D.C. 20064 Walter Carlip Department of Mathematics and Computer
More informationNOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.
EXAM 2 solutions (COT3100, Sitharam, Spring 2017) NAME:last first: UF-ID Section NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty. (1) Are the following functions one-to-one
More informationElementary Properties of the Integers
Elementary Properties of the Integers 1 1. Basis Representation Theorem (Thm 1-3) 2. Euclid s Division Lemma (Thm 2-1) 3. Greatest Common Divisor 4. Properties of Prime Numbers 5. Fundamental Theorem of
More informationSolution Sheet (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = (i) gcd (97, 157) = 1 = ,
Solution Sheet 2 1. (i) q = 5, r = 15 (ii) q = 58, r = 15 (iii) q = 3, r = 7 (iv) q = 6, r = 3. 2. (i) gcd (97, 157) = 1 = 34 97 21 157, (ii) gcd (527, 697) = 17 = 4 527 3 697, (iii) gcd (2323, 1679) =
More informationOn The Discriminator of Lucas Sequences
On The Discriminator of Lucas Sequences Bernadette Faye Ph.D Student FraZA, Bordeaux November 8, 2017 The Discriminator Let a = {a n } n 1 be a sequence of distinct integers. The Discriminator is defined
More informationDiscrete Math, Spring Solutions to Problems V
Discrete Math, Spring 202 - Solutions to Problems V Suppose we have statements P, P 2, P 3,, one for each natural number In other words, we have the collection or set of statements {P n n N} a Suppose
More information4.3 - Primes and Greatest Common Divisors
4.3 - Primes and Greatest Common Divisors Introduction We focus on properties of integers and prime factors Primes Definition 1 An integer p greater than 1 is called prime if the only positive factors
More informationSection 19 Integral domains
Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There
More informationTheory of RSA. Hiroshi Toyoizumi 1. December 8,
Theory of RSA Hiroshi Toyoizumi 1 December 8, 2005 1 E-mail: toyoizumi@waseda.jp 2 Introduction This is brief introduction of number theory related to the so-called RSA cryptography. This handout is based
More informationODD REPDIGITS TO SMALL BASES ARE NOT PERFECT
#A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of
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 informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationThe following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers:
Divisibility Euclid s algorithm The following is an informal description of Euclid s algorithm for finding the greatest common divisor of a pair of numbers: Divide the smaller number into the larger, and
More informationON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE
ON DIRICHLET S CONJECTURE ON RELATIVE CLASS NUMBER ONE AMANDA FURNESS Abstract. We examine relative class numbers, associated to class numbers of quadratic fields Q( m) for m > 0 and square-free. The relative
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationMinimal multipliers for consecutive Fibonacci numbers
ACTA ARITHMETICA LXXV3 (1996) Minimal multipliers for consecutive Fibonacci numbers by K R Matthews (Brisbane) 1 Introduction The Fibonacci and Lucas numbers F n, L n (see [2]) are defined by Since F 1
More information. In particular if a b then N(
Gaussian Integers II Let us summarise what we now about Gaussian integers so far: If a, b Z[ i], then N( ab) N( a) N( b). In particular if a b then N( a ) N( b). Let z Z[i]. If N( z ) is an integer prime,
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
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 information