Mersenne and Fermat Numbers
|
|
- Bartholomew Walters
- 6 years ago
- Views:
Transcription
1 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 2 CHARLES LEYTEM 1. THE LITTLE FERMAT THEOREM We start by recalling the Little Fermat theorem and a useful roerty. Proosition For any rime number and any ositive integer a, a a is divisible by, in other words a a (mod ). Proof. We use induction on a. The roerty is true for a = 1. If it holds for a, then ( ) (a + 1) = a j a + 1 a + 1 (mod ). j j=0 Corollary If is a rime and a an integer such that gcd(a, ) = 1, then a 1 1 (mod ). Problem The sum of some given integers is Can the sum of their seventh owers be equal to 1996 (to 1998)? Solution. Modulo 7 the sum Σ of the integers is equal to the sum Σ 7 of their seventh owers. As 1998 is not congruent to 1492 modulo 7, Σ 7 can t be equal to Suose the sum Σ doesn t contain terms which are larger than 3 in absolute value, i.e. it is of the form Σ = a 1 + b ( 1) + c 2 + d ( 2) = (a b) + (c d)2. Then Σ 7 = a 1 + b ( 1) + c d ( 2) 7 = (a b) + (c d)2 7. Solving (a b) + (c d)2 = 1492 (a b) + (c d)2 7 = 1996 we find a b = 1484 and c d = 4. Thus a ossible solution is Σ = with 1 occurring 1484 times. Proosition Let a and be integers. If a m 1 (mod ) and a n 1 (mod ) then a (m,n) 1 (mod ). Proof. We may suose m > n. Write m = nq + r (0 r < n). Then 1 a m a nq+r (a n ) q a r a r. Reeat the rocedure using (n, r) instead of (m, n). Continuing this way we eventually end u with a (m,n) 1 (mod ). 2. MERSENNE NUMBERS In this section we roose some roblems related to numbers of the form 2 n 1. Problem Show that for even n > 4 the number 2 n 1 is the roduct of at least three rime numbers, two of which at least are distinct. Solution. We can write n = 2k and 2 n 1 = (2 k 1)(2 k + 1). First note that (2 k 1) and (2 k + 1) cannot have common rime factors, as they differ by 2. Thus there are at least two distinct rime factors as n > 4. Among the three consecutive numbers (2 k 1), 2 k, (2 k +1) one is divisible by 3, and it must be the first one or the last one. Thus 2 n 1 has at least three rime factors as n > 4. Problem Show that 2 n 1 cannot be a erfect (roer) ower of a rime.
3 NUMBER THEORY 3 Solution. Suose we can write 2 n 1 = k (k > 1, rime). Obviously is odd. Suose k is odd. Then we have 2 n = k + 1 = ( + 1)( k 1 k ) where the second factor contains k odd terms, and thus is odd, which is imossible. Thus k must be even. Write k = 2l. Now 2 n 1 = k 2 n 2 = 2l 1 Factoring out we get 2(2 n 1 1) = ( l 1)( l + 1). As is odd, the right hand side is divisible by 4 whereas the left hand side is only divisible by 2, a contradiction. Problem Determine all rime numbers such that 2 1. Solution. Suose there exists such a rime number. Obviously must be odd (mod ). By Fermat (mod ). By roosition 1.0.4, 2 ( 1,) 1 (mod ). As ( 1, n) = 1 we get (mod ) = 1, a contradiction. Thus there are no such rimes. Problem Determine all ositive integers n such that n 2 n 1. Solution. Obviously n = 1 is a solution. Suose n > 1. Denote the smallest rime in the rime decomosition of n. Obviously is odd. n 2 n 1 2 n 1 2 n 1 (mod ). By Fermat (mod ). By roosition 1.0.4, 2 ( 1,n) 1 (mod ). But the rimes in the rime factorization of 1 are smaller than those in the factorization of n. Therefore ( 1, n) = 1 imlying (mod ) = 1, a contradiction. Problem Determine all ositive integers k > 1,n 1, n 2,..., n k such that n 1 2 n 2 1, n 2 2 n 3 1,..., n k 2 n 1 1. Solution. Obviously n 1 = n 2 = = n k = 1 is a solution for any k. Also if one n j equals 1 then all n i must be 1. Let us suose n i > 1 for all i. Denote the smallest rime in the rime decomositions of the n i (i = 1,..., k). Note is odd. Suose is a factor of n j : n j 2 n j n j n j+1 1 (mod ). By Fermat (mod ). Therefore 2 ( 1,n j+1) 1 (mod ). But the rimes in the rime factorization of 1 are smaller than those in the factorization of n j+1. Therefore ( 1, n j+1 ) = 1 imlying (mod ) = 1, a contradiction. Problem Determine all rimes such that a erfect square. Solution. Obviously > 2. We have the factorization = ( )( ). (the Fermat quotient of with base 2) is Both factors are relatively rime as they are odd and differ by 2. As the rime divides one of them, the other one has to be a square for to be a square. So deending on the case we have to solve the equation 2 x 1 = k 2 resectively 2 x + 1 = k 2 with k an odd integer. We consider the two cases searately.
4 4 CHARLES LEYTEM 2 x + 1 = k 2. This is equivalent to 2 x = k x = (k 1)(k + 1). Thus k 1 = 2 i and k + 1 = 2 j (i, j integer), leading to 2 j 2 i = 2 2 i 1 (2 j i 1) = 1 with unique solution i = 1 and j = 2. We get x = 3 and finally = 7. We check that = 9, a square. 2 x 1 = k 2. If x > 1 it is immediate that there is no solution, as 2 x 1 3 (mod 4) and k 2 1 (mod 4). So we assume x = 1 and get the solution k = 1 leading to = 3. Again we check that = 1, a square. Problem Determine all rimes such that Solution. Oen roblem. Primes such that are called Wieferich rimes. The only known ones are = 1093 and = FERMAT NUMBERS In this section we roose some roblems related to numbers of the form 2 n + 1. Problem Show that the number (2 4n+2 + 1)/5 is comosite for n > 1 integer. Solution. As 2 4n+2 = 4 2n+1 ( 1) 2n+1 1 (mod 5), we have 5 2 4n+2. We have the factorization 2 4n = (2 2n+1 2 n+1 + 1)(2 2n n+1 + 1) and therefore 5 must divide one of the factors. For the smallest factor we have 2 2n+1 2 n = 2 n+1 (2 n 1) = 25 and it follows that (2 4n+2 + 1)/5 is comosite. Problem Show that 2 n + 1 cannot be a erfect (roer) ower of a rime unless n = 3. Solution. Suose we can write 2 n + 1 = k for rime. Obviously is odd. As we have 2 n = k 1 = ( 1)( k 1 + k ) where the second factor contains k odd terms, k = 2l must be even. Then 2 n + 1 = 2l 2 n = 2l 1 = ( l 1)( l + 1) which is only ossible if l 1 = 2 and l + 1 = 4. Therefore l = 3 and = 3. Also 2 m = 2 4 yields m = 3. Therefore the unique solution is = 3 2. Problem Show that for even n > 6 the number 2 n 1 is the roduct of at least three distinct rime numbers. Solution. As in roblem we write n = 2k, 2 n 1 = (2 k 1)(2 k + 1). We also recall that (2 k 1) and (2 k + 1) cannot have common rime factors. Thus if 2 n 1 has only two distinct rime factors we must have that each factor is a rime or a erfect ower of a rime. But this is imossible as 3 is a roer divisor of at least one of the factors, and by roblems and none of the factors can be a roer erfect ower of a rime. Problem Show that that there is an infinity of ositive integers n such that n 2 n + 1. Solution. First solution: We consider the integers n = 3 k. We roceed by induction. If k = 1 then then n = 3 and = 9. Suose the roerty is true for k, i.e. 2 3k + 1 is divisible by 3 k. As we have 2 3k = (2 3k + 1)(2 2 3k 2 3k + 1)
5 we have to show that 2 2 3k 2 3k + 1 is divisible by 3. But NUMBER THEORY k 2 3k + 1 = 4 3k 8 3k (mod 3) Second solution: We show that n 2 n n n As n 2 n + 1, we can write 2 n + 1 = kn with k odd. Therefore 2 n + 1 (2 n ) k + 1 = 2 nk + 1 = 2 2n Problem Find all rime numbers such that Solution. The Fermat theorem imlies that 2 2. So we get (2 2) = 3. Therefore = 3 is the only solution. Problem Show that all ositive integers n > 1 such that n 2 n +1 are of the form n = 3 k m with k 0 and m rime to 3. Solution Obviously n is odd. Denote the smallest rime in the rime decomosition of n: n 2 n n n 1 (mod ) 2 2n 1 (mod ). By Fermat (mod ). Therefore 2 ( 1,2n) 1 (mod ). But the rimes in the rime factorization of 1 are smaller than those in the factorization of n. Therefore ( 1, n) = 2 imlying (mod ) = 3. Problem Show that 2 3k + 1 is divisible by 3 k+1 and not by 3 k+2. Solution. We roceed by induction. Suose the roerty is true for k, i.e. 2 3k + 1 is exactly divisible by 3 k+1. As we have 2 3k = (2 3k + 1)(2 32k 2 3k + 1) we have to show that 2 32k 2 3k + 1 is divisible by 3 and not by 9. As 2 2 3k 2 3k + 1 = 4 3k 8 3k (mod 3) 2 2 3k 2 3k + 1 = 8 2 3k 1 8 3k (mod 9) 2 32k 2 3k + 1 is divisible by 3 and not by 9. Now we are reared to solve: 4. AN IMO PROBLEM Problem Find all ositive integers n such that 2n +1 n 2 is an integer. (IMO, 1990) Solution. In view of roblem n = 3 k m with m odd rime to 3. Also 2 n + 1 = (2 3k + 1)(2 (m 1)3k 2 (m 2)3k + + 1). As the second factor is congruent to m modulo 3 it is not divisible by 3. Therefore by roblem , 2 n + 1 is divisible by exactly 3 k+1. But, as 2 n + 1 divisible by n 2 it is divisible by 3 2k imlying 2k k + 1 k = 1. Therefor n = 3m. Now let > 3 be a rime dividing n. n 2 n n n 1 (mod ) 2 2n 1 (mod ). By Fermat (mod ). Therefore 2 ( 1,6m) 1 (mod ). But the rimes in the rime factorization of 1 are smaller than those in the factorization of m. Therefore ( 1, 6m) =
6 6 CHARLES LEYTEM 1, 2, 3, 6 imlying = 2, 3, 4, 7. This leaves as only ossibility = 7. But 2 n + 1 = 2 3m + 1 = 8 m (mod ). Finally n = 3 is the only solution. Problem Show that all Fermat numbers are square-free. Solution. Oen roblem
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 informationMATH 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 informationPractice 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 informationBy 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 informationPractice 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 informationMATH342 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 informationOn the Multiplicative Order of a n Modulo n
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 13 2010), Article 10.2.1 On the Multilicative Order of a n Modulo n Jonathan Chaelo Université Lille Nord de France F-59000 Lille France jonathan.chaelon@lma.univ-littoral.fr
More informationMAS 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 informationMath 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 informationx 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 informationPythagorean triples and sums of squares
Pythagorean triles and sums of squares Robin Chaman 16 January 2004 1 Pythagorean triles A Pythagorean trile (x, y, z) is a trile of ositive integers satisfying z 2 + y 2 = z 2. If g = gcd(x, y, z) then
More informationMATH 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 informationThe 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 informationThe 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 informationNumber 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 informationNUMBER 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 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 informationt 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 information3 Properties of Dedekind domains
18.785 Number theory I Fall 2016 Lecture #3 09/15/2016 3 Proerties of Dedekind domains In the revious lecture we defined a Dedekind domain as a noetherian domain A that satisfies either of the following
More informationDIRICHLET 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 informationGAUSSIAN 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 informationCERIAS 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 information6 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 information1 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 information2.3 In modular arithmetic, all arithmetic operations are performed modulo some integer.
CHAPTER 2 INTRODUCTION TO NUMBER THEORY ANSWERS TO QUESTIONS 2.1 A nonzero b is a divisor of a if a = mb for some m, where a, b, and m are integers. That is, b is a divisor of a if there is no remainder
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 informationFactorability 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 informationCharacteristics of Fibonacci-type Sequences
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
More information#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 informationMATH 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 informationOn 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 informationDIRICHLET 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 informationANALYTIC 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 informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationIntroductory Number Theory
Introductory Number Theory Lecture Notes Sudita Mallik May, 208 Contents Introduction. Notation and Terminology.............................2 Prime Numbers.................................. 2 2 Divisibility,
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 informationAlgebraic 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 informationElementary 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 informationQUADRATIC 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 informationHOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH
HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH 1. Section 2.1, Problems 5, 8, 28, and 48 Problem. 2.1.5 Write a single congruence that is equivalent to the air of congruences x 1 mod 4 and x 2
More informationMobius 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 informationArithmetic Consequences of Jacobi s Two-Squares Theorem
THE RAMANUJAN JOURNAL 4, 51 57, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Arithmetic Consequences of Jacobi s Two-Squares Theorem MICHAEL D. HIRSCHHORN School of Mathematics,
More informationA 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 informationQUADRATIC 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 informationMA3H1 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 informationMA3H1 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 informationA 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 informationM381 Number Theory 2004 Page 1
M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +
More informationA review of the foundations of perfectoid spaces
A review of the foundations of erfectoid saces (Notes for some talks in the Fargues Fontaine curve study grou at Harvard, Oct./Nov. 2017) Matthew Morrow Abstract We give a reasonably detailed overview
More informationElementary Number Theory
Elementary Number Theory WISB321 = F.Beukers 2012 Deartment of Mathematics UU ELEMENTARY NUMBER THEORY Frits Beukers Fall semester 2013 Contents 1 Integers and the Euclidean algorithm 4 1.1 Integers................................
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
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 informationMath 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 informationarxiv: v1 [math.nt] 4 Nov 2015
Wall s Conjecture and the ABC Conjecture George Grell, Wayne Peng August 0, 018 arxiv:1511.0110v1 [math.nt] 4 Nov 015 Abstract We show that the abc conjecture of Masser-Oesterlé-Sziro for number fields
More informationTHE THEORY OF NUMBERS IN DEDEKIND RINGS
THE THEORY OF NUMBERS IN DEDEKIND RINGS JOHN KOPPER Abstract. This aer exlores some foundational results of algebraic number theory. We focus on Dedekind rings and unique factorization of rime ideals,
More informationThe 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.4. Congruences. We say that a is congruent to b modulo N i.e. a b mod N i N divides a b or equivalently i a%n = b%n. So a is congruent modulo N to an
. Modular arithmetic.. Divisibility. Given ositive numbers a; b, if a 6= 0 we can write b = aq + r for aroriate integers q; r such that 0 r a. The number r is the remainder. We say that a divides b (or
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationOn Arithmetic Functions
Globl ournl of Mthemticl Sciences: Theory nd Prcticl ISSN 0974-00 Volume 5, Number (0, 7- Interntionl Reserch Publiction House htt://wwwirhousecom On Arithmetic Functions Bhbesh Ds Dertment of Mthemtics,
More informationJacobi symbols and application to primality
Jacobi symbols and alication to rimality Setember 19, 018 1 The grou Z/Z We review the structure of the abelian grou Z/Z. Using Chinese remainder theorem, we can restrict to the case when = k is a rime
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 informationSets 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 informationWednesday, February 21. Today we will begin Course Notes Chapter 5 (Number Theory).
Wednesday, February 21 Today we will begin Course Notes Chapter 5 (Number Theory). 1 Return to Chapter 5 In discussing Methods of Proof (Chapter 3, Section 2) we introduced the divisibility relation from
More informationAn 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 information2 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 informationON 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 informationMath 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[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]
[ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all
More informationDISCRIMINANTS IN TOWERS
DISCRIMINANTS IN TOWERS JOSEPH RABINOFF Let A be a Dedekind domain with fraction field F, let K/F be a finite searable extension field, and let B be the integral closure of A in K. In this note, we will
More informationQUADRATIC RESIDUES AND DIFFERENCE SETS
QUADRATIC RESIDUES AND DIFFERENCE SETS VSEVOLOD F. LEV AND JACK SONN Abstract. It has been conjectured by Sárközy that with finitely many excetions, the set of quadratic residues modulo a rime cannot be
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 informationSome 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 informationPrimes - Problem Sheet 5 - Solutions
Primes - Problem Sheet 5 - Solutions Class number, and reduction of quadratic forms Positive-definite Q1) Aly the roof of Theorem 5.5 to find reduced forms equivalent to the following, also give matrices
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 informationGRACEFUL NUMBERS. KIRAN R. BHUTANI and ALEXANDER B. LEVIN. Received 14 May 2001
IJMMS 29:8 2002 495 499 PII S06720200765 htt://immshindawicom Hindawi Publishing Cor GRACEFUL NUMBERS KIRAN R BHUTANI and ALEXANDER B LEVIN Received 4 May 200 We construct a labeled grah Dn that reflects
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 J. E. CREMONA Contents 0. Introduction: What is Number Theory? 2 Basic Notation 3 1. Factorization 4 1.1. Divisibility in Z 4 1.2. Greatest Common
More informationPrimes 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 informationHENSEL 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 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 informationChapter 3 Basic Number Theory
Chapter 3 Basic Number Theory What is Number Theory? Well... What is Number Theory? Well... Number Theory The study of the natural numbers (Z + ), especially the relationship between different sorts of
More informationThe Arm Prime Factors Decomposition
The Arm Prime Factors Decomosition Arm Boris Nima arm.boris@gmail.com Abstract We introduce the Arm rime factors decomosition which is the equivalent of the Taylor formula for decomosition of integers
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationAlmost All Palindromes Are Composite
Almost All Palindromes Are Comosite William D Banks Det of Mathematics, University of Missouri Columbia, MO 65211, USA bbanks@mathmissouriedu Derrick N Hart Det of Mathematics, University of Missouri Columbia,
More informationHomework 3, solutions
Homework 3, solutions Problem 1. Read the proof of Proposition 1.22 (page 32) in the book. Using simialr method prove that there are infinitely many prime numbers of the form 3n 2. Solution. Note that
More informationMaths 4 Number Theory Notes 2012 Chris Smyth, University of Edinburgh ed.ac.uk
Maths 4 Number Theory Notes 202 Chris Smyth, University of Edinburgh c.smyth @ ed.ac.uk 0. Reference books There are no books I know of that contain all the material of the course. however, there are many
More informationCONGRUENCES MODULO 4 OF CALIBERS OF REAL QUADRATIC FIELDS. 1. Definitions and results
Ann. Sci. Math. Québec 35 No (0) 85 95 CONGRUENCES MODULO 4 OF CALIBERS OF REAL QUADRATIC FIELDS MASANOBU KANEKO AND KEITA MORI Dedicated to rofessor Paulo Ribenboim on the occasion of his 80th birthday.
More informationQuadratic Residues. Chapter Quadratic residues
Chter 8 Qudrtic Residues 8. Qudrtic residues Let n>be given ositive integer, nd gcd, n. We sy tht Z n is qudrtic residue mod n if the congruence x mod n is solvble. Otherwise, is clled qudrtic nonresidue
More informationJonathan Sondow 209 West 97th Street, New York, New York
#A34 INTEGERS 11 (2011) REDUCING THE ERDŐS-MOSER EQUATION 1 n + 2 n + + k n = (k + 1) n MODULO k AND k 2 Jonathan Sondow 209 West 97th Street, New York, New York jsondow@alumni.rinceton.edu Kieren MacMillan
More informationWe 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 informationarxiv: v4 [math.nt] 11 Oct 2017
POPULAR DIFFERENCES AND GENERALIZED SIDON SETS WENQIANG XU arxiv:1706.05969v4 [math.nt] 11 Oct 2017 Abstract. For a subset A [N], we define the reresentation function r A A(d := #{(a,a A A : d = a a }
More informationQuadratic 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 informationProof 1: Using only ch. 6 results. Since gcd(a, b) = 1, we have
Exercise 13. Consider positive integers a, b, and c. (a) Suppose gcd(a, b) = 1. (i) Show that if a divides the product bc, then a must divide c. I give two proofs here, to illustrate the different methods.
More informationChapter 3. Number Theory. Part of G12ALN. Contents
Chater 3 Number Theory Part of G12ALN Contents 0 Review of basic concets and theorems The contents of this first section well zeroth section, really is mostly reetition of material from last year. Notations:
More informationElementary 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 informationa the relation arb is defined if and only if = 2 k, k
DISCRETE MATHEMATICS Past Paper Questions in Number Theory 1. Prove that 3k + 2 and 5k + 3, k are relatively prime. (Total 6 marks) 2. (a) Given that the integers m and n are such that 3 (m 2 + n 2 ),
More informationWORKSHEET MATH 215, FALL 15, WHYTE. We begin our course with the natural numbers:
WORKSHEET MATH 215, FALL 15, WHYTE We begin our course with the natural numbers: N = {1, 2, 3,...} which are a subset of the integers: Z = {..., 2, 1, 0, 1, 2, 3,... } We will assume familiarity with their
More informationPROBLEMS ON CONGRUENCES AND DIVISIBILITY
PROBLEMS ON CONGRUENCES AND DIVISIBILITY 1. Do there exist 1,000,000 consecutive integers each of which contains a repeated prime factor? 2. A positive integer n is powerful if for every prime p dividing
More informationIntroduction 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 informationALGEBRA. 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers
ALGEBRA CHRISTIAN REMLING 1. Some elementary number theory 1.1. Primes and divisibility. We denote the collection of integers by Z = {..., 2, 1, 0, 1,...}. Given a, b Z, we write a b if b = ac for some
More informationMarch 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011
International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,
More information