SYMMETRIES OF FIBONACCI POINTS, MOD m
|
|
- Joel Richardson
- 6 years ago
- Views:
Transcription
1 PATRICK FLANAGAN, MARC S. RENAULT, AND JOSH UPDIKE Abstract. Given a modulus m, we examine the set of all points (F i,f i+) Z m where F is the usual Fibonacci sequence. We graph the set in the fundamental domain [,m [, m, and observe that as m varies, sometimes the graph appears as a random scattering of points, but often it shows striking symmetry. We prove that in exactly three cases (m =,3,or 6) the graph shows symmetry by reflection across the line y = x. We prove that symmetry by rotation occurs exactly when the terms, appear half-way through a period of F (mod m). We prove that symmetry by translation can occur in essentially one way, and we provide conditions equivalent to the graph having symmetry by translation.. Introduction [ Considerpointsoftheformf i = Fi F i+ wheref istheusualfibonaccisequence, andletf = {f i : i Z}. ThesequenceF, takenmodulom, isperiodicanditfollowsthatthesetf (mod m) is finite. When we graph F (mod m) on the fundamental domain [,m [,m for a variety of values of m, we see that F (mod m) often displays striking symmetry m = 6 m = 9 m = 5 For example, F (mod 6) displays symmetry by reflection over the line y = x, F (mod 9) displays symmetry by rotation, and F (mod 5) displays translational symmetry by four nonzero translation vectors. In fact, for m in the range m, 66 values of m produce symmetry by translation in F (mod m), 63 values of m produce symmetry by rotation, and in 35 cases, both types of symmetry are present. Below we see a typical example (mod 39) where no symmetry is present and an example (mod 65) where both rotation and translation are evident. 34 VOLUME 53, NUMBER
2 m = 39 m = 65 In this article we describe criteria (Theorems., 3., and 4.3) that allow us to efficiently determine which, if any, symmetry is present in F (mod m), without having to plot all the points and look at the graph. The cases for symmetry by reflection and rotation (Theorems., 3., Corollary 3.) are fairly straightforward. However, handling symmetry by translation (Lemma 4., Theorems 4., 4.3) requires significantly more care. Of particular use in our study is the matrix U = [ U n Fn F = n. Also, U F n F i f n = f n+i for any i,n Z. n+ [ which has the property that We let π(m) denote the period of F (mod m). It follows that π(m) is also the number of points in F (mod m). Observe U k f n f n (mod m) if and only if π(m) k. It turns out that our ability to compute π(m) will play a key role in determining what kind of symmetry F (mod m) has. We list here some basic properties of π described by Wall [4 that allow us to compute π(m); these results will also be useful in our proofs. () If m >, then π(m) is even. () If m has prime factorization m = Πp e i i, then π(m) = lcm[π(pe i i ), the least common multiple of the π(p e i i ). Two corollaries follow from this. (a) π([m, n) = [π(m), π(n), where brackets denote least common multiple. (b) If n m, then π(n) π(m). (3) If p is prime and π(p) π(p ), then π(p e ) = p e π(p). (It is conjectured that π(p) π(p ) for all primes.) (4) If prime p ± (mod ), then π(p) p. If p ±3 (mod ), then π(p) p+. So, as long as we are capable of factoring m, we can use properties (), (3), and (4) to easily compute π(m). See also [ for more on the properties of π(m).. Symmetry by Reflection We see that F (mod m) has symmetry by reflection across the line y = x when m =, 3, or 6. Are there other moduli for which the graph of F (mod m) shows this kind of symmetry? FEBRUARY 5 35
3 THE FIBONACCI QUARTERLY m = m = 3 m = 6 Theorem.. F (mod m) has symmetry by reflection across the line y = x exactly when m =,3, or 6. Proof. By inspection, we see F (mod m) indeed has symmetry by reflection across y = x when m =,3, or 6. Note that [ F (mod m). Consequently, if [ / F (mod m), then we know F (mod m) does not have reflection. By inspection, we find that [ / F (mod m) for m = 4 or 5: F (mod 4) :,,,,3,,,,,... F (mod 5) :,,,,3,,3,3,,4,,4,4,3,,,,,4,,,,... If [ F (mod m), then Un [ 3 (mod m) for some n. Comparing determinants, we find ( ) n 5 (mod m), but for m 7, no n can satisfy this congruence. 3. Symmetry by Rotation We say that F (mod m) has symmetry by rotation if for any integer n, the point f n rotated counter-clockwise one quarter turn about the origin, namely [ fn, is also in F (mod m). While our definition is in terms of rotation about the origin, the repeating nature of the fundamental domain [,m [,m in the xy-plane makes rotation appear also about the point ( m, m ) m = 8 m = m = 57 Theorem 3.. F (mod ) has symmetry by rotation. For m >, F (mod m) has symmetry by rotation if and only if fπ(m) [ (mod m). Proof. By inspection, F (mod ) has symmetry by rotation, so we may assume m 3 and consequently, π(m) is even. For ease of notation, let π = π(m); all congruences in this proof are taken modulo m. Assume F (mod m) has symmetry by rotation. Then, since [ F (mod m), we must also have [ [ F (mod m). Since U [ = = f, we must have f F (mod m), and 36 VOLUME 53, NUMBER
4 so U n f f for some < n < π. Thus, U n f U n ( f ) f, and it follows that π n. Since < n < π, we find n = π/. Thus, fπ [. Conversely, assume f π [ [. We will show that for any integer n, the point fn is also in F (mod m). Two observations are needed. First, [ [ F k ( ) f k = = k+ [ F k ( ) F k+ ( ) k = k F k ( ) k+ f k. (3.) Second, since fπ [ we get U π/ [. Thus, [ U nπ/ ( ) n ( ) n. (3.) Thus, f n π n = U nπ/ f n So, for any integer n, [ [ = U nπ/ ( ) n+ ( ) n [ ( ) = n+ ( ) n [ = f n. f n by (3.), with k = n+ f n by (3.) fn f n π n F (mod m). While Theorem 3. does not allow us to determine whether rotation exists by analyzing only the modulus, it does give us a computationally efficient way to determine whether or not F (mod m) has rotation. Once we know π(m), it is easy to determine if U π(m)/ [ (mod m). However, knowing whether or not F (mod m) has rotation does allow us to draw some immediate conclusions about whether or not F (mod n) has rotation, where n is a divisor or multiple of m. Corollary 3.. If F (mod m) has symmetry by rotation and n m, then F (mod n) also has symmetry by rotation. Proof. WeknowF (mod ) hassymmetrybyrotation, soassumem,n >. Sincem,n > and n m, we have π(n) π(m) and both periods are even. Thus, π(n) π(m), and so π(m) = k π(n) for some integer k. Now fπ(m) [ (mod m) fπ(m) [ (mod n) fk π(n) [ (mod n). From the last congruence, k can t be even, so k = t+ for some integer t. Now as needed. f k π(n) f tπ(n)+ π(n) fπ(n) [ (mod n) The converse of this corollary is not true. For example, both F (mod 5) and F (mod 7) exhibit rotation, but F (mod 35) does not. The contrapositive of the corollary is interesting to consider: if F (mod m) does not show rotation, then we know that no multiple of m can produce rotation. For example, we find that F (mod 4) does not have rotation, and so m (mod 4) implies F (mod m) does not have FEBRUARY 5 37
5 THE FIBONACCI QUARTERLY rotation. Here are all the values of m < for which F (mod m) does not have rotation but for which F (mod n) does have rotation for all factors n of m: m = 4,,5,9,,9,3,35,39,5,59,69,7,79,9,... So, modulo any multiple of any member of the above list, F will not exhibit rotation. For any remaining modulus less than, F will display rotation. 4. Symmetry by Translation We say that F (mod m) has symmetry by translation if there is some nonzero vector t Z m suchthatforeveryintegerithereisacorrespondingintegerj(i)suchthatf i +t f j(i) (mod m). Curiously, whenever F (mod m) has symmetry by translation, there are four nonzero translations and they are multiples of [,[ 3,[3 4, and [4. We can see this in the three examples below m = 35 m = 35 m = 95 Lemma 4.. Let T denote the set of all translations of F (mod m). Then T is a group under addition and T is closed under left multiplication by U. Proof. Indeed, by virtue of what a translation is, the set of all translation is closed under addition and integer multiplication. Ofmore interest to usis thefact that if t is atranslation, then Utmust also beatranslation. If there is an index function j(i) so that f i + t f j(i) (mod m) for all i, then Uf i + Ut Uf j(i) (mod m) for all i. In other words, f i+ + Ut f j(i)+ (mod m) for all i. As f j(i)+ F (mod m) for all i, we concluded Ut is a translation. The following theorem shows us the form that translations must take, assuming F (mod m) has translation. Theorem 4.. If F (mod m) has translation, then 5 m and the set of all translations is T = { [, m 5 [, m 5 [ 3, m 5 [3 4, m 5 [4 }. Proof. Assumethehypothesisandsupposethatt = [ t t isanonzerotranslationoff (mod m). We begin by establishing several preliminary results. () The only prime p for which F (mod p) has nonzero translation is p = 5. () If p is prime, p m, and p 5, then p t. (3) If (t,t,m) =, then m = 5. We will see () () (3), and (3) is useful in proving the theorem. () If p is prime and t is a nonzero translation of F (mod p), then consider the cyclic subgroup of translations generated by t, t = {,t,t,3t,...,(p )t}. Now F (mod p) is a finite set with cardinality π(p), and we can create a subset S F (mod p) maximal with respect to the property that no point in S can be translated by a vector in t to produce 38 VOLUME 53, NUMBER
6 another point in S. Then the points in S, translated under the p translations in t result in p disjoint sets whose union is F (mod p). Consequently, p π(p). It is known (see, e.g., [ or [) for primes p ± (mod ) that π(p) p, and for primes p ±3 (mod ) that π(p) p +. These results, combined with our observation that p π(p), show that p has neither of these forms; the only primes remaining are p = and p = 5. By inspection, F (mod ) has no nonzero translations but F (mod 5) does (see picture below). () Suppose t is a nonzero translation of F (mod m) and there is a prime p 5 such that p m. Then for every integer i there is some integer j(i) such that f i +t f j(i) (mod m). As p m, this implies f i +t f j(i) (mod p) for all i, and so t is a translation of F (mod p). But p 5, so by () we conclude t (mod p). (3) Assume t = [ t t is a nonzero translation of F (mod m) and that (t,t,m) =. If p m and p 5, then by (), p t so (t,t,m) p. Thus, the only prime dividing m is 5; we conclude m = 5 e for some e. Since (t,t,5 e ) =, either t or t is coprime to 5. Assume without loss of generality that (t,5) =. (If not, then relabel t as Ut = [ t t +t and note that Ut is a translation by Lemma 4..) Now t has an inverse modulo 5 e ; let α = t t. Now t t = [ α T. Also, U [ α = [ α α+ T, and α[ α = [ α α T, and as a result, [ α α [ α α+ = [ α α T. We will show that α α (mod 5 e ). For ease of notation, let β = α α. It is known [3 that one period of F (mod m) has at most four zeros, and so there are at most four points of the form [ x F (mod m). Since [ F (mod 5e ) and [ β T (mod 5 e ), we see [, [ β+, [ [ [,, β+ 3β+ 4β+ F (mod 5 e ). Thus, among these five points, there must be a repeat. [ [ [, β+, 3β+, or 4β+ is Moreover, since [ β T (mod 5 e ), one of the points [ β+ congruent to [ (mod 5e ). Consequently, either β,β,3β, or 4β is congruent to (mod 5 e ). In all of these cases, we can conclude β (mod 5 e ). The congruence α α has a solution modulo 5 (namely, α 3), but by inspection, there is no solution modulo 5. Hence, α α (mod 5 e ) has a solution only when e =. Thus, m = 5 as needed, and the proof of (3) is complete. We turn now to the statement of the theorem, and assume that t = [ t t is a nonzero translation of F (mod m). Thus, there is some index function j(i) such that f i +t f j(i) (mod m) for all i Z. Let d = (t,t,m); write t = dt and m = dm. If m =, then m = d, so t = mt. But then t (mod m), a contradiction. Thus, m. Since m, and (t,t,m ) =, we find that t (mod m ). Moreover, we see f i +t f j(i) (mod m ), so t is a nonzero translation of F (mod m ). By (3), we deduce that m = 5. Thus, 5 m, and t = m 5 t is a nonzero translation of F (mod 5). FEBRUARY 5 39
7 THE FIBONACCI QUARTERLY The translations of F (mod 5) are [,[,[ 3,[3 4, and [4. Since m 5 (mod 5), it is invertible mod 5, and so (m 5 ) m 5 t t is a nonzero translation mod 5. By inspection, the nonzero translations modulo 5 are [,[ 3,[3 4, and [4. Thus, t {[,[ 3,[3 4,[4 }, and t = m { [ [ [ [ m m m 3 m 4 5 t,,, } If t is any one of the above four nonzero vectors, then all four must be translation vectors, as the above set is equivalent to { t,ut,u t,u 3 t }. By the preceding theorem, F (mod m) can have symmetry by translation only if m is a multiple of 5. Experimentally, it seems that for most multiples of 5, F (mod m) does indeed exhibit translation. Here are the multiples of 5 in the range 5 m 5 for which F (mod m) does not have translation: m = 55,,55,65,5,,35,3,33,355,385,4,44,465,495. We turn now to those criteria on m that are equivalent to the existence of translation in F (mod m). Theorem 4.3. Write m = 5 e n with e and gcd(5,n) =. F (mod m) has translation if and only if e and 5 e π(n). Proof. Assume F (mod 5 e n) has translation. We know from Theorem 4. that e and the set of all translations of F (mod 5 e n) is T = { [, m 5 [, m 5 [ 3, m 5 [3 4, m 5 [4 }. Let k be the least positive integer such that f k f T. Since F (mod 5 e n) has translation, k < π(5 e n). Modulo 5 e n, for any t T we see U 4 t t, and so, U 4 (f k f ) f k f, that is, f k+4 f 4 f k f. Thus, f k+4 f k f 4 f. Since f 4 f = [ 3 4, we find Uk [ 3 4 [3 4. This tells us that the Lucas sequence,,3,4,... taken modulo 5 e n has a period that divides k. Letting π L (m) denote the period of the Lucas sequence modulo m, we get π L (5 e n) k. Thus, π L (5 e n) < π(5 e n). Three results due to Wall [4, Theorems, 9, 5 are useful to us here, and will allow us to express π L (5 e n) in terms of π(n). First, π(5 e n) = [π(5 e ),π(n) and π L (5 e n) = [π L (5 e ),π L (n). Second, π L (5 e ) = 5 π(5e ) and π L (n) = π(n). Third, π(5 e ) = 4 5 e. Applying these results, we see [ π L (5 e n) = [π L (5 e ),π L (n) = 5 π(5e ),π(n) = [ 4 5 e,π(n). Now if 5 e π(n), then [4 5 e,π(n) = [4 5 e,π(n), and so π L (5 e n) = π(5 e n). However, this contradicts the fact that π L (5 e n) < π(5 e n), noted earlier. Thus, 5 e π(n), as needed. Conversely, let us assume e and 5 e π(n), and we will show that F (mod m) has a nonzero translation. Since 5 e π(n) we find π L (5 e n) = [4 5 e,π(n) = 5 [4 5e,π(n) = 4 VOLUME 53, NUMBER
8 5 π(5e n). Let k = 5 π(5e n). With congruences taken modulo 5 e n, we see U k [ 3 4 [3 4 U k (f 4 f ) f 4 f f k+4 f k f 4 f f k+4 f 4 f k f. Let t = f k f. Observe that t and U 4 t t. Also, since k = 5 π(5e n) = 5 [4 5e,π(n), we see 4 k, and so U k t t. Claim: t is a translation of F (mod 5 e n). We will prove the claim by showing that f i +t f i k+i for all i. We first observe that f rk f rt, r (4.) since f rk f = r j= (f jk+k f jk ) = r j= Ujk (f k f ) = r j= (Uk ) j t r j=t = rt. Since f 5k f, it also follows that 5t. Next, observe that U 5 = [ = 3I + 5U. Consequently, Ut U5 t = (3I + 5U)t = 3t+U(5t) 3t. Thus, U i t 3 i t, i. (4.) Now we have f i k+i f i = U i (f i k f ) U i i t by (4.) i 3 i t by (4.) = 6 i t t since 6t t. Thus, f i +t f i k+i for all i, and t must be a translation of F (mod 5 e n). For example, F (mod 55) does not have translation since 55 = 5 and 5 π() =. On the other hand, F (mod 85) does have translation. In this case, 85 = 5 33, and 5 π(33) = 4. References [ M. S. Renault, The Fibonacci Sequence Under Various Moduli, Master s Thesis, Wake Forest University, [ S. Vajda, Fibonacci & Lucas Numbers, and the Golden Section, Ellis Horwood Limited, Chichester, England, 989. [3 J. Vinson, The relation of the period modulo m to the rank of apparition of m in the Fibonacci sequence, The Fibonacci Quarterly,. (963), [4 D. D. Wall, Fibonacci series modulo m, The American Mathematical Monthly, 67 (96), MSC: B39, B5, A7 Department of Mathematics, Shippensburg University, Shippensburg, PA 757 (corresponding author) Department of Mathematics, Shippensburg University, 87 Old Main Drive, Shippensburg, PA 757 address: msrenault@ship.edu Department of Mathematics, Shippensburg University, Shippensburg, PA 757 FEBRUARY 5 4
SOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
More informationSOLUTIONS FOR PROBLEM SET 4
SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationTwo congruences involving 4-cores
Two congruences involving 4-cores ABSTRACT. The goal of this paper is to prove two new congruences involving 4- cores using elementary techniques; namely, if a 4 (n) denotes the number of 4-cores of n,
More informationSolutions for the Practice Questions
Solutions for the Practice Questions Question 1. Find all solutions to the congruence 13x 12 (mod 35). Also, answer the following questions about the solutions to the above congruence. Are there solutions
More informationLUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS
LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS DANIEL BACZKOWSKI, OLAOLU FASORANTI, AND CARRIE E. FINCH Abstract. In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of
More informationPractice Midterm 2 Solutions
Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s
More informationMATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.
MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem 8-3-2014 The Chinese Remainder Theorem gives solutions to systems of congruences with relatively prime moduli The solution to a system of congruences with relatively prime
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More information#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick
#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS Thomas A. Plick tomplick@gmail.com Received: 10/5/14, Revised: 9/17/16, Accepted: 1/23/17, Published: 2/13/17 Abstract We show that out of the
More informationSolutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00
18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?
More informationPRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania
#A52 INTEGERS 17 (2017) PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Lawrence Somer Department of
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey
ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey Shah [1] and Bruckner [2] have considered the problem
More informationAn interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,
Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence
More informationChapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationMath 255 Spring 2017 Solving x 2 a (mod n)
Math 255 Spring 2017 Solving x 2 a (mod n) Contents 1 Lifting 1 2 Solving x 2 a (mod p k ) for p odd 3 3 Solving x 2 a (mod 2 k ) 5 4 Solving x 2 a (mod n) for general n 9 1 Lifting Definition 1.1. Let
More informationNumber Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory
- Divisibility - Congruences June 23, 2014 Primes - Divisibility - Congruences Definition A positive integer p is prime if p 2 and its only positive factors are itself and 1. Otherwise, if p 2, then p
More informationThe congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.
Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us
More information12. 6 jokes are minimal.
Pigeonhole Principle Pigeonhole Principle: When you organize n things into k categories, one of the categories has at least n/k things in it. Proof: If each category had fewer than n/k things in it then
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
More informationSolutions to Exercises Chapter 6: Latin squares and SDRs
Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,
More informationLECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI
LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining
More information6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method
Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.
More informationPrimitive Roots. Chapter Orders and Primitive Roots
Chapter 5 Primitive Roots The name primitive root applies to a number a whose powers can be used to represent a reduced residue system modulo n. Primitive roots are therefore generators in that sense,
More informationUniversity of British Columbia. Math 312, Midterm, 6th of June 2017
University of British Columbia Math 312, Midterm, 6th of June 2017 Name (please be legible) Signature Student number Duration: 90 minutes INSTRUCTIONS This test has 7 problems for a total of 100 points.
More informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More informationTHE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LXI, 2015, f.2 THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m BY FLORIAN LUCA and AUGUSTINE O.
More informationIntroduction to Modular Arithmetic
1 Integers modulo n 1.1 Preliminaries Introduction to Modular Arithmetic Definition 1.1.1 (Equivalence relation). Let R be a relation on the set A. Recall that a relation R is a subset of the cartesian
More informationFermat s little theorem. RSA.
.. Computing large numbers modulo n (a) In modulo arithmetic, you can always reduce a large number to its remainder a a rem n (mod n). (b) Addition, subtraction, and multiplication preserve congruence:
More informationSolutions to the problems from Written assignment 2 Math 222 Winter 2015
Solutions to the problems from Written assignment 2 Math 222 Winter 2015 1. Determine if the following limits exist, and if a limit exists, find its value. x2 y (a) The limit of f(x, y) = x 4 as (x, y)
More informationMAT Modular arithmetic and number theory. Modular arithmetic
Modular arithmetic 1 Modular arithmetic may seem like a new and strange concept at first The aim of these notes is to describe it in several different ways, in the hope that you will find at least one
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences
More informationAn elementary study of Goldbach Conjecture
An elementary study of Goldbach Conjecture Denise Chemla 26/5/2012 Goldbach Conjecture (7 th, june 1742) states that every even natural integer greater than 4 is the sum of two odd prime numbers. If we
More informationCMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013
CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 4 October 2013 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the Inverse
More informationDistribution of Primes
Distribution of Primes Definition. For positive real numbers x, let π(x) be the number of prime numbers less than or equal to x. For example, π(1) = 0, π(10) = 4 and π(100) = 25. To use some ciphers, we
More informationGoldbach Conjecture (7 th june 1742)
Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition
More informationMath 3560 HW Set 6. Kara. October 17, 2013
Math 3560 HW Set 6 Kara October 17, 013 (91) Let I be the identity matrix 1 Diagonal matrices with nonzero entries on diagonal form a group I is in the set and a 1 0 0 b 1 0 0 a 1 b 1 0 0 0 a 0 0 b 0 0
More informationCMPSCI 250: Introduction to Computation. Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012
CMPSCI 250: Introduction to Computation Lecture #14: The Chinese Remainder Theorem David Mix Barrington 24 February 2012 The Chinese Remainder Theorem Infinitely Many Primes Reviewing Inverses and the
More informationPermutation group and determinants. (Dated: September 19, 2018)
Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter
More informationWilson s Theorem and Fermat s Theorem
Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson
More informationA Study of Relationship Among Goldbach Conjecture, Twin prime and Fibonacci number
A Study of Relationship Among Goldbach Conjecture, Twin and Fibonacci number Chenglian Liu Department of Computer Science, Huizhou University, China chenglianliu@gmailcom May 4, 015 Version 48 1 Abstract
More informationVariations on a Theme of Sierpiński
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.4.4 Variations on a Theme of Sierpiński Lenny Jones Department of Mathematics Shippensburg University Shippensburg, Pennsylvania
More informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
More informationTilings with T and Skew Tetrominoes
Quercus: Linfield Journal of Undergraduate Research Volume 1 Article 3 10-8-2012 Tilings with T and Skew Tetrominoes Cynthia Lester Linfield College Follow this and additional works at: http://digitalcommons.linfield.edu/quercus
More informationQuadratic Residues. Legendre symbols provide a computational tool for determining whether a quadratic congruence has a solution. = a (p 1)/2 (mod p).
Quadratic Residues 4--015 a is a quadratic residue mod m if x = a (mod m). Otherwise, a is a quadratic nonresidue. Quadratic Recirocity relates the solvability of the congruence x = (mod q) to the solvability
More informationCollection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02
Collection of rules, techniques and theorems for solving polynomial congruences 11 April 2012 at 22:02 Public Polynomial congruences come up constantly, even when one is dealing with much deeper problems
More informationHarmonic numbers, Catalan s triangle and mesh patterns
Harmonic numbers, Catalan s triangle and mesh patterns arxiv:1209.6423v1 [math.co] 28 Sep 2012 Sergey Kitaev Department of Computer and Information Sciences University of Strathclyde Glasgow G1 1XH, United
More informationMinimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field
Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Gretchen L. Matthews and Justin D. Peachey Abstract. The norm-trace function field is a generalization
More informationTHE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS
THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master
More informationA theorem on the cores of partitions
A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t
More informationDiscrete Math Class 4 ( )
Discrete Math 37110 - Class 4 (2016-10-06) 41 Division vs congruences Instructor: László Babai Notes taken by Jacob Burroughs Revised by instructor DO 41 If m ab and gcd(a, m) = 1, then m b DO 42 If gcd(a,
More informationby Michael Filaseta University of South Carolina
by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every
More informationb) Find all positive integers smaller than 200 which leave remainder 1, 3, 4 upon division by 3, 5, 7 respectively.
Solutions to Exam 1 Problem 1. a) State Fermat s Little Theorem and Euler s Theorem. b) Let m, n be relatively prime positive integers. Prove that m φ(n) + n φ(m) 1 (mod mn). Solution: a) Fermat s Little
More informationDVA325 Formal Languages, Automata and Models of Computation (FABER)
DVA325 Formal Languages, Automata and Models of Computation (FABER) Lecture 1 - Introduction School of Innovation, Design and Engineering Mälardalen University 11 November 2014 Abu Naser Masud FABER November
More informationNumber Theory/Cryptography (part 1 of CSC 282)
Number Theory/Cryptography (part 1 of CSC 282) http://www.cs.rochester.edu/~stefanko/teaching/11cs282 1 Schedule The homework is due Sep 8 Graded homework will be available at noon Sep 9, noon. EXAM #1
More informationNUMBER THEORY AMIN WITNO
NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia
More informationALGEBRA: Chapter I: QUESTION BANK
1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationThe Sign of a Permutation Matt Baker
The Sign of a Permutation Matt Baker Let σ be a permutation of {1, 2,, n}, ie, a one-to-one and onto function from {1, 2,, n} to itself We will define what it means for σ to be even or odd, and then discuss
More informationZhanjiang , People s Republic of China
Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,
More informationarxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY
CYCLIC PERMUTATIONS AVOIDING PAIRS OF PATTERNS OF LENGTH THREE arxiv:1805.05196v3 [math.co] 4 Dec 2018 MIKLÓS BÓNA MICHAEL CORY Abstract. We enumerate cyclic permutations avoiding two patterns of length
More informationand problem sheet 7
1-18 and 15-151 problem sheet 7 Solutions to the following five exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Friday nd November 018. Problem 1 Let A N + and
More informationGoldbach conjecture (1742, june, the 7 th )
Goldbach conjecture (1742, june, the 7 th ) We note P the prime numbers set. P = {p 1 = 2, p 2 = 3, p 3 = 5, p 4 = 7, p 5 = 11,...} remark : 1 P Statement : Each even number greater than 2 is the sum of
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 43 The Multiplication Principle Theorem Let S be a set of k-tuples (s 1,
More informationAlgorithms. Abstract. We describe a simple construction of a family of permutations with a certain pseudo-random
Generating Pseudo-Random Permutations and Maimum Flow Algorithms Noga Alon IBM Almaden Research Center, 650 Harry Road, San Jose, CA 9510,USA and Sackler Faculty of Eact Sciences, Tel Aviv University,
More informationCHAPTER 2. Modular Arithmetic
CHAPTER 2 Modular Arithmetic In studying the integers we have seen that is useful to write a = qb + r. Often we can solve problems by considering only the remainder, r. This throws away some of the information,
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More informationYet Another Triangle for the Genocchi Numbers
Europ. J. Combinatorics (2000) 21, 593 600 Article No. 10.1006/eujc.1999.0370 Available online at http://www.idealibrary.com on Yet Another Triangle for the Genocchi Numbers RICHARD EHRENBORG AND EINAR
More informationTROMPING GAMES: TILING WITH TROMINOES. Saúl A. Blanco 1 Department of Mathematics, Cornell University, Ithaca, NY 14853, USA
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY x (200x), #Axx TROMPING GAMES: TILING WITH TROMINOES Saúl A. Blanco 1 Department of Mathematics, Cornell University, Ithaca, NY 14853, USA sabr@math.cornell.edu
More informationPartizan Kayles and Misère Invertibility
Partizan Kayles and Misère Invertibility arxiv:1309.1631v1 [math.co] 6 Sep 2013 Rebecca Milley Grenfell Campus Memorial University of Newfoundland Corner Brook, NL, Canada May 11, 2014 Abstract The impartial
More information12th Bay Area Mathematical Olympiad
2th Bay Area Mathematical Olympiad February 2, 200 Problems (with Solutions) We write {a,b,c} for the set of three different positive integers a, b, and c. By choosing some or all of the numbers a, b and
More informationMath 319 Problem Set #7 Solution 18 April 2002
Math 319 Problem Set #7 Solution 18 April 2002 1. ( 2.4, problem 9) Show that if x 2 1 (mod m) and x / ±1 (mod m) then 1 < (x 1, m) < m and 1 < (x + 1, m) < m. Proof: From x 2 1 (mod m) we get m (x 2 1).
More informationREU 2006 Discrete Math Lecture 3
REU 006 Discrete Math Lecture 3 Instructor: László Babai Scribe: Elizabeth Beazley Editors: Eliana Zoque and Elizabeth Beazley NOT PROOFREAD - CONTAINS ERRORS June 6, 006. Last updated June 7, 006 at :4
More informationCutting a Pie Is Not a Piece of Cake
Cutting a Pie Is Not a Piece of Cake Julius B. Barbanel Department of Mathematics Union College Schenectady, NY 12308 barbanej@union.edu Steven J. Brams Department of Politics New York University New York,
More informationCalculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating by hand.
Midterm #2: practice MATH 311 Intro to Number Theory midterm: Thursday, Oct 20 Please print your name: Calculators will not be permitted on the exam. The numbers on the exam will be suitable for calculating
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationModular Arithmetic. Kieran Cooney - February 18, 2016
Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.
More informationOdd king tours on even chessboards
Odd king tours on even chessboards D. Joyner and M. Fourte, Department of Mathematics, U. S. Naval Academy, Annapolis, MD 21402 12-4-97 In this paper we show that there is no complete odd king tour on
More informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
More informationNumber Theory. Konkreetne Matemaatika
ITT9131 Number Theory Konkreetne Matemaatika Chapter Four Divisibility Primes Prime examples Factorial Factors Relative primality `MOD': the Congruence Relation Independent Residues Additional Applications
More information6.2 Modular Arithmetic
6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through
More informationKnow how to represent permutations in the two rowed notation, and how to multiply permutations using this notation.
The third exam will be on Monday, November 21, 2011. It will cover Sections 5.1-5.5. Of course, the material is cumulative, and the listed sections depend on earlier sections, which it is assumed that
More informationMA/CSSE 473 Day 9. The algorithm (modified) N 1
MA/CSSE 473 Day 9 Primality Testing Encryption Intro The algorithm (modified) To test N for primality Pick positive integers a 1, a 2,, a k < N at random For each a i, check for a N 1 i 1 (mod N) Use the
More informationFORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS
FORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS IOULIA N. BAOULINA AND PIETER MOREE To the memory of Prof. Wolfgang Schwarz Abstract. Let S k (m) := 1 k + 2 k +... + (m 1) k denote a power sum. In 2011
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationGame Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games
Game Theory and Algorithms Lecture 19: Nim & Impartial Combinatorial Games May 17, 2011 Summary: We give a winning strategy for the counter-taking game called Nim; surprisingly, it involves computations
More informationOn shortening u-cycles and u-words for permutations
On shortening u-cycles and u-words for permutations Sergey Kitaev, Vladimir N. Potapov, and Vincent Vajnovszki October 22, 2018 Abstract This paper initiates the study of shortening universal cycles (ucycles)
More informationRestricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers
Restricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers arxiv:math/0109219v1 [math.co] 27 Sep 2001 Eric S. Egge Department of Mathematics Gettysburg College 300 North Washington
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 10 1 of 17 The order of a number (mod n) Definition
More informationMark Kozek. December 7, 2010
: in : Whittier College December 7, 2010 About. : in Hungarian mathematician, 1913-1996. Interested in combinatorics, graph theory, number theory, classical analysis, approximation theory, set theory,
More informationCongruence. Solving linear congruences. A linear congruence is an expression in the form. ax b (modm)
Congruence Solving linear congruences A linear congruence is an expression in the form ax b (modm) a, b integers, m a positive integer, x an integer variable. x is a solution if it makes the congruence
More informationPRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma
PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement
More informationCaltech Harvey Mudd Mathematics Competition February 20, 2010
Mixer Round Solutions Caltech Harvey Mudd Mathematics Competition February 0, 00. (Ying-Ying Tran) Compute x such that 009 00 x (mod 0) and 0 x < 0. Solution: We can chec that 0 is prime. By Fermat s Little
More informationIntroduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.
THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT Introduction The rst Chinese problem in indeterminate analysis is encountered in a book written by the Chinese mathematician Sun Tzi. The problem
More informationGreedy Flipping of Pancakes and Burnt Pancakes
Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,
More informationPermutations. = f 1 f = I A
Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has
More information