THE CHINESE REMAINDER CLOCK
|
|
- Priscilla Hancock
- 6 years ago
- Views:
Transcription
1 THE CHINESE REMAINDER CLOCK ANTONELLA PERUCCA WHAT TIME IS IT? Consider an analog clock: from the location of the minute hand we determine a number between and 59, and from the location of the hour hand we determine a number between and. We present an alternative based on the Chinese Remainder Theorem, which we call the Chinese Remainder Clock. More generally, we geometrically illustrate the Chinese Remainder Theorem via analog clocks with several hands. 4 FIGURE. It is :7. Look at the position of the filled-in dots: the inner two rings give the -remainder and the 4-remainder of the hour ( = + = 4 + ), while the outer three rings give the - remainder, the 4-remainder, and the 5-remainder of the minutes (7 = 9 + = = ). We have to tell the time, namely the hours (some number H from to ) and the minutes (some number M from to 59). Because of the Chinese Remainder Theorem to determine H it suffices to know its remainders after division by and by 4 while to determine M it suffices to know its remainders after division by, by 4, and by 5. In short: once we know those remainders, we are able to tell the time. This is the simple mathematical idea behind the Chinese Remainder Clock.
2 ANTONELLA PERUCCA The possible n-remainders are:,,..., n. If we go through the list of integers and divide them by n, then the n-remainders repeat cyclically. This is because adding some multiple of n does not change the n-remainder. For later use: the difference between a number and its n-remainder is a multiple of n. The vertices of an n-gon can be used to describe the n-remainders. This is what we have in the analog clock, where n = for the hours and n = 6 for the minutes. In the Chinese Remainder Clock we have instead n = and n = 4 for the hours (the inner part of the dial) while for the minutes we have n =, n = 4, and n = 5 (the outer part of the dial). As in the usual analog clock the top vertex corresponds to and the next number comes clockwise. The Chinese Remainder Clock is thus an analog clock with five moving hands. One has to perform a small mental calculation for reading the time: some strategies are explained in the last section. To determine the number which leaves the displayed remainders, one can proceed by trial and error. Thus everyone who is familiar with division can read the time. Moreover, developing an efficient method for reading the time is an exercise in arithmetic algorithms (even for non-mathematicians). Different people prefer different strategies according to which kind of mental calculation they do best, and shortcuts are possible for special configurations on the dial. One working Chinese Remainder Clock is online at [6] (note that it takes the time of your electronic device so it works fine with time-zones and daylight saving time). In general, one moving hand in a clock describes a discrete periodic phenomenon, where finitely many situations repeat cyclically. Thus the Chinese Remainder Clock illustrates the meaning of the Chinese Remainder Theorem, which (in short) is the following: a periodic phenomenon with period n amounts to the interaction of periodic phenomena whose periods are prime powers, namely the prime powers appearing in the factorization of n. We explain this in detail in the next section: the discussion gives insight into the Chinese Remainder Theorem and provides a proof of this result without equations. The Chinese Remainder Theorem is part of modular arithmetic and, being a fundamental result, is to be found in most university texts about algebra, elementary number theory, and cryptography, see for example [, Chapter ], [, Chapter 8], or [4, Chapter ]. Online resources are for example [] and [7]. Although modular arithmetic is also called arithmetic of the clock there seems to be no well-known reference where the Chinese Remainder Theorem is presented in terms of rotations or periodic phenomena. Finally, as a historical curiosity, we mention that the Maya Calendar also combines rotations with different periods (see for example [5] for a description). THE CHINESE REMAINDER THEOREM REVISITED The Chinese Remainder Theorem for rotations. Consider a circle with one marked point on it, and fix some positive integer m. At every time unit let the point move on the
3 THE CHINESE REMAINDER CLOCK circle of /m-th of the full angle clockwise. The phenomenon is periodic: after m time units the point is back to the initial position, and this is the fundamental period. There are m positions for the point, each occuring once in every period. For convenience we suppose in the figures that the position at time is the top. Now consider two such rotations, with integer parameters m and m. There are m m possible configurations for the pair of marked points, but in general not all of them occur because the rotations are simultaneous (this is evident if m = m ). The fundamental period is the smallest positive time at which both points are back to the initial position so it is the least common multiple lcm(m, m ). Each configuration occurs at most once in every period because getting the same configuration implies that both points did full turns. From this we can deduce that the fundamental period equals the number of occurring configurations. As a special case, if m and m are coprime then the fundamental period is the product m m and every configuration occurs. For example with m = 4 and m = 5 the fundamental period is and every configuration occurs, while with m = 4 and m = 6 the fundamental period is so exactly out of the 4 configurations occur, see Figures and. FIGURE. With m = 4 and m = 5, the configurations at time,, and 7. FIGURE. With m = 4 and m = 6, the configurations at time 7, and an impossible configuration. The above statements can be easily generalized by considering n rotations with integer parameters m to m n. The fundamental period is lcm(m,..., m n ) and this equals the number of occurring configurations for the n-tuple of marked points. As a special case we get:
4 4 ANTONELLA PERUCCA The Chinese Remainder Theorem for rotations. Let m, m,..., m n be pairwise coprime positive integers. For each integer m in this set consider a circle with one marked point on it, which at every time unit rotates of /m-th of the full angle clockwise. The fundamental period for this phenomenon is the product m m n, and every possible configuration for the n-tuple of marked points occurs exactly once in every period. Even if the integer parameters are not coprime, the configuration of the marked points determines the time inside a period because it occurs at most once. The Chinese Remainder Theorem for periodic phenomena. A discrete periodic phenomenon (finitely many situations repeat cyclically) can be seen as a rotation with as many steps as the fundamental period. So we also have: The Chinese Remainder Theorem for periodic phenomena. If m, m,..., m n are pairwise coprime positive integers then a periodic phenomenon with period m m n amounts to the collection of simultaneous periodic phenomena whose periods are m to m n. As a special case, if m is an integer greater than, a periodic phenomenon with period m can be described by periodic phenomena whose periods are prime powers, namely the prime powers appearing in the factorization of m. The Chinese Remainder Theorem for lists of remainders. The usual formulation of the Chinese Remainder Theorem deals with remainders for the division, which are given by a congruence system. We state this result more directly: The Chinese Remainder Theorem for lists of remainders. Let m, m,..., m n be pairwise coprime positive integers. For every integer consider the n-tuple of its remainders after division by m to m n. Two integers produce the same n-tuple if and only if they leave the same remainder after division by the product m m n, and all n-tuples consisting of remainders after division by m to m n are produced. Since the integers from to (m m n ) leave different remainders after division by m m n we get the following corollary: Let m, m,..., m n be pairwise coprime positive integers. An integer from to (m m n ) is uniquely determined by the n-tuple of its remainders after division by m to m n. Without the assumption of coprimality we need to consider the integers from to lcm(m,..., m n ) instead. Indeed two integers give rise to the same n-tuple if and only if they leave the same remainder after division by lcm(m,..., m n ). Not necessarily all n-tuples consisting of remainders after division by m to m n do occur, but exactly lcm(m,..., m n ) of them.
5 THE CHINESE REMAINDER CLOCK 5 To show these assertions we can make use of the corresponding results for rotations, once we have explained how lists of remainders correspond to configurations of marked points. Consider one rotation as above with parameter m: the m positions for the marked point can be named clockwise with the integers from to m, starting with the position at time. We thus identify the positions with the m-remainders in such a way that for every integer a the position at time a corresponds to the m-remainder of a. The same can be done by considering rotations with parameters m to m n : the configuration of the n marked points at time a corresponds to the n-tuple of remainders of a. Note that the time inside a period is given by the remainder of a after division by the fundamental period i.e. by the product m m n if the parameters are pairwise coprime and in general by lcm(m,..., m n ). An impossible configuration for the marked points corresponds to an impossible list of remainders, see Figure 5 for an example. 4 FIGURE 4. With m = 4 and m = 5, the configuration at time 7 corresponds to the 4-remainder and the 5-remainder. 5 4 FIGURE 5. With m = 4 and m = 6, this configuration is impossible and indeed no integer leaves 4-remainder and 6-remainder.
6 6 ANTONELLA PERUCCA READING THE CHINESE REMAINDER CLOCK Reading the hours. The Chinese Remainder Clock tells us the hours, namely some number H from to. We can uniquely determine H as soon as we know its remainders after division by and by 4. The -remainder H is either, or and it is described by the position of the purple sphere (the smallest circle). The 4-remainder H 4 is either,,, or and it is described by the position of the orange sphere (the second circle). The zero remainder is on top and the next remainder comes clockwise, see Figure 6. FIGURE 6. The -remainder is, the 4-remainder is. We can find H by trial and error with at most three attempts. Indeed the difference H H 4 is a multiple of 4 hence H can only be H 4 H H These numbers have different -remainders and we select the one whose -remainder equals H. For the example in Figure 6 we get either, 6, or and we select because the -remainder must be. We can also compute H as follows: Indeed we can write H is the remainder after division by of H 4 + H 4 9. H 4 + H 4 9 = H + (H + H 4 ) = H (H + H 4 ), hence this number has the correct remainders after division by and by 4. Taking the -remainder of the number does not alter this property and outputs a number in the range from to. For the example in Figure 6 we get the -remainder of, which is. Other methods for finding H are possible and the reader is encouraged to develop thier own strategy. Reading the minutes. The Chinese Remainder Clock tells us the minutes, namely some number M from to 59. We can uniquely determine M as soon as we know its remainders after division by, by 4, and by 5. The -remainder M is either,, or and it is described by the position of the green sphere (the third circle). The 4-remainder M 4 is either,,, or and it is described
7 THE CHINESE REMAINDER CLOCK 7 by the position of the blue sphere (the fourth circle). The 5-remainder M 5 is either,,,, or 4 and it is described by the position of the red sphere (the fifth circle). The zero remainder is on top and the next remainder comes clockwise, see Figure 7. 4 FIGURE 7. The -remainder is, the 4-remainder is, the 5-remainder is. First of all, the parity of M is the same as the parity of M 4 (because M M 4 is a multiple of 4). So we know if M is even or odd. Moreover, the last cipher of M has the same parity of M and it is either M 5 or M 5 +5 (because M equals M 5 plus a multiple of 5). For the example in Figure 7 the last cipher of M is odd and it is either or 7 so it must be 7. Once we know the last cipher of M we can find M by trial and error with at most six attemps. We may even reduce to three attemps: if M and its last cipher C have the same 4-remainder then M is one of and otherwise M is one of C C + C + 4, C + C + C + 5. The reason for this is that adding does not change the 4-remainder, while adding does. For the example in Figure 7 we have C = 7 and M 4 =, so M is one of 7,7, or 47: we select 7 because the -remainder must be. We could also use this formula: M is the remainder after division by 6 of M 4 + M M 5 6. Indeed this number is also of the form M + (M 9 + M M 5 ) = M (M + M 4 + M 5 9) = M (M 8 + M M 5 7)
8 8 ANTONELLA PERUCCA so it has the correct remainders after division by, 4, and 5. This does not change by taking the 6-remainder so we find a number M from to 59 as desired. For the example in Figure 7 we get the 6-remainder of 7, which is 7. There are several other recipes for determining M. Moreover, shortcuts are possible for special configurations, for example if two numbers between M, M 4 and M 5 are equal. Which strategy is the best is a matter of personal preference, and the reader is welcome to develop their own one! FIGURE 8. The displayed times are :, :, :58, and : respectively. QUESTIONS FOR THE READER About the Chinese Remainder Clock: () Looking at the dial, how can we quickly tell if M is even? How can we quickly tell if M is divisible by? () At what times are all five spheres on the vertical line passing through the center of the dial?
9 THE CHINESE REMAINDER CLOCK 9 () Suppose that M 4 and M 5 are equal. Which are the three possible values for M? (4) How does a given configuration on the dial change after 6 minutes? About possible variants of the Chinese Remainder Clock: (5) Identify all possible Chinese Remainder Clocks for H:M clocks. In the standard Chinese Remainder Clock we have factored = 4 and 6 = 4 5 but there are other factorisations that produce in the same way a good clock i.e. such that on the dial configurations occur for the hours and 6 for the minutes. (6) Now consider the previous question for a 4-hour clock, i.e. the hour H goes from to. What does this change about possible Chinese Remainder Clocks? Acknowledgements. Many thanks go to Keith Conrad for the wonderful idea of drawing circles on the dial, to Albrecht Beutelspacher for pointing out the interesting example of the Maya Calendar and to Tom Fiore and Ellen Eischen for several very helpful remarks that improved the clarity of the exposition. A special thank goes to to the nonmathematicians who had fun with the Chinese Remainder Clock and supported this project. Last but not least we sincerely thank the anonymous referee for the last two questions for the reader and for suggesting to expand the discussion about the Chinese Remainder Theorem. Summary: We present an analog clock with five hands that illustrates the Chinese Remainder Theorem, and which can be understood also by non-mathematicians. Moreover, we interpret that result in terms of rotations and prove it without equations. REFERENCES [] Chinese Remainder Theorem. In Encyclopædia Britannica. Retrieved April, 6, from [] H. Davenport, The Higher Arithmetic: An Introduction to the Theory of Numbers. Sixth edition. Cambridge University Press, 99. [] G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Sixth edition. Oxford University Press, Oxford, 8. [4] K. Ireland and M. Rosen, A classical Introduction to Modern Number Theory. Second edition. Graduate Texts in Mathematics, 84. Springer-Verlag, New York, 99. [5] P. M. Rice, Maya Calendar Origins: Monuments, Mythistory, and the Materialization of Time. University of Texas Press, Austen, 7. [6] A. Perucca, The Chinese Remainder Clock Fakultaeten/nat_Fak_I/perucca/CRC.html [7] E. W. Weisstein, Chinese Remainder Theorem, From MathWorld A Wolfram Web Resource.
Chinese Remainder Theorem explained with rotations
Chinese Remainder Theorem explained with rotations Reference: Antonella Perucca, The Chinese Remainder Clock, The College Mathematics Journal, 2017, Vol. 48, No. 2, pp. 82-89. 2 One step-wise rotation
More informationA SURVEY OF PRIMALITY TESTS
A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic
More informationTHESIS. Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University
The Hasse-Minkowski Theorem in Two and Three Variables THESIS Presented in Partial Fulfillment of the Requirements for the Degree Master of Science in the Graduate School of The Ohio State University By
More informationarxiv:math/ v1 [math.nt] 9 Aug 2004
arxiv:math/0408107v1 [math.nt] 9 Aug 2004 ELEMENTARY RESULTS ON THE BINARY QUADRATIC FORM a 2 + ab + b 2 UMESH P. NAIR Abstract. This paper examines with elementary proofs some interesting properties of
More informationWHAT IS SPECIAL ABOUT THE DIVISORS OF 24?
WHAT IS SPECIAL ABOUT THE DIVISORS OF 24? SUNIL K. CHEBOLU It is a miracle that the human mind can string a thousand arguments together without getting itself into contradictions. 1. Introduction Eugene
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationA Note on Cyclotomic Integers
To the memory of Alan Thorndike, former professor of physics at the University of Puget Sound and a dear friend, teacher and mentor. A Note on Cyclotomic Integers Nicholas Phat Nguyen 1 Abstract. In this
More informationMATH 361: NUMBER THEORY FOURTH LECTURE
MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the
More informationax b mod m. has a solution if and only if d b. In this case, there is one solution, call it x 0, to the equation and there are d solutions x m d
10. Linear congruences In general we are going to be interested in the problem of solving polynomial equations modulo an integer m. Following Gauss, we can work in the ring Z m and find all solutions to
More informationMATH 2112/CSCI 2112, Discrete Structures I Winter 2007 Toby Kenney Homework Sheet 5 Hints & Model Solutions
MATH 11/CSCI 11, Discrete Structures I Winter 007 Toby Kenney Homework Sheet 5 Hints & Model Solutions Sheet 4 5 Define the repeat of a positive integer as the number obtained by writing it twice in a
More informationMODULAR ARITHMETIC KEITH CONRAD
MODULAR ARITHMETIC KEITH CONRAD. Introduction We will define the notion of congruent integers (with respect to a modulus) and develop some basic ideas of modular arithmetic. Applications of modular arithmetic
More informationProof of Infinite Number of Triplet Primes. Stephen Marshall. 28 May Abstract
Proof of Infinite Number of Triplet Primes Stephen Marshall 28 May 2014 Abstract This paper presents a complete and exhaustive proof that an Infinite Number of Triplet Primes exist. The approach to this
More informationIRREDUCIBILITY TESTS IN F p [T ]
IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are
More informationLEGENDRE S THEOREM, LEGRANGE S DESCENT
LEGENDRE S THEOREM, LEGRANGE S DESCENT SUPPLEMENT FOR MATH 370: NUMBER THEORY Abstract. Legendre gave simple necessary and sufficient conditions for the solvablility of the diophantine equation ax 2 +
More informationCOMP424 Computer Security
COMP424 Computer Security Prof. Wiegley jeffw@csun.edu Rivest, Shamir & Adelman (RSA) Implementation 1 Relatively prime Prime: n, is prime if its only two factors are 1 and n. (and n 1). Relatively prime:
More informationCharacters and triangle generation of the simple Mathieu group M 11
SEMESTER PROJECT Characters and triangle generation of the simple Mathieu group M 11 Under the supervision of Prof. Donna Testerman Dr. Claude Marion Student: Mikaël Cavallin September 11, 2010 Contents
More informationCHAPTER 1. REVIEW: NUMBERS
CHAPTER. REVIEW: NUMBERS Yes, mathematics deals with numbers. But doing math is not number crunching! Rather, it is a very complicated psychological process of learning and inventing. Just like listing
More information[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives
[Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime
More informationOn the Sum of Corresponding Factorials and Triangular Numbers: Some Preliminary Results
Asia Pacific Journal of Multidisciplinary Research, Vol 3, No 4, November 05 Part I On the Sum of Corresponding Factorials and Triangular Numbers: Some Preliminary Results Romer C Castillo, MSc Batangas
More information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More informationFermat s Last Theorem for Regular Primes
Fermat s Last Theorem for Regular Primes S. M.-C. 22 September 2015 Abstract Fermat famously claimed in the margin of a book that a certain family of Diophantine equations have no solutions in integers.
More information1 Modular Arithmetic Grade Level/Prerequisites: Time: Materials: Preparation: Objectives: Navajo Nation Math Circle Connection
1 Modular Arithmetic Students will explore a type of arithmetic that results from arranging numbers in circles instead of on a number line. Students make and prove conjectures about patterns relating to
More informationThe Chinese Remainder Theorem
Chapter 5 The Chinese Remainder Theorem 5.1 Coprime moduli Theorem 5.1. Suppose m, n N, and gcd(m, n) = 1. Given any remainders r mod m and s mod n we can find N such that N r mod m and N s mod n. Moreover,
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationMATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.
MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same
More informationProof of Beal s Conjecture
Proof of Beal s Conjecture Stephen Marshall 26 Feb 14 Abstract: This paper presents a complete and exhaustive proof of the Beal Conjecture. The approach to this proof uses the Fundamental Theorem of Arithmetic
More informationMATHEMATICS EXTENDED ESSAY
MATHEMATICS EXTENDED ESSAY How does the RSA algorithm function and why is it used in modern communication? Candidate Name: Murtuza Kainan Candidate Session Number: 003077006 Word Count: 3908 1 P a g e
More informationAsymptotic formulae for the number of repeating prime sequences less than N
otes on umber Theory and Discrete Mathematics Print ISS 30 532, Online ISS 2367 8275 Vol. 22, 206, o. 4, 29 40 Asymptotic formulae for the number of repeating prime sequences less than Christopher L. Garvie
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationREAL NUMBERS. Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b.
REAL NUMBERS Introduction Euclid s Division Algorithm Any positive integer a can be divided by another positive integer b in such a way that it leaves a remainder r that is smaller than b. Fundamental
More informationSequences. 1. Number sequences. 2. Arithmetic sequences. Consider the illustrated pattern of circles:
Sequences 1. Number sequences Consider the illustrated pattern of circles: The first layer has just one blue ball. The second layer has three pink balls. The third layer has five black balls. The fourth
More informationarxiv: v1 [math.co] 27 Aug 2015
P-positions in Modular Extensions to Nim arxiv:1508.07054v1 [math.co] 7 Aug 015 Tanya Khovanova August 31, 015 Abstract Karan Sarkar In this paper, we consider a modular extension to the game of Nim, which
More informationSUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by
SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationOdd-powered triples and Pellian sequences
Notes on Number Theory and Discrete Mathematics Vol. 8, 0, No. 3, 8 Odd-powered triples and Pellian sequences J. V. Leyendekkers and A. G. Shannon Faculty of Science, The University of Sydney Sydney, NSW
More informationA Classical Introduction to Modern Number Theory
Kenneth Ireland Michael Rosen A Classical Introduction to Modern Number Theory Second Edition Springer Contents Preface to the Second Edition Preface v vii CHAPTER 1 Unique Factorization 1 1 Unique Factorization
More informationFour Basic Sets. Divisors
Four Basic Sets Z = the integers Q = the rationals R = the real numbers C = the complex numbers Divisors Definition. Suppose a 0 and b = ax, where a, b, and x are integers. Then we say a divides b (or
More informationMATH Fundamental Concepts of Algebra
MATH 4001 Fundamental Concepts of Algebra Instructor: Darci L. Kracht Kent State University April, 015 0 Introduction We will begin our study of mathematics this semester with the familiar notion of even
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationModular numbers and Error Correcting Codes. Introduction. Modular Arithmetic.
Modular numbers and Error Correcting Codes Introduction Modular Arithmetic Finite fields n-space over a finite field Error correcting codes Exercises Introduction. Data transmission is not normally perfect;
More informationCYCLICITY OF (Z/(p))
CYCLICITY OF (Z/(p)) KEITH CONRAD 1. Introduction For each prime p, the group (Z/(p)) is cyclic. We will give seven proofs of this fundamental result. A common feature of the proofs that (Z/(p)) is cyclic
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationAlgebra. Modular arithmetic can be handled mathematically by introducing a congruence relation on the integers described in the above example.
Coding Theory Massoud Malek Algebra Congruence Relation The definition of a congruence depends on the type of algebraic structure under consideration Particular definitions of congruence can be made for
More informationKnow the meaning of the basic concepts: ring, field, characteristic of a ring, the ring of polynomials R[x].
The second exam will be on Friday, October 28, 2. It will cover Sections.7,.8, 3., 3.2, 3.4 (except 3.4.), 4. and 4.2 plus the handout on calculation of high powers of an integer modulo n via successive
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationIn this initial chapter, you will be introduced to, or more than likely be reminded of, a
1 Sets In this initial chapter, you will be introduced to, or more than likely be reminded of, a fundamental idea that occurs throughout mathematics: sets. Indeed, a set is an object from which every mathematical
More informationSection 11 Direct products and finitely generated abelian groups
Section 11 Direct products and finitely generated abelian groups Instructor: Yifan Yang Fall 2006 Outline Direct products Finitely generated abelian groups Cartesian product Definition The Cartesian product
More informationAn Approach to Hensel s Lemma
Irish Math. Soc. Bulletin 47 (2001), 15 21 15 An Approach to Hensel s Lemma gary mcguire Abstract. Hensel s Lemma is an important tool in many ways. One application is in factoring polynomials over Z.
More informationRepresenting 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 informationEquidivisible consecutive integers
& Equidivisible consecutive integers Ivo Düntsch Department of Computer Science Brock University St Catherines, Ontario, L2S 3A1, Canada duentsch@cosc.brocku.ca Roger B. Eggleton Department of Mathematics
More informationError Correcting Codes Prof. Dr. P Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore
(Refer Slide Time: 00:54) Error Correcting Codes Prof. Dr. P Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore Lecture No. # 05 Cosets, Rings & Fields
More informationWhen is n a member of a Pythagorean Triple?
Abstract When is n a member of a Pythagorean Triple? Dominic and Alfred Vella ' Theorem is perhaps the best known result in the whole of mathematics and yet many things remain unknown (or perhaps just
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod
More informationChapter 5. Modular arithmetic. 5.1 The modular ring
Chapter 5 Modular arithmetic 5.1 The modular ring Definition 5.1. Suppose n N and x, y Z. Then we say that x, y are equivalent modulo n, and we write x y mod n if n x y. It is evident that equivalence
More informationUNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY
UNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY ISAAC M. DAVIS Abstract. By associating a subfield of R to a set of points P 0 R 2, geometric properties of ruler and compass constructions
More informationDiscrete Structures Lecture Solving Congruences. mathematician of the eighteenth century). Also, the equation gggggg(aa, bb) =
First Introduction Our goal is to solve equations having the form aaaa bb (mmmmmm mm). However, first we must discuss the last part of the previous section titled gcds as Linear Combinations THEOREM 6
More informationQUADRATIC CONGRUENCES FOR COHEN - EISENSTEIN SERIES.
QUADRATIC CONGRUENCES FOR COHEN - EISENSTEIN SERIES. P. GUERZHOY The notion of quadratic congruences was introduced in the recently appeared paper [1]. In this note we present another, somewhat more conceptual
More informationPublic Key Encryption
Public Key Encryption KG October 17, 2017 Contents 1 Introduction 1 2 Public Key Encryption 2 3 Schemes Based on Diffie-Hellman 3 3.1 ElGamal.................................... 5 4 RSA 7 4.1 Preliminaries.................................
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More informationTHE CONGRUENT NUMBER PROBLEM
THE CONGRUENT NUMBER PROBLEM KEITH CONRAD 1. Introduction A right triangle is called rational when its legs and hypotenuse are all rational numbers. Examples of rational right triangles include Pythagorean
More information17.1 Binary Codes Normal numbers we use are in base 10, which are called decimal numbers. Each digit can be 10 possible numbers: 0, 1, 2, 9.
( c ) E p s t e i n, C a r t e r, B o l l i n g e r, A u r i s p a C h a p t e r 17: I n f o r m a t i o n S c i e n c e P a g e 1 CHAPTER 17: Information Science 17.1 Binary Codes Normal numbers we use
More informationFERMAT S TEST KEITH CONRAD
FERMAT S TEST KEITH CONRAD 1. Introduction Fermat s little theorem says for prime p that a p 1 1 mod p for all a 0 mod p. A naive extension of this to a composite modulus n 2 would be: for all a 0 mod
More informationChakravala - a modern Indian method. B.Sury
Chakravala - a modern Indian method BSury Indian Statistical Institute Bangalore, India sury@isibangacin IISER Pune, India Lecture on October 18, 2010 1 Weil Unveiled What would have been Fermat s astonishment
More informationSlides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Spring 2006
Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Spring 2006 1 / 1 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 2.4 2.6 of Rosen Introduction I When talking
More informationNumber Theory and Group Theoryfor Public-Key Cryptography
Number Theory and Group Theory for Public-Key Cryptography TDA352, DIT250 Wissam Aoudi Chalmers University of Technology November 21, 2017 Wissam Aoudi Number Theory and Group Theoryfor Public-Key Cryptography
More informationThe RSA Cipher and its Algorithmic Foundations
Chapter 1 The RSA Cipher and its Algorithmic Foundations The most important that is, most applied and most analyzed asymmetric cipher is RSA, named after its inventors Ron Rivest, Adi Shamir, and Len Adleman.
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationKINDERGARTEN Correlation of Project Learning Tree s PreK 8 Environmental Education Activity Guide with the Common Core Standards for Mathematics
KINDERGARTEN with the Common Core Stards for Mathematics KEY: + Check marks with a plus, mean the activity has a strong correlation to the stard PLT PreK 8 EE Activity 1. Know number names the count sequence
More information4 PRIMITIVE ROOTS Order and Primitive Roots The Index Existence of primitive roots for prime modulus...
PREFACE These notes have been prepared by Dr Mike Canfell (with minor changes and extensions by Dr Gerd Schmalz) for use by the external students in the unit PMTH 338 Number Theory. This booklet covers
More informationScott Taylor 1. EQUIVALENCE RELATIONS. Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that:
Equivalence MA Relations 274 and Partitions Scott Taylor 1. EQUIVALENCE RELATIONS Definition 1.1. Let A be a set. An equivalence relation on A is a relation such that: (1) is reflexive. That is, (2) is
More informationElliptic Curves. Kenneth A. Ribet. PARC Forum October 17, UC Berkeley
UC Berkeley PARC Forum October 17, 2008 In talking about elliptic curves, one can do no better than to quote the Yale mathematician Serge Lang (1927 2005), who began one of his many monographs as follows:
More information1: Please compute the Jacobi symbol ( 99
SCORE/xx: Math 470 Communications Cryptography NAME: PRACTICE FINAL Please show your work write only in pen. Notes are forbidden. Calculators, all other electronic devices, are forbidden. Brains are encouraged,
More informationDigit Reversal Without Apology
Digit Reversal Without Apology Lara Pudwell Rutgers University Piscataway, NJ 08854 lpudwell@math.rutgers.edu In A Mathematician s Apology [1] G. H. Hardy states, 8712 and 9801 are the only four-figure
More informationLesson 8: Why Stay with Whole Numbers?
Student Outcomes Students use function notation, evaluate functions for inputs in their domains, and interpret statements that use function notation in terms of a context. Students create functions that
More informationLecture 3: Miscellaneous Techniques
Lecture 3: Miscellaneous Techniques Rajat Mittal IIT Kanpur In this document, we will take a look at few diverse techniques used in combinatorics, exemplifying the fact that combinatorics is a collection
More informationSUMS OF SQUARES WUSHI GOLDRING
SUMS OF SQUARES WUSHI GOLDRING 1. Introduction Here are some opening big questions to think about: Question 1. Which positive integers are sums of two squares? Question 2. Which positive integers are sums
More informationNUMBER THEORY. Anwitaman DATTA SCSE, NTU Singapore CX4024. CRYPTOGRAPHY & NETWORK SECURITY 2018, Anwitaman DATTA
NUMBER THEORY Anwitaman DATTA SCSE, NTU Singapore Acknowledgement: The following lecture slides are based on, and uses material from the text book Cryptography and Network Security (various eds) by William
More informationDivision Algorithm B1 Introduction to the Division Algorithm (Procedure) quotient remainder
A Survey of Divisibility Page 1 SECTION B Division Algorithm By the end of this section you will be able to apply the division algorithm or procedure Our aim in this section is to show that for any given
More informationRational Points on Conics, and Local-Global Relations in Number Theory
Rational Points on Conics, and Local-Global Relations in Number Theory Joseph Lipman Purdue University Department of Mathematics lipman@math.purdue.edu http://www.math.purdue.edu/ lipman November 26, 2007
More informationCONGRUENT NUMBERS AND ELLIPTIC CURVES
CONGRUENT NUMBERS AND ELLIPTIC CURVES JIM BROWN Abstract. In this short paper we consider congruent numbers and how they give rise to elliptic curves. We will begin with very basic notions before moving
More informationGRE Quantitative Reasoning Practice Questions
GRE Quantitative Reasoning Practice Questions y O x 7. The figure above shows the graph of the function f in the xy-plane. What is the value of f (f( ))? A B C 0 D E Explanation Note that to find f (f(
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationCOT 3100 Applications of Discrete Structures Dr. Michael P. Frank
University of Florida Dept. of Computer & Information Science & Engineering COT 3100 Applications of Discrete Structures Dr. Michael P. Frank Slides for a Course Based on the Text Discrete Mathematics
More informationVector Spaces. Chapter 1
Chapter 1 Vector Spaces Linear algebra is the study of linear maps on finite-dimensional vector spaces. Eventually we will learn what all these terms mean. In this chapter we will define vector spaces
More information1 Notes for lectures during the week of the strike Part 2 (10/25)
1 Notes for lectures during the week of the strike Part 2 (10/25) Last time, we stated the beautiful: Theorem 1.1 ( Three reflections theorem ). Any isometry (of R 2 ) is the composition of at most three
More informationThe Humble Sum of Remainders Function
DRAFT VOL. 78, NO. 4, OCTOBER 2005 1 The Humble Sum of Remainders Function Michael Z. Spivey Samford University Birmingham, Alabama 35229 mzspivey@samford.edu The sum of divisors function is one of the
More informationCS 5319 Advanced Discrete Structure. Lecture 9: Introduction to Number Theory II
CS 5319 Advanced Discrete Structure Lecture 9: Introduction to Number Theory II Divisibility Outline Greatest Common Divisor Fundamental Theorem of Arithmetic Modular Arithmetic Euler Phi Function RSA
More informationCRYPTOGRAPHY AND LARGE PRIMES *
CRYPTOGRAPHY AND LARGE PRIMES * B. Hartley University of Manchester, England, and National University of Singapore The word "cryptography" derives from Greek and means "secret writing". Since ancient times,
More informationNumber theory (Chapter 4)
EECS 203 Spring 2016 Lecture 10 Page 1 of 8 Number theory (Chapter 4) Review Questions: 1. Does 5 1? Does 1 5? 2. Does (129+63) mod 10 = (129 mod 10)+(63 mod 10)? 3. Does (129+63) mod 10 = ((129 mod 10)+(63
More informationFor your quiz in recitation this week, refer to these exercise generators:
Monday, Oct 29 Today we will talk about inverses in modular arithmetic, and the use of inverses to solve linear congruences. For your quiz in recitation this week, refer to these exercise generators: GCD
More information3 The fundamentals: Algorithms, the integers, and matrices
3 The fundamentals: Algorithms, the integers, and matrices 3.4 The integers and division This section introduces the basics of number theory number theory is the part of mathematics involving integers
More informationOn Anti-Elite Prime Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.9.4 On Anti-Elite Prime Numbers Tom Müller Institut für Cusanus-Forschung an der Universität und der Theologischen Fakultät Trier
More informationNOTES ON 2009 MEMORANDUM
NOTES ON 2009 MEMORANDUM These notes are necessarily brief and often formal and symbolic. Many questions could be answered using primitive methods, e.g. If today is Wednesday, what day of the week will
More informationK. Ireland, M. Rosen A Classical Introduction to Modern Number Theory, Springer.
Chapter 1 Number Theory and Algebra 1.1 Introduction Most of the concepts of discrete mathematics belong to the areas of combinatorics, number theory and algebra. In Chapter?? we studied the first area.
More informationGrade 8 Chapter 7: Rational and Irrational Numbers
Grade 8 Chapter 7: Rational and Irrational Numbers In this chapter we first review the real line model for numbers, as discussed in Chapter 2 of seventh grade, by recalling how the integers and then the
More informationChapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations
Chapter 9 Mathematics of Cryptography Part III: Primes and Related Congruence Equations Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 9.1 Chapter 9 Objectives
More information