Characteristics of Fibonacci-type Sequences

Size: px
Start display at page:

Download "Characteristics of Fibonacci-type Sequences"

Transcription

1 Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and contrast various characteristics of these sequences, in articular the existence and reetition of rime factors. We show that for the Fibonacci sequence, and for multi-nacci sequences with the same initial conditions, it follows that every rime divides an infinite number of terms of the sequence. By contrast, we show that this is not the case for the Lucas numbers. We rovide conditions for when a rime does divide a Lucas number and give some examles of rimes that do not divide any Lucas number. 1 Introduction The Fibonacci sequence is a famous sequence of integers both in mathematics and in oular culture. It was introduced to the Latin-seaking world in 10, in Fibonacci s Liber Abaci. Fibonacci, or, Leonardo Pisano, was an Italian mathematician born in 117. He grew u traveling with his merchant father and was exosed to the Hindu- Arabic arithmetic system in North Africa. He ublished Liber Abaci in 10, which introduced the Latin-seaking world to the decimal system. In Liber Abaci, he also introduced the Fibonacci sequence: How many airs of rabbits can be bred in one year from one air? A certain erson laces one air of rabbits in a certain lace surrounded on all sides by a wall. We want to know how many airs can be bred from that air in one year, assuming it is their nature that each month they give birth to another air, and in the second month, each new air can also breed (see [3]. This situation can be reresented with the rule, F n = F n 1 + F n, for n with F 0 = 0 and F 1 = 1. The first few terms of the Fibonacci sequence are: 0, 1, 1,, 3,, 8, 13, 1, 34,,... 1

2 Figure 1: The golden siral The sequence had been noted by Indian mathematicians as early as the sixth century, but Fibonacci was the first to ublish it outside of India. The Fibonacci numbers are also known for aearing in nature. They aear in the form of a siral constructed from quarter circles drawn inside an array of squares with the Fibonacci numbers as dimensions. The Fibonacci siral, sometimes called the golden siral, can be seen in sunflower seeds, hurricanes, and galaxies (see []. Preliminaries All of the following results can be found in [4], along with the roofs. Fermat s Little Theorem is a well-known and useful theorem. It is remarkably short and sweet. We include it here for reference. Theorem.1 (Fermat s Little Theorem. Suose that is a rime and a is an integer. Then (a a 1 1 (mod if a and are relatively rime; (b a a (mod for any a. Another concet we use in our roofs are quadratic residues, which take the idea of erfect squares and extend them to saces Z, where is an odd rime. Definition.1. Suose that is an odd rime and that b and are relatively rime. Then b is a quadratic residue modulo if and only if the equation x b (mod has a solution. If the equation has no solution, then we say that b is a quadratic nonresidue modulo. This definition tells us that if b is a quadratic residue modulo, then it is a erfect square in Z. We want to be able to calculate when a number is a quadratic residue modulo. This is easy with small values of simly by

3 squaring all the elements in Z, but for larger values it is useful to have an arithmetic equation. The notation that we ( use to say whether b is a quadratic residue modulo is the Legendre symbol,, where ( { b 1 b is a quadratic residue mod = 1 b is a quadratic nonresidue mod. ( Euler s Criterion gives us a way to calculate Theorem. (Euler s Criterion. Suose that is an odd rime and that b is an integer. If and b are relatively rime, then ( b = b ( 1/. To reduce the work of checking quadratic residues of larger rimes, we use the following result. Theorem.3 (Quadratic Recirocity Theorem. If and q are distinct odd rimes, then ( ( q ( 1 1 ( 1 1 (q 1 (mod. q The following corollary hels to further break down large numbers. Corollary.3.1. Suose that is an odd rime and that n = are relatively rime, then ( n = k i=1 b ( bi. b. k b i. If n and Finally, we have the secial case of determining whether is a quadratic residue modulo. Theorem.4. If is an odd rime then, ( = { 1, ±1 (mod 8; 1 ±3 (mod 8. To see how the Quadratic Recirocity Theorem hels with large rimes, suose we want to determine whether 607 is a quadratic residue of 03. Using the above results we obtain, ( = ( = ( ( ( 3 = = i=1 ( 607 = 3 ( 1 = 1. 3 With these theorems in mind we continue to an exloration of the Fibonacci numbers. 3

4 3 Fibonacci numbers Recall that the Fibonacci sequence is a recursive sequence where each term is defined by F n = F n 1 + F n for n with the initial condition F 0 = 0 and F 1 = 1. It is useful to be able to find a closed-form formula that gives the nth term of the Fibonacci sequence so that we do not have to recursively generate every term rior to the term that we want to calculate. We do this by solving a second order linear difference equation. Taking our recursive Fibonacci equation and transferring all the terms to the left-hand side gives F n F n 1 F n = 0. We assume that r n solves the equation, so and thus r n r n 1 r n = 0 r r 1 = 0, which is our characteristic equation. By solving the characteristic equation, the two roots are r 1 = 1 + := φ and r = 1 := 1 φ, where φ is the golden ratio. For any c 1 substituting c 1 r1 n for F n in F n F n 1 F n yields zero and for any c substituting c r n for F n in F n F n 1 F n yields zero. This suggests our solution has the form: Using our values for r 1 and r, we now have F n = c 1 r n 1 + c r n, (1 F n = c 1 φ n + c (1 φ n. Incororating the initial condition of F 0 = 0 means that c = c 1 so we have F n = c 1 (φ n (1 φ n. Incororating the initial condition F 1 = 1, we obtain 1 = c 1 (φ (1 φ = c 1 (φ 1 1 c 1 = φ 1 = 1. 4

5 So our final closed-form formula for the Fibonacci sequence is: F n = φn (1 φ n. ( Now that we have the closed-form formula for the Fibonacci sequence, we move on to an investigation of its rime factors (see [1]. 3.1 Prime factors An interesting question to consider is when do rimes show u as factors of terms in the Fibonacci-tye sequences? Do we eventually get every rime? It turns out every rime divides a Fibonacci number, which is a somewhat surrising feature of the Fibonacci numbers. Looking at the rime factors of some Fibonacci numbers we begin to notice a attern: n F n (factored It aears that for rimes of the form = 10k ± 1, it follows that F 1 and for rimes of the form = 10k ± 3, it follows that F +1. To show that this is always true, we first look at some secific examles. First we consider F 1 for = 31. We do this by finding a formula for F n in Z 31. We want to find solutions to the characteristic equation x = x + 1 in Z 31. By multilying both sides by 4, we obtain 4x = 4x + 4 4x 4x + 1 = (x 1 =. We can verify that a solution exists by checking that is a quadratic residue modulo 31. This is obvious since 6 (mod 31. Performing some algebra in Z 31, we get (x 1 = 6 so x 1 ± or x 1 ±. Our roots are therefore α = 13 and β = Putting these values back into Equation (1 yields F n c 1 13 n + c 19 n (mod 31.

6 Using our initial condition F 0 = 0 gives us c 1 = c or F n = c 1 (13 n 19 n. Using the initial condition F 1 = 1 gives c 1 ( 6 = 1 or c 1 =. We now have F n (13 n 19 n (mod 31. Using n = 30 and Fermat s Little Theorem we see that F 30 ( (1 1 0 (mod 31. Since F 30 0 (mod 31, this shows that 31 divides F 30. The following theorem generalizes this result for all rimes of the form = 10k ± 1. Theorem 3.1. If is a rime of the form = 10k ± 1, then F 1. Proof. Suose is a rime such that = 10k ± 1. We want to find a solution to the characteristic equation x = x + 1 in Z. We can write x = x + 1 as (x 1 =. To show that this has a solution in Z, we need to be a quadratic residue modulo. Note that by the Quadratic Recirocity Theorem, when = 10k + 1, and when = 10k 1, ( ( = = ( ( = = ( 1 = 1 ( 1 = ( 4 = 1. In either case, is a quadratic residue modulo so a solution to (x 1 = exists in Z. There are two solutions to y (mod, namely y and y y. Note that one of these must be odd. Let y be the odd solution. Solving the equation (x 1 = y yields x = y + 1 := α and x = 1 y := β. Note that y = α β. We ut these values back into our general Fibonacci equation with initial condition F 0 = 0 to obtain F n c 1 (α n β n (mod. Using the initial condition F 1 = 1 gives 1 = c 1 (α β or c 1 = (α β 1 = y 1. We now have F n y 1 (α n β n (mod. Using n = 1 and Fermat s Little Theorem we see that F 1 y 1 (α 1 β 1 y 1 (1 1 0 (mod. Since F 1 0 (mod, it follows that divides F 1. We have now covered one of two cases of rimes. We now look at a secific examle of a rime of the form = 10k ± 3 for = 13. 6

7 Note that is not a quadratic residue modulo 13, so there is no solution to x = x + 1 in Z 13. Since φ is a root of x = x + 1 in R, we must extend the field Z 13 to Z 13 (φ = {a + bφ a, b Z 13 }. We must verify that Z 13 (φ is a field. It is easy to check that Z 13 satisfies the usual roerties for addition and multilication, excet erhas the existence of multilicative inverses. We must show that each nonzero element in Z 13 (φ has an inverse in Z 13 (φ. Each element in Z 13 (φ has the form a + bφ and we need to find an inverse of the form c + dφ such that (a + bφ(c + dφ = 1. Recall that since φ solves the characteristic equation, then φ = φ + 1. Multilying out the left side of the equation we get (a + bφ(c + dφ = ac + bdφ + (ad + bcφ = ac + bd(φ (ad + bcφ = ac + bd + (ad + bc + bdφ. For this to equate to 1 + 0φ we need to solve the system of equations: ac + bd = 1 bc + (a + bd = 0 We solve these two equations for c and d using Cramer s Rule: 1 b 0 a + b c = a a = (a + b(a + ab b 1 ; b a + b a 1 b 0 d = a a = b(a + ab b 1. b a + b Therefore for c + dφ to be the inverse of a + bφ we need (a + ab b 1 to always exist. We show that it must exist by way of contradiction. Suose that a + ab b does not have an inverse. This occurs if and only if a + ab b = 0 which means (a + b = b. However, since is not a quadratic residue modulo 13, this is a contradiction. Therefore (a + ab b 1 exists and each nonzero element of Z 13 (φ has an inverse in Z 13 (φ. Lemma 3.. For all n Z +, it follows that φ n = F n 1 + F n φ. Proof. We rove this by induction over n. For our base case note that φ = F 0 +F 1 φ = 0+φ. Suose that φ n = F n 1 +F n φ 7

8 for some n. Then, φ n+1 = F n 1 φ + F n φ = F n 1 φ + F n (1 + φ = F n 1 φ + F n + F n φ = F n + (F n 1 + F n φ = F n + F n+1 φ. Therefore by the Princile of Mathematical Induction, φ n = F n 1 + F n φ for all n Z +. So by Lemma 3., φ 13 = F 1 + F 13 φ = φ 1 φ (mod 13. Since φ 13 F 1 + F 13 φ, it follows that F 1 1 and F F 14 F 13 + F 1 0 (mod 13. Theorem 3.3. If is a rime of the form = 10k ± 3, then F +1. Therefore, Proof. Suose is a rime of the form = 10k ± 3. We want to find a solution to x = x + 1 in Z. We can write x = x + 1 as (x 1 =. First we will show that there is no solution to (x 1 = in Z. Noting that, ( ( ( when = 10k 3, = = = 1 and when = 10k + 3, ( ( = = ( 3 = 1, we find that is not a quadratic residue modulo, and hence, (x 1 = will not have a solution in Z, therefore we must extend our field to Z (φ = {a + bφ a, b Z }. In our secific examle of = 13, we already showed that Z 13 (φ is a field. The only necessary condition for this argument was that was not a quadratic residue modulo 13. Since is not a quadratic residue modulo, by the same argument it follows that Z (φ is a field with a generic of the form 10k ± 3. We now rewrite ( in Z (φ using inverses instead of division and using only numbers in Z (φ. Since φ = 1+, then = φ 1. We now have the formula: Now note that ( 1 + φf n (φ n (1 φ n (mod. (φ = φ = (φ = (φ + 1, 8

9 and (φ + 1 = k=0 ( φ k = 1 + k ( φ + 1 ( φ φ. Since ( k for 1 k 1 and we are working in Z (φ, it follows that all of the terms besides 1 and φ disaear, so (φ + 1 φ + 1. It follows that (φ = φ + 1. Therefore, φ is a solution to x = x + 1. However, we already know that the only solutions to x = x + 1 are φ and 1 φ, so φ must be equivalent to one of them. Suose φ φ. Then φ φ 0, so φ is a solution to x x = 0. We know that olynomials of degree have at most roots in a field. Since x x (mod for all x Z by Fermat s Little Theorem, so we already have all roots. Therefore, φ is not a root and φ φ. It follows that φ 1 φ. Now note that (1 φ 1 φ 1 (1 φ φ. Using our substitutions of φ 1 φ and (1 φ φ, we obtain It follows that divides F +1. ( 1 + φf +1 = (φ +1 (1 φ +1 = (φ φ (1 φ (1 φ = ((1 φ φ φ (1 φ = 0. Since all rimes besides and are of the form 10k ± 1 or 10k ± 3, it follows that all rimes divide a Fibonacci number. When we look at the rime factorizations of the Fibonacci terms we see that while the above theorems tell us when a rime divides a Fibonacci number, they do not necessarily tell us the first time that a rime divides a Fibonacci number. For examle, 17 = 0 3, so it is a rime of the form = 10k ± 3. It is true that 17 F 18 but also that 17 F 9. Note that 18 is a multile of 9. The following lemmas bring us to the result that F n if and only if z( n, where z( is the smallest ositive index such that F z(. From here on we will define a sequence S n such that, S n = S n 1 + qs n, where q is some integer and the initial conditions are S 0 = 0 and S 1 = 1. Lemma 3.4. If n and r are ositive integers, it follows that S n+r = S r+1 S n + qs r S n 1. 9

10 Proof. We will rove this using strong induction over r. We first show that the equality is valid for r = 1. Let n Z +. Note that S n+1 = S S n + qs 1 S n 1 = S n + qs n 1 which is how we define our Fibonacci-tye sequences, so the equation is valid for r = 1. Now suose that the equality is valid for all integers u to r. That is, assume S n+r = S r+1 S n + qs r S n 1. Noting that S n+r+1 = S n+r + qs n+r 1 = S r+1 S n + qs r S n 1 + q(s r S n + qs r 1 S n 1 = S n (S r+1 + qs r + qs n 1 (S r + qs r 1 = S r+ S n + qs r+1 S n 1, we find that the equation is valid for r +1. Therefore, by the Princile of Strong Induction, S n+r = S r+1 S n + qs r S n 1 is valid for all r Z +. Lemma 3.. For each ositive integer n, we find that S n S kn for all n, k Z +. Proof. We rove this using induction over k. For our base case note that by Lemma 3.4, we have S n = S n+n = S n+1 S n + qs n S n 1 = S n (S n+1 + qs n 1, so S n S n. Now we assume that S n S kn for some k and note that S (k+1n = S n+kn = S kn+1 S n + qs kn S n 1. Since S n S kn and S n S n, we see that S n S (k+1n. By the Princile of Mathematical Induction, it follows that S n S kn for all n, k Z +. Lemma 3.6. Every air of consecutive Fibonacci numbers F n, F n+1 are relatively rime. Proof. We rove this using induction. For our base case when n = 1 note that gcd(f 1, F = gcd(1, 1 = 1. Now we assume that gcd(f n, F n+1 = 1 for some n Z + and show that gcd(f n+1, F n+ = 1. Since gcd(f n, F n+1 = 1, there exist integers x and y such that F n x + F n+1 y = 1. Also note that since F n+ = F n + F n+1, then F n = F n+ F n+1. Making this substitution for F n we have 1 = (F n+ F n+1 x + F n+1 y = F n+ x F n+1 x + F n+1 y = F n+ x + F n+1 (y x. Since y x is an integer, F n+1 and F n+ are relatively rime. By the Princile of Mathematical Induction, every air of consecutive Fibonacci numbers are relatively rime. Theorem 3.7. Let be a rime. Then F n if and only if z( n, where z( is the smallest ositive index such that F z(. Proof. The existence of z( is guaranteed by the well-ordering roerty, since we know that the set {n : n Z + and F n } is nonemty for each rime. 10

11 Suose that z( n. Then F n easily follows from Lemma 3.. Now suose that F n.by the Division Algorithm, there exist integers q and r such that n = z(q + r and 0 r < z(. Note that by Lemma 3.4, F n = F z(q+r = F r+1 F z(q + F r F z(q 1. We know that F n and also that F z(q by Lemma 3., so it must be that F r F z(q 1. By Lemma 3.6 we know that does not divide F z(q 1, since the Fibonacci numbers F z(q and F z(q 1 are consecutive. Therefore F r. Since 0 r < z( and z( is the smallest ositive integer such that F z (, it must be that r = 0. It follows that n = z(q, so z( n. We have now shown that not only does every rime divide a Fibonacci number, but that every rime does so an infinite number of times. 3. Periodicity We now know that in our Fibonacci sequence modulo, the zeros reeat at a certain interval. However, this is not necessarily the same interval that the entire sequence reeats. For examle, take the terms of F n (mod 7: 1, 1,, 3,, 1, 6, 0, 6, 6,, 4,, 6, 1, 0, 1, 1,, 3,... We see that a zero aears after just 8 terms, but the entire sequence doesn t reeat until 16 terms. This motivates the following two theorems, which give the eriod of a Fibonacci sequence modulo. Theorem 3.8. If is a rime of the form 10k ± 1, then the Fibonacci sequence modulo reeats after 1 terms. Proof. Once again we use the equation F n y 1 (α n β n (mod in Z. By Fermat s Little Theorem, F n+( 1 y 1 (α n+( 1 β n+( 1 y 1 (α n α 1 β n β 1 y 1 (α n β n F n (mod. Since F n+( 1 F n (mod, the sequence reeats after 1 terms. Theorem 3.9. If is a rime of the form 10k ± 3, where k Z +, then the Fibonacci sequence modulo reeats after ( + 1 terms. Proof. We use the equation F n = (φ n (1 φ n ( 1+φ 1 (mod in Z (φ, along with the equivalences φ 1 φ and (1 φ φ to obtain: φ 1 φ φ +1 φ 1 φ (+1 1, 11

12 and, Using these substitutions, note that: (1 φ φ (1 φ +1 1 (1 φ (+1 1. F n+(+1 (φ n+(+1 (1 φ n+(+1 ( 1 + φ 1 (φ n φ (+1 (1 φ n (1 φ (+1 ( 1 + φ 1 (φ n (1 φ n ( 1 + φ 1 F n (mod. Since F n+(+1 F n (mod, the sequence reeats after ( + 1 terms. Note that the above theorems give a eriod in which the Fibonacci sequence modulo will reeat, but it is not necessarily the shortest eriod. 4 Multi-nacci numbers The Fibonacci sequence was considered in a math roblem where a mature air of rabbits bears one air of baby rabbits er month. Imagine if instead, a mature air of rabbits bears two airs of baby rabbits er month. Then each month, we would count the number of airs by the number of airs from the last month in addition to two airs for each air from two months earlier that has now matured. We call this sequence the Beta-nacci sequence and define it recursively by B n = B n 1 + B n where n with B 0 = 0 and B 1 = 1. Note that this is a version of our generic multi-nacci sequence, S n = S n 1 + qs n. The first seven terms in some of these multi-nacci sequences is given in Table 1 (see []. As with the Fibonacci sequence, we want to determine if every rime divides a term of a multi-nacci sequence. We take the Gamma-nacci sequence as an examle. The Gamma-nacci sequence is defined by G n = G n 1 + 3G n. To rove that a rime divides the G 1 term, we need a solution to x x 3 = 0 in Z, or, (x 1 = 13. For this to have a solution, we need 13 to be a quadratic residue in Z. By the Division Algorithm we can write = 13q + r 1

13 n Fibonacci β γ δ ɛ ζ n F n B n G n D n E n Z n Table 1: The first 7 terms of some multi-nacci sequences ( 13 where 0 r < 13. Using Euler s Criterion, we want = 1. By the Quadratic Recirocity Theorem, ( 13 ( = ( ( = ( 1 3( 1 ( = = ( r. 13 Therefore we just need r to be a quadratic residue modulo 13. The quadratic residues in Z 13 are r = 1, 3, 4, 9, 10, 1. So for rimes of the form 13k ± 1, 13k ± 3, and 13k ± 4, will divide the G 1 term. For other rimes, it follows that r will not be a quadratic residue modulo. This is all we need for the roof that divides the G +1 term. The following theorem generalizes the roof that G +1 to all multi-nacci sequences. Theorem 4.1. For sequences of the form S n = S n 1 +qs n, let b = 4q+1. For all r such that r is a quadratic residue modulo b, rimes of the form = bk + r divides the S 1 and for all other rimes > 4q + 1, it follows that divides the S +1 term. A roof for Theorem 4.1 is identical to the roofs of Theorems 3.1 and 3.3 where b =. Two secial cases of the rime division are for the Beta-nacci sequence defined by B n = B n 1 + B n, and the Zeta-nacci sequence defined by Z n = Z n 1 + 6Z n. 13

14 The reason that these two sequences are unique is that their characteristic equations are r r = 0 and r r 6 = 0 resectively, which each have two integer roots. This means that for > 3 and > resectively, these equations always have a solution in Z, so for all > 3 and > resectively, it is true that B 1 and Z 1. We can also see this by using the closed form formulas for the Beta-nacci and Zeta-nacci sequences. The closed form formula for the Beta-nacci sequence is: B n = n ( 1 n. 3 When n = 1, Fermat s Little Theorem yields 3B 1 1 ( , which shows that B 1. The closed form formula for the Zeta-nacci sequence is: Z n = 3n ( n. When n = 1, Fermat s Little Theorem once again yields Z 1 = 3 1 ( 1 = (mod, which shows that Z 1. Lucas numbers A sequence related to the Fibonacci sequence is the Lucas sequence. It is another sequence defined recursively where each term is given by L n = L n 1 + L n but the initial conditions are L 0 = and L 1 = 1. The first few terms of the Lucas Sequence are, 1, 3, 4, 7, 11, 18, 9, 47, 76,... Note that the only differences between the Lucas and Fibonacci sequences are the initial conditions, in articular the initial condition on the 0 term. Looking at the rime factorizations of the Lucas numbers, it aears that some rimes divide L ( 1/, some divide L (+1/, and some do not divide any Lucas numbers. The following theorems tell us when some rimes divide a Lucas number. Theorem.1. If is a rime of the form 0k +11 or 0k +19, then L ( 1/. 14

15 Proof. The conditions for a rime to divide the L ( 1/ term of the Lucas sequence are that is a quadratic residue modulo and that 1 is a quadratic nonresidue modulo. Note that 1 is a quadratic nonresidue modulo when = 4k + 3 because by Euler s Criterion, ( 1 ( 1 1 1, since 1 is odd for = 4k + 3. To add in the condition that is a quadratic residue modulo, we want 4k (mod or 4k (mod. So, we have: or, 4k (mod 4k k, 4k (mod k 1 k 4. So k = j + or k = m + 4 where k, m Z. We now have or, = 4(j = 0j + 11, = 4(j = 0j To get a formula for L n in Z we once again solve the characteristic equation x x 1 = 0 or (x 1 =. Solving the equation (x 1 = y and choosing the odd solution y, once again yields x = 1+y, 1 y. The general solution for our Lucas number formula in Z then looks like ( n ( n 1 + y 1 y L n = c 1 + c. To find our constants, we use the initial conditions L 0 = and L 1 = 1 to obtain the system of equations = c 1 + c 1 = c 1 ( 1 + y ( 1 y + c, which yield c 1 = 1 and c = 1. We now have ( n ( n 1 + y 1 y L n = +. 1

16 Using n = ( 1/ we have ( ( 1/ ( ( 1/ 1 + y 1 y L ( 1/ = +. Note that by Euler s Criterion, this is equivalent to ( ( 1+y 1 y L ( 1/ = +. Since 1 is a quadratic nonresidue modulo, we see that ( ( ( 1+y 1 y 1 y ( 1 ( = = = = 1. ( 1+y Therefore, and L ( 1/ 0, as required. ( 1 y must be of oosite signs and it follows that Theorem.. If is a rime of the form 0k + 3 or 0k + 7, then L (+1/. Proof. Suose is a rime such that = 0k + 3 or = 0k + 7. To get a formula for L n in Z, we want a solution to the characteristic x = x + 1 in Z. First we show that there is no solution to (x 1 = in Z. Note that, ( ( ( 3 when = 0k + 3, = = = 1 and when = 0k + 7, ( ( = = ( = 1. In either case, is not a quadratic residue modulo. We therefore have to do a field extension like we did with the Fibonacci sequence. Our formula for L n in Z (φ is L n φ n + (1 φ n (mod. When we substitute n = ( + 1/, which is an even number, and use the identities φ 1 φ and (1 φ φ we obtain: L (+1/ φ (+1/ + (1 φ (+1/ L (+1/ (φ(+1/ + (1 φ (+1/ φ +1 + (φ (+1/ (1 φ (+1/ + (1 φ +1 φ φ + (φ φ (+1/ + (1 φ(1 φ φ (1 φ + + (1 φ φ It follows that divides L (+1/. (mod. 16

17 Although we have just roved two cases of rime division in the Lucas numbers, not all rimes divide a Lucas number. Since the only thing different about the Lucas sequence is the initial conditions, the sequence has the same eriod modulo as the Fibonacci sequence. That is, for rimes of the form 10k ± 1 the eriod is 1 and for rimes of the form 10k ± 3 the eriod is ( + 1. If divides a Lucas number we will see a 0 in one eriod of the Lucas sequence modulo. To show that not all rimes divide a Lucas number we only need to show an examle of a rime that never divides a Lucas number. We take = and note that the eriod is 4. In one eriod of the Lucas sequence modulo, the terms are, 1, 3, 4,... Since there is no 0 in this eriod, which reeats for the entire sequence, then does not divide a Lucas number. For our next examle we use = 13, which is a rime of the form 10k ± 3. Therefore its eriod is ( + 1 = 8, so we only need to look at 8 terms of the Lucas sequence modulo 13. Observe that since F n = (φ n (1 φ n ( 1 + φ 1 and L n = φ n + (1 φ n, it follows that F n = F n L n. Therefore if 13 L n, then 13 F n. We know that F 7 = 13, so 7 n, by Theorem 3.7. Since 7 does not divide, 7 divides n. Therefore we only need to look at L n (mod 13 u to 8 where n is a multile of 7. If we check these terms we see that L 7 3, L 14 11, and L Since none of these values are 0, it follows that 13 does not divide a Lucas number. Similarly for 17, we only need to check L 9, L 18, and L 7 in Z 17. Since L 9 8, L 18 1, and L 7 9, it follows that 17 does not divide a Lucas number. The fact that not all rimes divide a Lucas number suggests that there is something unique about the Fibonacci sequence and other multi-nacci sequences with the same initial conditions. Particularly, to get the result that all sufficiently large rimes divide every term of a sequence S n, it is necessary that S 0 = 0. The following fact is another interesting characteristic of the Lucas numbers. Theorem.3. For all rimes, L 1 (mod. ( Proof. For the case when 1, we see that in Z, the solutions to the equation (x 1 = are x = 1+y Fermat s Little Theorem,, 1 y L a + b a + b 1 (mod. ( For the case when 1, we see that in Z (φ, 1+y. Let a = and b = 1+y. Then by L φ + (1 φ 1 φ + φ = 1 (mod. 17

18 For the case when = we see that L = 11 1 (mod. Therefore, for all rimes, it follows that L 1 (mod. The following result combines our knowledge of the Fibonacci and Lucas numbers. Theorem.4. If z( is even, where z( is the smallest integer such that F z(, then L z(/. Proof. Suose z( is even. Then z( = n for some n Z +. Note that F n = F n L n. Since z( is the smallest integer such that F z(, does not divide F n. Therefore L n = L z(/. 6 Conclusion In this aer we exlored characteristics of the Fibonacci numbers and multinacci numbers, contrasted with the Lucas numbers. In articular we focused on rime factors and reetition in these sequences. There are many oortunities for future study on this toic. For examle, we could look at recursive sequences that are non-homogeneous. We also could look at recursive sequences that deend on 3 revious terms rather than two. Another question we left unanswered is whether or not there exists a rime such that z( = z(. We exlored the rime factors of Fibonacci-tye sequences, and when a sequence reeats modulo, but we could also investigate when m divides S n for a generic m that is not necessarily rime. It turns out that when m = q, where and q are rime, then the eriod of the sequence modulo m is the least common multile of and q. This can be used to show when a Fibonacci-tye sequence reeats in the ones digit, since this is equivalent to showing when the sequence reeats modulo 10. Our exloration of Fibonacci-tye sequences has shown that the initial condition S 0 = 0 leads to many interesting results. There is much to be exlored in these numbers and they lead to many questions about other sequences. References [1] Mathematical methods for economic theory. htts://mjo.osborne. economics.utoronto.ca/ index.h/tutorial/index/1/sod/t. [] Elaine J. Hom. What is the fibonacci sequence? htts://www. livescience.com/37470-fibonacci-sequence.html,

19 [3] V. Katz. A history of mathematics, an introduction. Addison-Wesley, second edition, [4] Patrick Keef and David Guichard. An Introduction to Higher Mathematics. Whitman College. [] Shari Lynn Levine. Suose more rabbits are born. The Fibonacci Quarterly, 6: ,

MATH 3240Q Introduction to Number Theory Homework 7

MATH 3240Q Introduction to Number Theory Homework 7 As long as algebra and geometry have been searated, their rogress have been slow and their uses limited; but when these two sciences have been united, they have lent each mutual forces, and have marched

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

MATH 361: NUMBER THEORY EIGHTH LECTURE MATH 361: NUMBER THEORY EIGHTH LECTURE 1. Quadratic Recirocity: Introduction Quadratic recirocity is the first result of modern number theory. Lagrange conjectured it in the late 1700 s, but it was first

More information

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,

Math 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2, MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract

A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave

More information

Representing Integers as the Sum of Two Squares in the Ring Z n

Representing Integers as the Sum of Two Squares in the Ring Z n 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.7.4 Reresenting Integers as the Sum of Two Squares in the Ring Z n Joshua Harrington, Lenny Jones, and Alicia Lamarche Deartment

More information

A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE

A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE International Journal of Mathematics & Alications Vol 4, No 1, (June 2011), 77-86 A FEW EQUIVALENCES OF WALL-SUN-SUN PRIME CONJECTURE ARPAN SAHA AND KARTHIK C S ABSTRACT: In this aer, we rove a few lemmas

More information

Mersenne and Fermat Numbers

Mersenne and Fermat Numbers NUMBER THEORY CHARLES LEYTEM Mersenne and Fermat Numbers CONTENTS 1. The Little Fermat theorem 2 2. Mersenne numbers 2 3. Fermat numbers 4 4. An IMO roblem 5 1 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM

More information

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001

The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

Math 104B: Number Theory II (Winter 2012)

Math 104B: Number Theory II (Winter 2012) Math 104B: Number Theory II (Winter 01) Alina Bucur Contents 1 Review 11 Prime numbers 1 Euclidean algorithm 13 Multilicative functions 14 Linear diohantine equations 3 15 Congruences 3 Primes as sums

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCITY JORDAN SCHETTLER Abstract. The goals of this roject are to have the reader(s) gain an areciation for the usefulness of Legendre symbols and ultimately recreate Eisenstein s slick

More information

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p,

x 2 a mod m. has a solution. Theorem 13.2 (Euler s Criterion). Let p be an odd prime. The congruence x 2 1 mod p, 13. Quadratic Residues We now turn to the question of when a quadratic equation has a solution modulo m. The general quadratic equation looks like ax + bx + c 0 mod m. Assuming that m is odd or that b

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed.

Math 261 Exam 2. November 7, The use of notes and books is NOT allowed. Math 261 Eam 2 ovember 7, 2018 The use of notes and books is OT allowed Eercise 1: Polynomials mod 691 (30 ts In this eercise, you may freely use the fact that 691 is rime Consider the olynomials f( 4

More information

MAS 4203 Number Theory. M. Yotov

MAS 4203 Number Theory. M. Yotov MAS 4203 Number Theory M. Yotov June 15, 2017 These Notes were comiled by the author with the intent to be used by his students as a main text for the course MAS 4203 Number Theory taught at the Deartment

More information

Number Theory Naoki Sato

Number Theory Naoki Sato Number Theory Naoki Sato 0 Preface This set of notes on number theory was originally written in 1995 for students at the IMO level. It covers the basic background material that an IMO

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. True or false: (a) If a is a sum of three squares, and b is a sum of three squares, then so is ab. False: Consider a 14, b 2. (b) No number of the form 4 m (8n + 7) can be written

More information

MATH342 Practice Exam

MATH342 Practice Exam MATH342 Practice Exam This exam is intended to be in a similar style to the examination in May/June 2012. It is not imlied that all questions on the real examination will follow the content of the ractice

More information

MA3H1 TOPICS IN NUMBER THEORY PART III

MA3H1 TOPICS IN NUMBER THEORY PART III MA3H1 TOPICS IN NUMBER THEORY PART III SAMIR SIKSEK 1. Congruences Modulo m In quadratic recirocity we studied congruences of the form x 2 a (mod ). We now turn our attention to situations where is relaced

More information

RECIPROCITY LAWS JEREMY BOOHER

RECIPROCITY LAWS JEREMY BOOHER RECIPROCITY LAWS JEREMY BOOHER 1 Introduction The law of uadratic recirocity gives a beautiful descrition of which rimes are suares modulo Secial cases of this law going back to Fermat, and Euler and Legendre

More information

Verifying Two Conjectures on Generalized Elite Primes

Verifying Two Conjectures on Generalized Elite Primes 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009), Article 09.4.7 Verifying Two Conjectures on Generalized Elite Primes Xiaoqin Li 1 Mathematics Deartment Anhui Normal University Wuhu 241000,

More information

Mobius Functions, Legendre Symbols, and Discriminants

Mobius Functions, Legendre Symbols, and Discriminants Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,

More information

Multiplicative group law on the folium of Descartes

Multiplicative group law on the folium of Descartes Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of

More information

By Evan Chen OTIS, Internal Use

By Evan Chen OTIS, Internal Use Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there

More information

Diophantine Equations and Congruences

Diophantine Equations and Congruences International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,

More information

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013

Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 18.782 Introduction to Arithmetic Geometry Fall 2013 Lecture #10 10/8/2013 In this lecture we lay the groundwork needed to rove the Hasse-Minkowski theorem for Q, which states that a quadratic form over

More information

A Curious Property of the Decimal Expansion of Reciprocals of Primes

A Curious Property of the Decimal Expansion of Reciprocals of Primes A Curious Proerty of the Decimal Exansion of Recirocals of Primes Amitabha Triathi January 6, 205 Abstract For rime 2, 5, the decimal exansion of / is urely eriodic. For those rime for which the length

More information

Aliquot sums of Fibonacci numbers

Aliquot sums of Fibonacci numbers Aliquot sums of Fibonacci numbers Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de Méico C.P. 58089, Morelia, Michoacán, Méico fluca@matmor.unam.m Pantelimon Stănică Naval Postgraduate

More information

Sets of Real Numbers

Sets of Real Numbers Chater 4 Sets of Real Numbers 4. The Integers Z and their Proerties In our revious discussions about sets and functions the set of integers Z served as a key examle. Its ubiquitousness comes from the fact

More information

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education

CERIAS Tech Report The period of the Bell numbers modulo a prime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education CERIAS Tech Reort 2010-01 The eriod of the Bell numbers modulo a rime by Peter Montgomery, Sangil Nahm, Samuel Wagstaff Jr Center for Education and Research Information Assurance and Security Purdue University,

More information

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS #A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

Applicable Analysis and Discrete Mathematics available online at HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS

Applicable Analysis and Discrete Mathematics available online at   HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Alicable Analysis and Discrete Mathematics available online at htt://efmath.etf.rs Al. Anal. Discrete Math. 4 (010), 3 44. doi:10.98/aadm1000009m HENSEL CODES OF SQUARE ROOTS OF P-ADIC NUMBERS Zerzaihi

More information

Factorability in the ring Z[ 5]

Factorability in the ring Z[ 5] University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Dissertations, Theses, and Student Research Paers in Mathematics Mathematics, Deartment of 4-2004 Factorability in the ring

More information

When do Fibonacci invertible classes modulo M form a subgroup?

When do Fibonacci invertible classes modulo M form a subgroup? Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales

More information

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS

#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS #A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt

More information

Practice Final Solutions

Practice Final Solutions Practice Final Solutions 1. Find integers x and y such that 13x + 1y 1 SOLUTION: By the Euclidean algorithm: One can work backwards to obtain 1 1 13 + 2 13 6 2 + 1 1 13 6 2 13 6 (1 1 13) 7 13 6 1 Hence

More information

f(r) = a d n) d + + a0 = 0

f(r) = a d n) d + + a0 = 0 Math 400-00/Foundations of Algebra/Fall 07 Polynomials at the Foundations: Roots Next, we turn to the notion of a root of a olynomial in Q[x]. Definition 8.. r Q is a rational root of fx) Q[x] if fr) 0.

More information

Some sophisticated congruences involving Fibonacci numbers

Some sophisticated congruences involving Fibonacci numbers A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; July 20, 2011 and Shanghai Jiaotong University (Nov. 4, 2011 Some sohisticated congruences involving Fibonacci numbers Zhi-Wei

More information

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN

A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn

More information

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z:

NUMBER SYSTEMS. Number theory is the study of the integers. We denote the set of integers by Z: NUMBER SYSTEMS Number theory is the study of the integers. We denote the set of integers by Z: Z = {..., 3, 2, 1, 0, 1, 2, 3,... }. The integers have two oerations defined on them, addition and multilication,

More information

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally

Infinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally Infinitely Many Quadratic Diohantine Equations Solvable Everywhere Locally, But Not Solvable Globally R.A. Mollin Abstract We resent an infinite class of integers 2c, which turn out to be Richaud-Degert

More information

Solvability and Number of Roots of Bi-Quadratic Equations over p adic Fields

Solvability and Number of Roots of Bi-Quadratic Equations over p adic Fields Malaysian Journal of Mathematical Sciences 10(S February: 15-35 (016 Secial Issue: The 3 rd International Conference on Mathematical Alications in Engineering 014 (ICMAE 14 MALAYSIAN JOURNAL OF MATHEMATICAL

More information

On generalizing happy numbers to fractional base number systems

On generalizing happy numbers to fractional base number systems On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is

More information

On the Diophantine Equation x 2 = 4q n 4q m + 9

On the Diophantine Equation x 2 = 4q n 4q m + 9 JKAU: Sci., Vol. 1 No. 1, : 135-141 (009 A.D. / 1430 A.H.) On the Diohantine Equation x = 4q n 4q m + 9 Riyadh University for Girls, Riyadh, Saudi Arabia abumuriefah@yahoo.com Abstract. In this aer, we

More information

MATH 361: NUMBER THEORY ELEVENTH LECTURE

MATH 361: NUMBER THEORY ELEVENTH LECTURE MATH 361: NUMBER THEORY ELEVENTH LECTURE The subjects of this lecture are characters, Gauss sums, Jacobi sums, and counting formulas for olynomial equations over finite fields. 1. Definitions, Basic Proerties

More information

Congruences modulo 3 for two interesting partitions arising from two theta function identities

Congruences modulo 3 for two interesting partitions arising from two theta function identities Note di Matematica ISSN 113-53, e-issn 1590-093 Note Mat. 3 01 no., 1 7. doi:10.185/i1590093v3n1 Congruences modulo 3 for two interesting artitions arising from two theta function identities Kuwali Das

More information

An Estimate For Heilbronn s Exponential Sum

An Estimate For Heilbronn s Exponential Sum An Estimate For Heilbronn s Exonential Sum D.R. Heath-Brown Magdalen College, Oxford For Heini Halberstam, on his retirement Let be a rime, and set e(x) = ex(2πix). Heilbronn s exonential sum is defined

More information

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1) CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,

More information

4 Linear Recurrence Relations & the Fibonacci Sequence

4 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 information

MATH 371 Class notes/outline September 24, 2013

MATH 371 Class notes/outline September 24, 2013 MATH 371 Class notes/outline Setember 24, 2013 Rings Armed with what we have looked at for the integers and olynomials over a field, we re in a good osition to take u the general theory of rings. Definitions:

More information

THE DIOPHANTINE EQUATION x 4 +1=Dy 2

THE DIOPHANTINE EQUATION x 4 +1=Dy 2 MATHEMATICS OF COMPUTATION Volume 66, Number 9, July 997, Pages 347 35 S 005-57897)0085-X THE DIOPHANTINE EQUATION x 4 +=Dy J. H. E. COHN Abstract. An effective method is derived for solving the equation

More information

2 Asymptotic density and Dirichlet density

2 Asymptotic density and Dirichlet density 8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime

More information

Introductory Number Theory

Introductory Number Theory Introductory Number Theory Lecture Notes Sudita Mallik May, 208 Contents Introduction. Notation and Terminology.............................2 Prime Numbers.................................. 2 2 Divisibility,

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2 8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose

More information

MATH 371 Class notes/outline October 15, 2013

MATH 371 Class notes/outline October 15, 2013 MATH 371 Class notes/outline October 15, 2013 More on olynomials We now consider olynomials with coefficients in rings (not just fields) other than R and C. (Our rings continue to be commutative and have

More information

The Euler Phi Function

The Euler Phi Function The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the

More information

An Overview of Witt Vectors

An Overview of Witt Vectors An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that

More information

MAT 311 Solutions to Final Exam Practice

MAT 311 Solutions to Final Exam Practice MAT 311 Solutions to Final Exam Practice Remark. If you are comfortable with all of the following roblems, you will be very well reared for the midterm. Some of the roblems below are more difficult than

More information

Quadratic Reciprocity

Quadratic Reciprocity Quadratic Recirocity 5-7-011 Quadratic recirocity relates solutions to x = (mod to solutions to x = (mod, where and are distinct odd rimes. The euations are oth solvale or oth unsolvale if either or has

More information

ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION

ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION JOSEPH H. SILVERMAN Acknowledgements Page vii Thanks to the following eole who have sent me comments and corrections

More information

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES

#A45 INTEGERS 12 (2012) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES #A45 INTEGERS 2 (202) SUPERCONGRUENCES FOR A TRUNCATED HYPERGEOMETRIC SERIES Roberto Tauraso Diartimento di Matematica, Università di Roma Tor Vergata, Italy tauraso@mat.uniroma2.it Received: /7/, Acceted:

More information

2 Asymptotic density and Dirichlet density

2 Asymptotic density and Dirichlet density 8.785: Analytic Number Theory, MIT, sring 2007 (K.S. Kedlaya) Primes in arithmetic rogressions In this unit, we first rove Dirichlet s theorem on rimes in arithmetic rogressions. We then rove the rime

More information

t s (p). An Introduction

t s (p). An Introduction Notes 6. Quadratic Gauss Sums Definition. Let a, b Z. Then we denote a b if a divides b. Definition. Let a and b be elements of Z. Then c Z s.t. a, b c, where c gcda, b max{x Z x a and x b }. 5, Chater1

More information

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia

BOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive

More information

MA3H1 Topics in Number Theory. Samir Siksek

MA3H1 Topics in Number Theory. Samir Siksek MA3H1 Toics in Number Theory Samir Siksek Samir Siksek, Mathematics Institute, University of Warwick, Coventry, CV4 7AL, United Kingdom E-mail address: samir.siksek@gmail.com Contents Chater 0. Prologue

More information

QUADRATIC RECIPROCITY

QUADRATIC RECIPROCITY QUADRATIC RECIPROCIT POOJA PATEL Abstract. This aer is an self-contained exosition of the law of uadratic recirocity. We will give two roofs of the Chinese remainder theorem and a roof of uadratic recirocity.

More information

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2)

Almost 4000 years ago, Babylonians had discovered the following approximation to. x 2 dy 2 =1, (5.0.2) Chater 5 Pell s Equation One of the earliest issues graled with in number theory is the fact that geometric quantities are often not rational. For instance, if we take a right triangle with two side lengths

More information

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun

The Fibonacci Quarterly 44(2006), no.2, PRIMALITY TESTS FOR NUMBERS OF THE FORM k 2 m ± 1. Zhi-Hong Sun The Fibonacci Quarterly 44006, no., 11-130. PRIMALITY TESTS FOR NUMBERS OF THE FORM k m ± 1 Zhi-Hong Sun eartment of Mathematics, Huaiyin Teachers College, Huaian, Jiangsu 3001, P.R. China E-mail: zhsun@hytc.edu.cn

More information

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China

Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China Ramanuan J. 40(2016, no. 3, 511-533. CONGRUENCES INVOLVING g n (x n ( n 2 ( 2 0 x Zhi-Wei Sun Deartment of Mathematics, Naning University Naning 210093, Peole s Reublic of China zwsun@nu.edu.cn htt://math.nu.edu.cn/

More information

When do the Fibonacci invertible classes modulo M form a subgroup?

When do the Fibonacci invertible classes modulo M form a subgroup? Annales Mathematicae et Informaticae 41 (2013). 265 270 Proceedings of the 15 th International Conference on Fibonacci Numbers and Their Alications Institute of Mathematics and Informatics, Eszterházy

More information

Algebraic Number Theory

Algebraic Number Theory Algebraic Number Theory Joseh R. Mileti May 11, 2012 2 Contents 1 Introduction 5 1.1 Sums of Squares........................................... 5 1.2 Pythagorean Triles.........................................

More information

1 Integers and the Euclidean algorithm

1 Integers and the Euclidean algorithm 1 1 Integers and the Euclidean algorithm Exercise 1.1 Prove, n N : induction on n) 1 3 + 2 3 + + n 3 = (1 + 2 + + n) 2 (use Exercise 1.2 Prove, 2 n 1 is rime n is rime. (The converse is not true, as shown

More information

Small Zeros of Quadratic Forms Mod P m

Small Zeros of Quadratic Forms Mod P m International Mathematical Forum, Vol. 8, 2013, no. 8, 357-367 Small Zeros of Quadratic Forms Mod P m Ali H. Hakami Deartment of Mathematics, Faculty of Science, Jazan University P.O. Box 277, Jazan, Postal

More information

arxiv: v5 [math.nt] 22 Aug 2013

arxiv: v5 [math.nt] 22 Aug 2013 Prerint, arxiv:1308900 ON SOME DETERMINANTS WITH LEGENDRE SYMBOL ENTRIES arxiv:1308900v5 [mathnt] Aug 013 Zhi-Wei Sun Deartment of Mathematics, Nanjing University Nanjing 10093, Peole s Reublic of China

More information

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to

More information

MATH 361: NUMBER THEORY THIRD LECTURE

MATH 361: NUMBER THEORY THIRD LECTURE MATH 36: NUMBER THEORY THIRD LECTURE. Introduction The toic of this lecture is arithmetic functions and Dirichlet series. By way of introduction, consider Euclid s roof that there exist infinitely many

More information

GAUSSIAN INTEGERS HUNG HO

GAUSSIAN INTEGERS HUNG HO GAUSSIAN INTEGERS HUNG HO Abstract. We will investigate the ring of Gaussian integers Z[i] = {a + bi a, b Z}. First we will show that this ring shares an imortant roerty with the ring of integers: every

More information

We collect some results that might be covered in a first course in algebraic number theory.

We collect some results that might be covered in a first course in algebraic number theory. 1 Aendices We collect some results that might be covered in a first course in algebraic number theory. A. uadratic Recirocity Via Gauss Sums A1. Introduction In this aendix, is an odd rime unless otherwise

More information

Elliptic Curves Spring 2015 Problem Set #1 Due: 02/13/2015

Elliptic Curves Spring 2015 Problem Set #1 Due: 02/13/2015 18.783 Ellitic Curves Sring 2015 Problem Set #1 Due: 02/13/2015 Descrition These roblems are related to the material covered in Lectures 1-2. Some of them require the use of Sage, and you will need to

More information

Primes of the form ±a 2 ± qb 2

Primes of the form ±a 2 ± qb 2 Stud. Univ. Babeş-Bolyai Math. 58(2013), No. 4, 421 430 Primes of the form ±a 2 ± qb 2 Eugen J. Ionascu and Jeff Patterson To the memory of Professor Mircea-Eugen Craioveanu (1942-2012) Abstract. Reresentations

More information

DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction

DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS. 1. Introduction DIRICHLET S THEOREM ON PRIMES IN ARITHMETIC PROGRESSIONS INNA ZAKHAREVICH. Introduction It is a well-known fact that there are infinitely many rimes. However, it is less clear how the rimes are distributed

More information

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem

Combinatorics of topmost discs of multi-peg Tower of Hanoi problem Combinatorics of tomost discs of multi-eg Tower of Hanoi roblem Sandi Klavžar Deartment of Mathematics, PEF, Unversity of Maribor Koroška cesta 160, 000 Maribor, Slovenia Uroš Milutinović Deartment of

More information

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN Int. J. Number Theory 004, no., 79-85. CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN School of Mathematical Sciences Huaiyin Normal University Huaian, Jiangsu 00, P.R. China zhihongsun@yahoo.com

More information

POINTS ON CONICS MODULO p

POINTS ON CONICS MODULO p POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics

More information

Quadratic Residues, Quadratic Reciprocity. 2 4 So we may as well start with x 2 a mod p. p 1 1 mod p a 2 ±1 mod p

Quadratic Residues, Quadratic Reciprocity. 2 4 So we may as well start with x 2 a mod p. p 1 1 mod p a 2 ±1 mod p Lecture 9 Quadratic Residues, Quadratic Recirocity Quadratic Congruence - Consider congruence ax + bx + c 0 mod, with a 0 mod. This can be reduced to x + ax + b 0, if we assume that is odd ( is trivial

More information

Math 5330 Spring Notes Prime Numbers

Math 5330 Spring Notes Prime Numbers Math 5330 Sring 208 Notes Prime Numbers The study of rime numbers is as old as mathematics itself. This set of notes has a bunch of facts about rimes, or related to rimes. Much of this stuff is old dating

More information

A NICE DIOPHANTINE EQUATION. 1. Introduction

A NICE DIOPHANTINE EQUATION. 1. Introduction A NICE DIOPHANTINE EQUATION MARIA CHIARA BRAMBILLA Introduction One of the most interesting and fascinating subjects in Number Theory is the study of diophantine equations A diophantine equation is a polynomial

More information

Dirichlet s Theorem on Arithmetic Progressions

Dirichlet s Theorem on Arithmetic Progressions Dirichlet s Theorem on Arithmetic Progressions Thai Pham Massachusetts Institute of Technology May 2, 202 Abstract In this aer, we derive a roof of Dirichlet s theorem on rimes in arithmetic rogressions.

More information

Diophantine Equations

Diophantine Equations Diohantine Equations Winter Semester 018/019 University of Bayreuth Michael Stoll Contents 1. Introduction and Examles 3. Aetizers 8 3. The Law of Quadratic Recirocity 1 Print version of October 5, 018,

More information

Algebraic number theory LTCC Solutions to Problem Sheet 2

Algebraic number theory LTCC Solutions to Problem Sheet 2 Algebraic number theory LTCC 008 Solutions to Problem Sheet ) Let m be a square-free integer and K = Q m). The embeddings K C are given by σ a + b m) = a + b m and σ a + b m) = a b m. If m mod 4) then

More information

6 Binary Quadratic forms

6 Binary Quadratic forms 6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has

More information

Elementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem)

Elementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem) Elementary Proof That There are Infinitely Many Primes such that 1 is a Perfect Square (Landau's Fourth Problem) Stehen Marshall 7 March 2017 Abstract This aer resents a comlete and exhaustive roof of

More information

SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015

SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015 SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015 1. Squarefree values of olynomials: History In this section we study the roblem of reresenting square-free integers by integer olynomials.

More information

RINGS OF INTEGERS WITHOUT A POWER BASIS

RINGS OF INTEGERS WITHOUT A POWER BASIS RINGS OF INTEGERS WITHOUT A POWER BASIS KEITH CONRAD Let K be a number field, with degree n and ring of integers O K. When O K = Z[α] for some α O K, the set {1, α,..., α n 1 } is a Z-basis of O K. We

More information

PRIME NUMBERS YANKI LEKILI

PRIME NUMBERS YANKI LEKILI PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers:,2,..., These are constructed using Peano axioms. We will not get into the hilosohical questions related to this and simly assume the

More information

DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions

DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS. Contents. 1. Dirichlet s theorem on arithmetic progressions DIRICHLET S THEOREM ABOUT PRIMES IN ARITHMETIC PROGRESSIONS ANG LI Abstract. Dirichlet s theorem states that if q and l are two relatively rime ositive integers, there are infinitely many rimes of the

More information

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}.

2 Arithmetic. 2.1 Greatest common divisors. This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. 2 Arithmetic This chapter is about properties of the integers Z = {..., 2, 1, 0, 1, 2,...}. (See [Houston, Chapters 27 & 28]) 2.1 Greatest common divisors Definition 2.16. If a, b are integers, we say

More information