Number Theory Naoki Sato

Size: px
Start display at page:

Download "Number Theory Naoki Sato"

Transcription

1 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 student should be familiar with. This text is meant to be a reference, and not a relacement but rather a sulement to a number theory textbook; several are given at the back. Proofs are given when aroriate, or when they illustrate some insight or imortant idea. The roblems are culled from various sources, many from actual contests and olymiads, and in general are very difficult. The author welcomes any corrections or suggestions. 1 Divisibility For integers a and b, we say that a divides b, or that a is a divisor (or factor) of b, or that b is a multile of a, if there exists an integer c such that b = ca, and we denote this by a b. Otherwise, a does not divide b, and we denote this by a b. A ositive integer is a rime if the only divisors of are 1 and. If k a and k+1 a where is a rime, i.e. k is the highest ower of dividing a, then we denote this by k a. Useful Facts If a, b > 0, and a b, then a b. If a b 1, a b,..., a b n, then for any integers c 1, c,..., c n, a n b i c i. i=1 Theorem 1.1. The Division Algorithm. For any ositive integer a and integer b, there exist unique integers q and r such that b = qa + r and 0 r < a, with r = 0 iff a b. 1

2 Theorem 1.. The Fundamental Theorem of Arithmetic. Every integer greater than 1 can be written uniquely in the form e 1 1 e e k k, where the i are distinct rimes and the e i are ositive integers. Theorem 1.3. (Euclid) There exist an infinite number of rimes. Proof. Suose that there are a finite number of rimes, say 1,,..., n. Let N = 1 n + 1. By the fundamental theorem of arithmetic, N is divisible by some rime. This rime must be among the i, since by assumtion these are all the rimes, but N is seen not to be divisible by any of the i, contradiction. Examle 1.1. Let x and y be integers. Prove that x + 3y is divisible by 17 iff 9x + 5y is divisible by 17. Solution. 17 (x + 3y) 17 [13(x + 3y)], or 17 (6x + 39y) 17 (9x + 5y), and conversely, 17 (9x + 5y) 17 [4(9x + 5y)], or 17 (36x + 0y) 17 (x + 3y). Examle 1.. Find all ositive integers d such that d divides both n +1 and (n + 1) + 1 for some integer n. Solution. Let d (n + 1) and d [(n + 1) + 1], or d (n + n + ). Then d [(n + n + ) (n + 1)], or d (n + 1) d (4n + 4n + 1), so d [4(n +n+) (4n +4n+1)], or d (4n+7). Then d [(4n+7) (n+1)], or d 5, so d can only be 1 or 5. Taking n = shows that both of these values are achieved. Examle 1.3. Suose that a 1, a,..., a n are distinct integers such that the equation (x a 1 )(x a ) (x a n ) ( 1) n (n!) = 0 has an integer solution r. Show that so (1984 IMO Short List) r = a 1 + a + + a n. n Solution. Clearly, r a i for all i, and the r a i are n distinct integers, (r a 1 )(r a ) (r a n ) (1)() (n)( 1)( ) ( n) = (n!),

3 with equality iff {r a 1, r a,..., r a n } = {1,,..., n, 1,,..., n}. Therefore, this must be the case, so (r a 1 ) + (r a ) + + (r a n ) = nr (a 1 + a + + a n ) = n + ( 1) + ( ) + + ( n) = 0 r = a 1 + a + + a n. n Examle 1.4. Let 0 < a 1 < a < < a mn+1 be mn + 1 integers. Prove that you can select either m + 1 of them no one of which divides any other, or n + 1 of them each dividing the following one. (1966 Putnam Mathematical Cometition) Solution. For each i, 1 i mn + 1, let n i be the length of the longest sequence starting with a i and each dividing the following one, among the integers a i, a i+1,..., a mn+1. If some n i is greater than n then the roblem is solved. Otherwise, by the igeonhole rincile, there are at least m + 1 values of n i that are equal. Then, the integers a i corresonding to these n i cannot divide each other. Useful Facts Bertrand s Postulate. For every ositive integer n, there exists a rime such that n n. Gauss s Lemma. If a olynomial with integer coefficients factors into two olynomials with rational coefficients, then it factors into two olynomials with integer coefficients. Problems 1. Let a and b be ositive integers such that a b, b a 3, a 3 b 4, b 4 a 5,.... Prove that a = b.. Let a, b, and c denote three distinct integers, and let P denote a olynomial having all integral coefficients. Show that it is imossible that P (a) = b, P (b) = c, and P (c) = a. (1974 USAMO) 3

4 3. Show that if a and b are ositive integers, then ( a + 1 n ( + b + ) 1 ) n is an integer for only finitely many ositive integers n. (A Problem Seminar, D.J. Newman) 4. For a ositive integer n, let r(n) denote the sum of the remainders when n is divided by 1,,..., n resectively. Prove that r(k) = r(k 1) for infinitely many ositive integers k. (1981 Kürschák Cometition) 5. Prove that for all ositive integers n, 0 < n k=1 g(k) k n 3 < 3, where g(k) denotes the greatest odd divisor of k. (1973 Austrian Mathematics Olymiad) 6. Let d be a ositive integer, and let S be the set of all ositive integers of the form x + dy, where x and y are non-negative integers. (a) Prove that if a S and b S, then ab S. (b) Prove that if a S and S, such that is a rime and a, then a/ S. (c) Assume that the equation x + dy = has a solution in nonnegative integers x and y, where is a given rime. Show that if d, then the solution is unique, and if d = 1, then there are exactly two solutions. GCD and LCM The greatest common divisor of two ositive integers a and b is the greatest ositive integer that divides both a and b, which we denote by gcd(a, b), and similarly, the lowest common multile of a and b is the least ositive 4

5 integer that is a multile of both a and b, which we denote by lcm(a, b). We say that a and b are relatively rime if gcd(a, b) = 1. For integers a 1, a,..., a n, gcd(a 1, a,..., a n ) is the greatest ositive integer that divides all of a 1, a,..., a n, and lcm(a 1, a,..., a n ) is defined similarly. Useful Facts For all a, b, gcd(a, b) lcm(a, b) = ab. For all a, b, and m, gcd(ma, mb) = m gcd(a, b) and lcm(ma, mb) = mlcm(a, b). If d gcd(a, b), then ( a gcd d, b ) = d gcd(a, b). d In articular, if d = gcd(a, b), then gcd(a/d, b/d) = 1; that is, a/d and b/d are relatively rime. If a bc and gcd(a, c) = 1, then a b. For ositive integers a and b, if d is a ositive integer such that d a, d b, and for any d, d a and d b imlies that d d, then d = gcd(a, b). This is merely the assertion that any common divisor of a and b divides gcd(a, b). If a 1 a a n is a erfect k th ower and the a i are airwise relatively rime, then each a i is a erfect k th ower. Any two consecutive integers are relatively rime. Examle.1. Show that for any ositive integer N, there exists a multile of N that consists only of 1s and 0s. Furthermore, show that if N is relatively rime to 10, then there exists a multile that consists only of 1s. Solution. Consider the N + 1 integers 1, 11, 111,..., (N + 1 1s). When divided by N, they leave N + 1 remainders. By the igeonhole rincile, two of these remainders are equal, so the difference in the corresonding integers, an integer of the form , is divisible by N. If N is relatively rime to 10, then we may divide out all owers of 10, to obtain an integer of the form that remains divisible by N. 5

6 Theorem.1. For any ositive integers a and b, there exist integers x and y such that ax + by = gcd(a, b). Furthermore, as x and y vary over all integers, ax + by attains all multiles and only multiles of gcd(a, b). Proof. Let S be the set of all integers of the form ax+by, and let d be the least ositive element of S. By the division algorithm, there exist integers q and r such that a = qd + r, 0 r < d. Then r = a qd = a q(ax + by) = (1 qx)a (qy)b, so r is also in S. But r < d, so r = 0 d a, and similarly, d b, so d gcd(a, b). However, gcd(a, b) divides all elements of S, so in articular gcd(a, b) d d = gcd(a, b). The second art of the theorem follows. Corollary.. The ositive integers a and b are relatively rime iff there exist integers x and y such that ax + by = 1. Corollary.3. For any ositive integers a 1, a,..., a n, there exist integers x 1, x,..., x n, such that a 1 x 1 +a x + +a n x n = gcd(a 1, a,..., a n ). Corollary.4. Let a and b be ositive integers, and let n be an integer. Then the equation ax + by = n has a solution in integers x and y iff gcd(a, b) n. If this is the case, then all solutions are of the form ( (x, y) = x 0 + t b d, y 0 t a ), d where d = gcd(a, b), (x 0, y 0 ) is a secific solution of ax + by = n, and t is an integer. Proof. The first art follows from Theorem.1. For the second art, as stated, let d = gcd(a, b), and let (x 0, y 0 ) be a secific solution of ax + by = n, so that ax 0 + by 0 = n. If ax + by = n, then ax + by ax 0 by 0 = a(x x 0 ) + b(y y 0 ) = 0, or a(x x 0 ) = b(y 0 y), and hence (x x 0 ) a d = (y 0 y) b d. Since a/d and b/d are relatively rime, b/d must divide x x 0, and a/d must divide y 0 y. Let x x 0 = tb/d and y 0 y = ta/d. This gives the solutions described above. 6

7 Examle.. Prove that the fraction 1n n + 3 is irreducible for every ositive integer n. Solution. For all n, 3(14n + 3) (1n + 4) = 1, so the numerator and denominator are relatively rime. Examle.3. For all ositive integers n, let T n = n + 1. Show that if m n, then T m and T n are relatively rime. Solution. We have that T n = n 1 = n 1 1 = (T n 1 1) 1 = T n 1 T n 1 = T n 1 (T n 1 ) = T n 1 T n (T n ) = = T n 1 T n T 1 T 0 (T 0 ) = T n 1 T n T 1 T 0, for all n. Therefore, any common divisor of T m and T n must divide. But each T n is odd, so T m and T n are relatively rime. Remark. It immediately follows from this result that there are an infinite number of rimes. The Euclidean Algorithm. By recursive use of the division algorithm, we may find the gcd of two ositive integers a and b without factoring either, and the x and y in Theorem.1 (and so, a secific solution in Corollary.4). For examle, for a = 39 and b = 18, we comute 39 = , 18 = , 147 = , 35 = 5 7, and sto when there is no remainder. The last dividend is the gcd, so in our examle, gcd(39,18) = 7. Now, working through the above equations 7

8 backwards, 7 = = ( ) = = 5 (39 18) 4 18 = Remark. The Euclidean algorithm also works for olynomials. Examle.4. Let n be a ositive integer, and let S be a subset of n + 1 elements of the set {1,,..., n}. Show that (a) There exist two elements of S that are relatively rime, and (b) There exist two elements of S, one of which divides the other. Solution. (a) There must be two elements of S that are consecutive, and thus, relatively rime. (b) Consider the greatest odd factor of each of the n + 1 elements in S. Each is among the n odd integers 1, 3,..., n 1. By the igeonhole rincile, two must have the same greatest odd factor, so they differ (multilication-wise) by a ower of, and so one divides the other. Examle.5. The ositive integers a 1, a,..., a n are such that each is less than 1000, and lcm(a i, a j ) > 1000 for all i, j, i j. Show that n i=1 1 a i <. (1951 Russian Mathematics Olymiad) Solution. If 1000 < a 1000, then the m multiles a, a,..., ma do m+1 m not exceed Let k 1 the number of a i in the interval ( 1000, 1000], k in ( 1000, 1000], etc. Then there are k k + 3k 3 + integers, no greater than 1000, that are multiles of at least one of the a i. But the multiles are distinct, so k 1 + k + 3k 3 + < 1000 k 1 + 3k + 4k 3 + = (k 1 + k + 3k 3 + ) + (k 1 + k + k 3 + ) < n <

9 Therefore, n i=1 1 a i k k k 3 = k 1 + 3k + 4k < Useful Facts Dirichlet s Theorem. If a and b are relatively rime ositive integers, then the arithmetic sequence a, a + b, a + b,..., contains infinitely many rimes. Problems 1. The symbols (a, b,..., g) and [a, b,..., g] denote the greatest common divisor and lowest common multile, resectively of the ositive integers a, b,..., g. Prove that (197 USAMO) [a, b, c] [a, b][a, c][b, c] = (a, b, c) (a, b)(a, c)(b, c).. Show that gcd(a m 1, a n 1) = a gcd(m,n) 1 for all ositive integers a > 1, m, n. 3. Let a, b, and c be ositive integers. Show that lcm(a, b, c) = abc gcd(a, b, c) gcd(a, b) gcd(a, c) gcd(b, c). Exress gcd(a, b, c) in terms of abc, lcm(a, b, c), lcm(a, b), lcm(a, c), and lcm(b, c). Generalize. 4. Let a, b be odd ositive integers. Define the sequence (f n ) by utting f 1 = a, f = b, and by letting f n for n 3 be the greatest odd divisor of f n 1 + f n. Show that f n is constant for n sufficiently large and determine the eventual value as a function of a and b. (1993 USAMO) 5. Let n a 1 > a > > a k be ositive integers such that lcm(a i, a j ) n for all i, j. Prove that ia i n for i = 1,,..., k. 9

10 3 Arithmetic Functions There are several imortant arithmetic functions, of which three are resented here. If the rime factorization of n > 1 is e 1 1 e e k k, then the number of ositive integers less than n, relatively rime to n, is ) ) ) φ(n) = (1 ( (1 1k n the number of divisors of n is = e e 1 e k 1 k ( 1 1)( 1) ( k 1), and the sum of the divisors of n is τ(n) = (e 1 + 1)(e + 1) (e k + 1), σ(n) = ( e e )( e + e ) ( e k + e k 1 ( e 1 +1 = k k + + 1) ) ( e ) ( e k +1 k 1 k 1 Also, φ(1), τ(1), and σ(1) are defined to be 1. We say that a function f is multilicative if f(mn) = f(m)f(n) for all relatively rime ositive integers m and n, and f(1) = 1 (otherwise, f(1) = 0, which imlies that f(n) = 0 for all n). ). Theorem 3.1. The functions φ, τ, and σ are multilicative. Hence, by taking the rime factorization and evaluating at each rime ower, the formula above are found easily. Examle 3.1. Find the number of solutions in ordered airs of ositive integers (x, y) of the equation where n is a ositive integer. Solution. From the given, 1 x + 1 y = 1 n, 1 x + 1 y = 1 n xy = nx + ny (x n)(y n) = n. 10

11 If n = 1, then we immediately deduce the unique solution (,). For n, let n = e 1 1 e e k k be the rime factorization of n. Since x, y > n, there is a 1-1 corresondence between the solutions in (x, y) and the factors of n, so the number of solutions is τ(n ) = (e 1 + 1)(e + 1) (e k + 1). Examle 3.. Let n be a ositive integer. Prove that φ(d) = n. d n Solution. For a divisor d of n, let S d be the set of all a, 1 a n, such that gcd(a, n) = n/d. Then S d consists of all elements of the form b n/d, where 0 b d, and gcd(b, d) = 1, so S d contains φ(d) elements. Also, it is clear that each integer between 1 and n belongs to a unique S d. The result then follows from summing over all divisors d of n. Problems 1. Let n be a ositive integer. Prove that n τ(k) = k=1 n k=1 n k.. Let n be a ositive integer. Prove that τ 3 (d) = d n d n τ(d). 3. Prove that if σ(n) = N + 1, then N is the square of an odd integer. (1976 Putnam Mathematical Cometition) 4 Modular Arithmetic For a ositive integer m and integers a and b, we say that a is congruent to b modulo m if m (a b), and we denote this by a b modulo m, or more 11

12 commonly a b (mod m). Otherwise, a is not congruent to b modulo m, and we denote this by a b (mod m) (although this notation is not used often). In the above notation, m is called the modulus, and we consider the integers modulo m. Theorem 4.1. If a b and c d (mod m), then a + c b + d (mod m) and ac bd (mod m). Proof. If a b and c d (mod m), then there exist integers k and l such that a = b + km and c = d + lm. Hence, a + c = b + d + (k + l)m, so a + c b + d (mod m). Also, so ac bd (mod m). Useful Facts For all integers n, ac = bd + dkm + blm + klm n For all integers n, 0 n 4 1 = bd + (dk + bl + klm)m, { 0 1 } { if n is even, (mod 4) if n is odd. (mod 8) if n 0 (mod 4), if n (mod 4), if n 1 (mod ). If f is a olynomial with integer coefficients and a b (mod m), then f(a) f(b) (mod m). If f is a olynomial with integer coefficients of degree n, not identically zero, and is a rime, then the congruence f(x) 0 (mod ) has at most n solutions modulo, counting multilicity. 1

13 Examle 4.1. Prove that the only solution in rational numbers of the equation x 3 + 3y 3 + 9z 3 9xyz = 0 is x = y = z = 0. (1983 Kürschák Cometition) Solution. Suose that the equation has a solution in rationals, with at least one non-zero variable. Since the equation is homogeneous, we may obtain a solution in integers (x 0, y 0, z 0 ) by multilying the equation by the cube of the lowest common multile of the denominators. Taking the equation modulo 3, we obtain x (mod 3). Therefore, x 0 must be divisible by 3, say x 0 = 3x 1. Substituting, 7x y z 3 0 7x 1 y 0 z 0 = 0 y z x 3 1 9x 1 y 0 z 0 = 0. Therefore, another solution is (y 0, z 0, x 1 ). We may then aly this reduction recursively, to obtain y 0 = 3y 1, z 0 = 3z 1, and another solution (x 1, y 1, z 1 ). Hence, we may divide owers of 3 out of our integer solution an arbitrary number of times, contradiction. Examle 4.. Does one of the first Fibonacci numbers terminate with 4 zeroes? Solution. The answer is yes. Consider the sequence of airs (F k, F k+1 ) modulo Since there are only a finite number of different ossible airs (10 8 to be exact), and each air is deendent only on the revious one, this sequence is eventually eriodic. Also, by the Fibonacci relation, one can find the revious air to a given air, so this sequence is immediately eriodic. But F 0 0 (mod 10 4 ), so within 10 8 terms, another Fibonacci number divisible by 10 4 must aear. In fact, a comuter check shows that 10 4 F 7500, and (F n ) modulo 10 4 has eriod 15000, which is much smaller than the uer bound of If ax 1 (mod m), then we say that x is the inverse of a modulo m, denoted by a 1, and it is unique modulo m. Theorem 4.. The inverse of a modulo m exists and is unique iff a is relatively rime to m. Proof. If ax 1 (mod m), then ax = 1+km for some k ax km = 1. By Corollary., a and m are relatively rime. Now, if gcd(a, m) = 1, then 13

14 by Corollary., there exist integers x and y such that ax + my = 1 ax = 1 my ax 1 (mod m). The inverse x is unique modulo m, since if x is also an inverse, then ax ax 1 xax xax x x. Corollary 4.3. If is a rime, then the inverse of a modulo exists and is unique iff does not divide a. Corollary 4.4. If ak bk (mod m) and k is relatively rime to m, then a b (mod m). Proof. Multilying both sides by k 1, which exists by Theorem 4., yields the result. We say that a set {a 1, a,..., a m } is a comlete residue system modulo m if for all i, 0 i m 1, there exists a unique j such that a j i (mod m). Examle 4.3. Find all ositive integers n such that there exist comlete residue systems {a 1, a,..., a n } and {b 1, b,..., b n } modulo n for which {a 1 + b 1, a + b,..., a n + b n } is also a comlete residue system. Solution. The answer is all odd n. First we rove necessity. For any comlete residue system {a 1, a,..., a n } modulo n, we have that a 1 + a + + a n n(n + 1)/ (mod n). So, if all three sets are comlete residue systems, then a 1 +a + +a n +b 1 +b + +b n n +n 0 (mod n) and a 1 + b 1 + a + b + + a n + b n n(n + 1)/ (mod n), so n(n + 1)/ 0 (mod n). The quantity n(n + 1)/ is divisible by n iff (n + 1)/ is an integer, which imlies that n is odd. Now assume that n is odd. Let a i = b i = i for all i. Then a i + b i = i for all i, and n is relatively rime to, so by Corollary 4.4, {, 4,..., n} is a comlete residue system modulo n. Theorem 4.5. Euler s Theorem. If a is relatively rime to m, then a φ(m) 1 (mod m). Proof. Let a 1, a,..., a φ(m) be the ositive integers less than m that are relatively rime to m. Consider the integers aa 1, aa,..., aa φ(m). We claim that they are a ermutation of the original φ(m) integers a i, modulo m. For each i, aa i is also relatively rime to m, so aa i a k for some k. Since aa i aa j a i a j (mod m), each a i gets taken to a different a k under 14

15 multilication by a, so indeed they are ermuted. Hence, a 1 a a φ(m) (aa 1 )(aa ) (aa φ(m) ) a φ(m) a 1 a a φ(m) 1 a φ(m) (mod m). Remark. This gives an exlicit formula for the inverse of a modulo m: a 1 a φ(m) (mod m). Alternatively, one can use the Euclidean algorithm to find a 1 x as in the roof of Theorem 4.. Corollary 4.6. Fermat s Little Theorem (FLT). If is a rime, and does not divide a, then a 1 1 (mod ). Examle 4.4. Show that if a and b are relatively rime ositive integers, then there exist integers m and n such that a m + b n 1 (mod ab). Solution. Let S = a m + b n, where m = φ(b) and n = φ(a). Then by Euler s Theorem, S b φ(a) 1 (mod a), or S 1 0 (mod a), and S a φ(b) 1 (mod b), or S 1 0 (mod b). Therefore, S 1 0, or S 1 (mod ab). Examle 4.5. For all ositive integers i, let S i be the sum of the roducts of 1,,..., 1 taken i at a time, where is an odd rime. Show that S 1 S S 0 (mod ). Solution. First, observe that (x 1)(x ) (x ( 1)) = x 1 S 1 x + S x 3 S x + S 1. This olynomial vanishes for x = 1,,..., 1. But by Fermat s Little Theorem, so does x 1 1 modulo. Taking the difference of these two olynomials, we obtain another olynomial of degree with 1 roots modulo, so it must be the zero olynomial, and the result follows from comaring coefficients. Remark. We immediately have that ( 1)! S 1 1 (mod ), which is Wilson s Theorem. Also, x x 0 (mod ) for all x, yet we cannot comare coefficients here. Why not? Theorem 4.7. If is a rime and n is an integer such that (4n + 1), then 1 (mod 4). 15

16 Proof. Clearly, cannot be, so we need only show that 3 (mod 4). Suose = 4k + 3 for some k. Let y = n, so by Fermat s Little Theorem, y 1 1 (mod ), since does not divide n. But, y + 1 0, so y 1 y 4k+ (y ) k+1 ( 1) k+1 1 (mod ), contradiction. Therefore, 1 (mod 4). Remark. The same roof can be used to show that if is a rime and (n + 1), then = or 1 (mod 4). Examle 4.6. Show that there are an infinite number of rimes of the form 4k + 1 and of the form 4k + 3. Solution. Suose that there are a finite number of rimes of the form 4k + 1, say 1,,..., n. Let N = 4( 1 n ) + 1. By Theorem 4.7, N is only divisible by rimes of the form 4k + 1, but clearly N is not divisible by any of these rimes, contradiction. Similarly, suose that there are a finite number of rimes of the form 4k + 3, say q 1, q,..., q m. Let M = 4q 1 q q m 1. Then M 3 (mod 4), so M must be divisible by a rime of the form 4k + 3, but M is not divisible by any of these rimes, contradiction. Examle 4.7. Show that if n is an integer greater than 1, then n does not divide n 1. Solution. Let be the least rime divisor of n. Then gcd(n, 1) = 1, and by Corollary., there exist integers x and y such that nx+( 1)y = 1. If ( n 1), then nx+( 1)y ( n ) x ( 1 ) y 1 (mod ) by Fermat s Little Theorem, contradiction. Therefore, ( n 1) n ( n 1). Theorem 4.8. Wilson s Theorem. If is a rime, then ( 1)! 1 (mod ). (See also Examle 4.5.) Proof. Consider the congruence x 1 (mod ). Then x 1 (x 1)(x + 1) 0, so the only solutions are x 1 and 1. Therefore, for each i, i, there exists a unique inverse j i of i, j, modulo. Hence, when we grou in airs of inverses, ( 1)! 1 ( ) ( 1) ( 1) 1 (mod ). 16

17 Examle 4.8. Let {a 1, a,..., a 101 } and {b 1, b,..., b 101 } be comlete residue systems modulo 101. Can {a 1 b 1, a b,..., a 101 b 101 } be a comlete residue system modulo 101? Solution. The answer is no. Suose that {a 1 b 1, a b,..., a 101 b 101 } is a comlete residue system modulo 101. Without loss of generality, assume that a (mod 101). Then b (mod 101), because if any other b j was congruent to 0 modulo 101, then a j b j a 101 b (mod 101), contradiction. By Wilson s Theorem, a 1 a a 100 b 1 b b ! 1 (mod 101), so a 1 b 1 a b a 100 b (mod 101). But a 101 b (mod 101), so a 1 b 1 a b a 100 b ! 1 (mod 101), contradiction. Theorem 4.9. If is a rime, then the congruence x (mod ) has a solution iff = or 1 (mod 4). (Comare to Theorem 7.1) Proof. If =, then x = 1 is a solution. If 3 (mod 4), then by the remark to Theorem 4.7, no solutions exist. Finally, if = 4k + 1, then let x = 1 (k). Then x 1 (k) (k) 1 1 (k) ( k) ( ) ( 1) 1 (k) ( k) ( ) ( 1) ( 1)! 1 (mod ). (multilying by k 1s) Theorem Let be a rime such that 1 (mod 4). Then there exist ositive integers x and y such that = x + y. Proof. By Theorem 4.9, there exists an integer a such that a 1 (mod ). Consider the set of integers of the form ax y, where x and y are integers, 0 x, y <. The number of ossible airs (x, y) is then ( + 1) > ( ) =, so by igeonhole rincile, there exist integers 0 x 1, x, y 1, y <, such that ax 1 y 1 ax y (mod ). Let x = x 1 x and y = y 1 y. At least one of x and y is non-zero, and ax y a x x y x + y 0 (mod ). Thus, x + y is a multile of, and 0 < x + y < ( ) + ( ) =, so x + y =. Theorem Let n be a ositive integer. Then there exist integers x and y such that n = x + y iff each rime factor of n of the form 4k + 3 aears an even number of times. Theorem 4.1. The Chinese Remainder Theorem (CRT). If a 1, a,..., a k are integers, and m 1, m,..., m k are airwise relatively rime integers, 17

18 then the system of congruences x a 1 (mod m 1 ), x a (mod m ),. x a k (mod m k ) has a unique solution modulo m 1 m m k. Proof. Let m = m 1 m m k, and consider m/m 1. This is relatively rime to m 1, so there exists an integer t 1 such that t 1 m/m 1 1 (mod m 1 ). Accordingly, let s 1 = t 1 m/m 1. Then s 1 1 (mod m 1 ) and s 1 0 (mod m j ), j 1. Similarly, for all i, there exists an s i such that s i 1 (mod m i ) and s i 0 (mod m j ), j i. Then, x = a 1 s 1 + a s + + a k s k is a solution to the above system. To see uniqueness, let x be another solution. Then x x 0 (mod m i ) for all i x x 0 (mod m 1 m m k ). Remark. The roof shows exlicitly how to find the solution x. Examle 4.9. For a ositive integer n, find the number of solutions of the congruence x 1 (mod n). Solution. Let the rime factorization of n be e e 1 1 e e k k. By CRT, x 1 (mod n) x 1 (mod e i i ) for all i, and x 1 (mod e ). We consider these cases searately. We have that x 1 (mod e i i ) x 1 = (x 1)(x + 1) 0 (mod e i i ). But i cannot divide both x 1 and x + 1, so it divides one of them; that is, x ±1 (mod e i i ). Hence, there are two solutions. Now, if (x 1)(x + 1) 0 (mod e ), can divide both x 1 and x + 1, but 4 cannot divide both. For e = 1 and e =, it is easily checked that there are 1 and solutions resectively. For e 3, since there is at most one factor of in one of x 1 and x + 1, there must be at least e 1 in the other, for their roduct to be divisible by e. Hence, the only ossibilities are x 1 or x + 1 0, e 1 (mod e ), which lead to the four solutions x 1, e 1 1, e 1 + 1, and e 1. Now that we know how many solutions each rime ower factor contributes, the number of solutions modulo n is simly the roduct of these, by CRT. The following table gives the answer: 18

19 e Number of solutions 0, 1 k k+1 3 k+ Theorem Let m be a ositive integer, let a and b be integers, and let k = gcd(a, m). Then the congruence ax b (mod m) has k solutions or no solutions according as k b or k b. Problems 1. Prove that for each ositive integer n there exist n consecutive ositive integers, none of which is an integral ower of a rime. (1989 IMO). For an odd ositive integer n > 1, let S be the set of integers x, 1 x n, such that both x and x + 1 are relatively rime to n. Show that x 1 (mod n). x S 3. Find all ositive integer solutions to 3 x + 4 y = 5 z. (1991 IMO Short List) 4. Let n be a ositive integer such that n + 1 is divisible by 4. Prove that the sum of all the divisors of n is divisible by 4. (1969 Putnam Mathematical Cometition) 5. (Wolstenholme s Theorem) Prove that if is exressed as a fraction, where 5 is a rime, then divides the numerator. 6. Let a be the greatest ositive root of the equation x 3 3x + 1 = 0. Show that a 1788 and a 1988 are both divisible by 17. (1988 IMO Short List) 19

20 7. Let {a 1, a,..., a n } and {b 1, b,..., b n } be comlete residue systems modulo n, such that {a 1 b 1, a b,..., a n b n } is also a comlete residue system modulo n. Show that n = 1 or. 8. Let m, n be ositive integers. Show that 4mn m n can never be a square. (1984 IMO Proosal) 5 Binomial Coefficients For non-negative integers n and k, k n, the binomial coefficient ( n k) is defined as n! k!(n k)!, and has several imortant roerties. By convention, ( n k) = 0 if k > n. In the following results, for olynomials f and g with integer coefficients, we say that f g (mod m) if m divides every coefficient in f g. Theorem 5.1. If is a rime, then the number of factors of in n! is n n n It is also n s n 1, where s n is the sum of the digits of n when exressed in base. Theorem 5.. If is a rime, then ( ) 0 (mod ) i for 1 i 1. Corollary 5.3. (1 + x) 1 + x (mod ). Lemma 5.4. For all real numbers x and y, x + y x + y. Proof. x x x + y x + y Z, so x + y x + y. 0

21 Theorem 5.5. If is a rime, then ( ) k 0 (mod ) i for 1 i k 1. Proof. By Lemma 5.4, k ( ) i k i + j j j=1 k k, where the LHS and RHS are the number of factors of in i!( k i)! and k i! resectively. But, = k i = 0 and k = 1, so the inequality is k k k strict, and at least one factor of divides ( ) k i. Corollary 5.6. (1 + x) k 1 + x k j=1 (mod ). Examle 5.1. Let n be a ositive integer. Show that the roduct of n consecutive ositive integers is divisible by n!. Solution. If the consecutive integers are m, m + 1,..., m + n 1, then ( ) m(m + 1) (m + n 1) m + n 1 =. n! n Examle 5.. Let n be a ositive integer. Show that (( ) ( ) ( )) n n n (n + 1) lcm,,..., = lcm(1,,..., n + 1). 0 1 n (AMM E686) Solution. Let be a rime n + 1 and let α (resectively β) be the highest ower of in the LHS (resectively RHS) of the above equality. Choose r so that r n + 1 < r+1. Then clearly β = r. We claim that ( ) m if r m < r+1, then r+1 for 0 k m. ( ) k Indeed, the number of factors of in ( ) m k is r ( ) m k m k γ =. s=1 s s 1 s j

22 Since each summand in this sum is 0 or 1, we have γ r; that is, (*) holds. For 0 k n, let ( ) ( ) ( ) n n + 1 n + 1 a k = (n + 1) = (n k + 1) = (k + 1). k k k + 1 By ( ), r+1 does not divide any of the integers ( ) ( n k, n+1 ) ( k, or n+1 k+1). Thus, r+1 can divide a k only if divides each of the integers n + 1, n k + 1, and k + 1. This imlies that divides (n + 1) (n k + 1) (k + 1) = 1, contradiction. Therefore, r+1 a k. On the other hand, for k = r 1, we have that k n and a k = (k + 1) ( n+1 k+1) is divisible by r. Therefore, β = r = α. Theorem 5.7. Lucas s Theorem. Let m and n be non-negative integers, and a rime. Let m = m k k + m k 1 k m 1 + m 0, n = n k k + n k 1 k n 1 + n 0 and be the base exansions of m and n resectively. Then ( ) ( )( ) ( )( ) m mk mk 1 m1 m0 (mod ). n n k Proof. By Corollary 5.6, n k 1 n 1 (1 + x) m (1 + x) m k k +m k 1 k 1 + +m 1 +m 0 n 0 (1 + x) k m k (1 + x) k 1 m k 1 (1 + x) m 1 (1 + x) m 0 (1 + x k ) m k (1 + x k 1 ) m k 1 (1 + x ) m 1 (1 + x) m 0 By base exansion, the coefficient of x n on both sides is ( ) ( )( ) ( )( ) m mk mk 1 m1 m0 (mod ). n n k n k 1 n 1 n 0 (mod ). Corollary 5.8. Let n be a ositive integer. Let A(n) denote the number of factors of in n!, and let B(n) denote the number of 1s in the binary exansion of n. Then the number of odd entries in the n th row of Pascal s Triangle, or equivalently the number of odd coefficients in the exansion of (1 + x) n, is B(n). Furthermore, A(n) + B(n) = n for all n. Useful Facts

23 For a olynomial f with integer coefficients and rime, [f(x)] n f(x n ) (mod ). Problems 1. Let a and b be non-negative integers, and a rime. Show that ( ) ( ) a a (mod ). b b. Let a n be the last non-zero digit in the decimal reresentation of the number n!. Is the sequence a 1, a, a 3,... eventually eriodic? (1991 IMO Short List) 3. Find all ositive integers n such that n (3 n 1). 4. Find the greatest integer k for which 1991 k divides (1991 IMO Short List) For a ositive integer n, let a(n) and b(n) denote the number of binomial coefficients in the n th row of Pascal s Triangle that are congruent to 1 and modulo 3 resectively. Prove that a(n) b(n) is always a ower of. 6. Let n be a ositive integer. Prove that if the number of factors of in n! is n 1, then n is a ower of. 6 Order of an Element We know that if a is relatively rime to m, then there exists a ositive integer n such that a n 1 (mod m). Let d be the smallest such n. Then we say that d is the order of a modulo m, denoted by ord m (a), or simly ord(a) if the modulus m is understood. Theorem 6.1. If a is relatively rime to m, then a n 1 (mod m) iff ord(a) n. Furthermore, a n 0 a n 1 iff ord(a) (n 0 n 1 ). 3

24 Proof. Let d = ord(a). It is clear that d n a n 1 (mod m). On the other hand, if a n 1 (mod m), then by the division algorithm, there exist integers q and r such that n = qd + r, 0 r < d. Then a n a qd+r (a d ) q a r a r 1 (mod m). But r < d, so r = 0 d n. The second art of the theorem follows. Remark. In articular, by Euler s Theorem, ord(a) φ(m). Examle 6.1. Show that the order of modulo 101 is 100. Solution. Let d = ord(). Then d φ(101), or d 100. If d < 100, then d divides 100/ or 100/5; that is, d is missing at least one rime factor. However, and ( 6) ( 6) 14 1 (mod 101), so d = (mod 101), Examle 6.. Prove that if is a rime, then every rime divisor of 1 is greater than. Solution. Let q ( 1), where q is a rime. Then 1 (mod q), so ord(). But ord() 1, so ord() =. And by Fermat s Little Theorem, ord() (q 1) q 1 q >. In fact, for >, q must be of the form k + 1. From the above, ord() (q 1), or (q 1) q = m + 1. Since q must be odd, m must be even. Examle 6.3. Let be a rime that is relatively rime to 10, and let n be an integer, 0 < n <. Let d be the order of 10 modulo. (a) Show that the length of the eriod of the decimal exansion of n/ is d. (b) Prove that if d is even, then the eriod of the decimal exansion of n/ can be divided into two halves, whose sum is 10 d/ 1. For examle, 1/7 = , so d = 6, and = 999 = Solution. (a) Let m be the length of the eriod, and let n/ = 4

25 0.a 1 a... a m. Then 10 m n (10m 1) n = a 1 a... a m.a 1 a... a m = a 1 a... a m, an integer. Since n and are relatively rime, must divide 10 m 1, so d divides m. Conversely, divides 10 d 1, so (10 d 1)n/ is an integer, with at most d digits. If we divide this integer by 10 d 1, then we obtain a rational number, whose decimal exansion has eriod at most d. Therefore, m = d. (b) Let d = k, so n/ = 0.a 1 a... a k a k+1... a k. Now divides 10 d 1 = 10 k 1 = (10 k 1)(10 k + 1). However, cannot divide 10 k 1 (since the order of 10 is k), so divides 10 k + 1. Hence, 10 k n (10k + 1) n = a 1 a... a k.a k+1... a k = a 1 a... a k + 0.a 1 a... a k + 0.a k+1... a k is an integer. This can occur iff a 1 a... a k +a k+1... a k is a number consisting only of 9s, and hence, equal to 10 k 1. Problems 1. Prove that for all ositive integers a > 1 and n, n φ(a n 1).. Prove that if is a rime, then 1 has a rime factor that is congruent to 1 modulo. 3. For any integer a, set n a = 101a 100 a. Show that for 0 a, b, c, d 99, n a + n b n c + n d (mod 10100) imlies {a, b} = {c, d}. (1994 Putnam Mathematical Cometition) 4. Show that if 3 d n+1, then d (a n + 1) for all ositive integers a. 7 Quadratic Residues Let m be an integer greater than 1, and a an integer relatively rime to m. If x a (mod m) has a solution, then we say that a is a quadratic residue 5

26 of m. Otherwise, we say that a is a quadratic non-residue. Now, let be an odd rime. Then the Legendre symbol ( ) a is assigned the value of 1 if a is a quadratic residue of. Otherwise, it is assigned the value of 1. Theorem 7.1. Let be an odd rime, and a and b be integers relatively rime to. Then ( ) (a) a ( 1)/ (mod ), and (b) ( a a )( b ) ( = ) ab. Proof. If the congruence x a (mod ) has a solution, then a ( 1)/ x 1 1 (mod ), by Fermat s Little Theorem. If the congruence x a (mod ) has no solutions, then for each i, 1 i 1, there is a unique j i, 1 j 1, such that ij a. Therefore, all the integers from 1 to 1 can be arranged into ( 1)/ such airs. Taking their roduct, a ( 1)/ 1 ( 1) ( 1)! 1 (mod ), by Wilson s Theorem. Part (b) now follows from art (a). Remark. Part (a) is known as Euler s criterion. Examle 7.1. Show that if is an odd rime, then ( ) ( ) ( ) = 0. Solution. Note that 1,,..., (( 1)/) are distinct modulo, and that (( + 1)/),..., ( 1) reresent the same residues, simly in reverse. Hence, there are exactly ( 1)/ quadratic residues, leaving ( 1)/ quadratic non-residues. Therefore, the given sum contains ( 1)/ 1s and ( 1)/ 1s. Theorem 7.. Gauss s Lemma. Let be an odd rime and let a be relatively rime to. Consider the least non-negative residues of a, a,..., 6

27 (( 1)/)a modulo. If n is the number of these residues that are greater than /, then ( ) a = ( 1) n. ( ) 1 Theorem 7.3. If is an odd rime, then = ( 1) ( 1)/ ; that is, ( ) { 1 1 if 1 (mod 4), = 1 if 3 (mod 4). Proof. This follows from Theorem 4.9 (and Theorem 7.1). ( ) Theorem 7.4. If is an odd rime, then = ( 1) ( 1)/8 ; that is, ( ) { 1 if 1 or 7 (mod 8), = 1 if 3 or 5 (mod 8). Proof. If 1 or 5 (mod 8), then ( ) 1 ( 1)/! 4 6 ( 1) ( ) ( ) ( 5) ( 3) ( 1) ( ) 1 ( 1) ( 1)/4! ( 1)/ ( 1) ( 1)/4 ( By Theorem 7.1, (mod ). ) ( = ( 1) ( 1)/4. Hence, 1 or 5 (mod 8). Similarly, if 3 or 7 (mod 8), then ( ) ( ) 1 3 ( 1)/! 4 6 ( ) 1 ( 1) (+1)/4! ( 1)/ ( 1) (+1)/4 (mod ). ) = 1 or 1 according as ( 1 ) ( 5) ( 3) ( 1) 7

28 ( Hence, ) = 1 or 1 according as 7 or 3 (mod 8). Examle 7.. Prove that if n is an odd ositive integer, then every rime divisor of n 1 is of the form 8k ± 1. (Comare to Examle 6.) Solution. Let ( n 1), where( ) is rime. Let n = m + 1. Then n m+1 ( m ) 1 (mod ) = 1 is of the form 8k ± 1. Theorem 7.5. The Law of Quadratic Recirocity. For distinct odd rimes and q, ( ) ( ) q = ( 1) 1 q 1. q Examle 7.3. For which rimes > 3 does the congruence x 3 (mod ) have a solution? ( ) ( ) ( ) Solution. We seek for which = = 1. By quadratic recirocity, ( ) ( ) ( ) 3 1 = ( 1) ( 1)/ =, 3 by Theorem 7.3. Thus, in general, ( ) 3 = ( 1 ) ( ) 3 = ( 3 ) ( ) 1 = ( ). 3 And, ( 3 ) = 1 iff 1 (mod 3). Since 4 (mod 6), we have that x 3 (mod ) has a solution iff 1 (mod 6). Examle 7.4. Show that if = n + 1, n, is rime, then 3 ( 1)/ + 1 is divisible by. Solution. We must have that n is even, say k, for otherwise 0 (mod 3). By Theorem 7.1, ( ) 3 3 ( 1)/ (mod ). However, 1 (mod 4), and 4 k + 1 (mod 3) ( 3) = 1, and by quadratic recirocity, ( 3 ) ( ) = ( 1) ( 1)/ = 1, 3 8

29 so ( ) 3 = 1 3 ( 1)/ (mod ). Useful Facts (a) If is a rime and 1 or 3 (mod 8), then there exist ositive integers x and y such that = x + y. (b) If is a rime and 1 (mod 6), then there exist ositive integers x and y such that = x + 3y. Problems 1. Show that if > 3 is a rime, then the sum of the quadratic residues among the integers 1,,..., 1 is divisible by.. Let F n denote the n th Fibonacci number. Prove that if > 5 is a rime, then ( F (mod ). 5) 3. Show that 16 is a erfect 8 th ower modulo for any rime. 4. Let a, b, and c be ositive integers that are airwise relatively rime, and that satisfy a ab + b = c. Show that every rime factor of c is of the form 6k Let be an odd rime and let ζ be a rimitive th root of unity; that is, ζ is a comlex number such that ζ = 1 and ζ k 1 for 1 k 1. Let A and B denote the set of quadratic residues and non-residues modulo, resectively. Finally, let α = k A ζ k and β = k B ζ k. For examle, for = 7, α = ζ + ζ + ζ 4 and β = ζ 3 + ζ 5 + ζ 6. Show that α and β are the roots of ( ) 1 1 x + x + =

30 8 Primitive Roots If the order of g modulo m is φ(m), then we say that g is a rimitive root modulo m, or simly of m. Examle 8.1. Show that is a rimitive root modulo 3 n for all n 1. Solution. The statement is easily verified for n = 1, so assume the result is true for some n = k; that is, φ(3k) 3k 1 1 (mod 3 k ). Now, let d be the order of modulo 3 k+1. Then d 1 (mod 3 k+1 ) d 1 (mod 3 k ), so 3 k 1 d. However, d φ(3 k+1 ), or d 3 k. We deduce that d is either 3 k 1 or 3 k. Now we require the following lemma: Lemma. 3n n (mod 3 n+1 ), for all n 1. This is true for n = 1, so assume it is true for some n = k. Then by assumtion, 3k 1 = k + 3 k+1 m for some integer m 3k = k k+ M 3k k+1 (mod 3 k+ ). By induction, the lemma is roved. for some integer M (obtained by cubing) Therefore, 3k k 1 (mod 3 k+1 ), so the order of modulo 3 k+1 is 3 k, and again by induction, the result follows. Corollary 8.. If n 1 (mod 3 k ), then 3 k 1 n. Proof. The given imlies n 1 (mod 3 k ) φ(3 k ) n, or 3 k 1 n. Theorem 8.3. If m has a rimitive root, then it has φ(φ(m)) (distinct) rimitive roots modulo m. Theorem 8.4. The ositive integer m has a rimitive root iff m is one of, 4, k, or k, where is an odd rime. Theorem 8.5. If g is a rimitive root of m, then g n 1 (mod m) iff φ(m) n. Furthermore, g n 0 g n 1 iff φ(m) (n 0 n 1 ). Proof. This follows directly from Theorem 6.1. Theorem 8.6. If g is a rimitive root of m, then the owers 1, g, g,..., g φ(m) 1 reresent each integer relatively rime to m uniquely modulo m. In articular, if m >, then g φ(m)/ 1 modulo m. 30

31 Proof. Clearly, each ower g i is relatively rime to m, and there are φ(m) integers relatively rime to m. Also, if g i g j (mod m), then g i j 1 φ(m) (i j) by Theorem 8.6, so each of the owers are distinct modulo m. Hence, each integer relatively rime to m is some ower g i modulo m. Furthermore, there is a unique i, 0 i φ(m) 1, such that g i 1 g i 1 i = φ(m), or i = φ(m)/. Proosition 8.7. Let m be a ositive integer. Then the only solutions to the congruence x 1 (mod m) are x ±1 (mod m) iff m has a rimitive root. Proof. This follows from Examle 4.9. Examle 8.. For a ositive integer m, let S be the set of ositive integers less than m that are relatively rime to m, and let P be the roduct of the elements in S. Show that P ±1 (mod m), with P 1 (mod m) iff m has a rimitive root. Solution. We use a similar strategy as in the roof of Wilson s Theorem. The result is clear for m =, so assume that m 3. We artition S as follows: Let A be the elements of S that are solutions to the congruence x 1 (mod m), and let B be the remaining elements. The elements in B can be arranged into airs, by airing each with its distinct multilicative inverse. Hence, the roduct of the elements in B is 1 modulo m. The elements in A may also be arranged into airs, by airing each with its distinct additive inverse, i.e. x and m x. These must be distinct, because otherwise, x = m/, which is not relatively rime to m. Note that their roduct is x(m x) mx x 1 (mod m). Now if m has a rimitive root, then by Proosition 8.7, A consists of only the two elements 1 and 1, so P 1 (mod m). Otherwise, by Examle 4.9, the number of elements of A is a ower of two that is at least 4, so the number of such airs in A is even, and P 1 (mod m). Remark. For m rime, this simly becomes Wilson s Theorem. Theorem 8.8. (1) If g is a rimitive root of, a rime, then g or g + is a rimitive root of, according as g 1 1 (mod ) or g 1 1 (mod ). () If g is a rimitive root of k, where k and is rime, then g is a rimitive root of k+1. By Theorem 8.6, given a rimitive root g of m, for each a relatively rime 31

32 to m, there exists a unique integer i modulo φ(m) such that g i a (mod m). This i is called the index of a with resect to the base g, denoted by ind g (a) (i is deendent on g, so it must be secified). Indices have striking similarity to logarithms, as seen in the following roerties: (1) ind g (1) 0 (mod φ(m)), ind g (g) 1 (mod φ(m)), () a b (mod m) ind g (a) ind g (b) (mod φ(m)), (3) ind g (ab) ind g (a) + ind g (b) (mod φ(m)), (4) ind g (a k ) k ind g (a) (mod φ(m)). Theorem 8.9. If is a rime and a is not divisible by, then the congruence x n a (mod ) has gcd(n, 1) solutions or no solutions according as a ( 1)/ gcd(n, 1) 1 (mod ) or a ( 1)/ gcd(n, 1) 1 (mod ). Proof. Let g be a rimitive root of, and let i be the index of a with resect to g. Also, any solution x must be relatively rime to, so let u be the index of x. Then the congruence x n a becomes g nu g i (mod ) nu i (mod 1). Let k = gcd(n, 1). Since g is a rimitive root of, k i g i( 1)/k a ( 1)/k 1. The result now follows from Theorem Remark. Taking to be an odd rime and n =, we deduce Euler s criterion. Examle 8.3 Let n be an integer and = n + 1. Show that if 3 ( 1)/ (mod ), then is a rime. (The converse to Examle 7.4.) Solution. From 3 ( 1)/ 3 n 1 1 (mod ), we obtain 3 n 1 (mod ), so the order of 3 is n = 1, but the order also divides φ() 1. Therefore, φ() = 1, and is a rime. Examle 8.4. Prove that if n = 3 k 1, then n 1 (mod 3 k ). (A artial converse to Corollary 8..) Solution. By Examle 8.1, is a rimitive root of 3 k. Therefore, has order φ(3 k ) = 3 k 1 = n n 1 ( n 1)( n + 1) 0 (mod 3 k ). However, n 1 ( 1) 3k (mod 3), so n (mod 3 k ). 3

33 Examle 8.5. Find all ositive integers n > 1 such that is an integer. (1990 IMO) n + 1 n Solution. Clearly, n must be odd. Now assume that 3 k n; that is, 3 k is the highest ower of 3 dividing n. Then 3 k n ( n + 1) n 1 (mod 3 k ) 3 k 1 n, by Corollary 8. k 1 k k 1, showing that n has at most one factor of 3. We observe that n = 3 is a solution. Suose that n has a rime factor greater than 3; let be the least such rime. Then ( n +1) n 1 (mod ). Let d be the order of modulo. Since n 1, d n. If d is odd, then d n n 1, contradiction, so d is even, say d = d 1. Then d 1 n d 1 n. Also, d ( 1), or d 1 ( 1) d 1 ( 1)/ <. But d 1 n, so d 1 = 1 or d 1 = 3. If d 1 = 1, then d =, and 1 (mod ), contradiction. If d 1 = 3, then d = 6, and 6 1 (mod ), or 63 = 7. However, the order of modulo 7 is 3, which is odd, again contradiction. Therefore, no such can exist, and the only solution is n = 3. Useful Facts All rime divisors of the Fermat number n + 1, n > 1, are of the form n+ k + 1. Problems 1. Let be an odd rime. Prove that for all i, 0 i. 1 i + i + + ( 1) i 0 (mod ). Show that if is an odd rime, then the congruence x 4 1 (mod ) has a solution iff 1 (mod 8). 3. Show that if a and n are ositive integers with a odd, then a n 1 (mod n+ ). 4. The number has the remarkable roerty that multilying it by 1,, 3, 4, 5, and 6 cyclically ermutes the digits. What are other numbers that have this roerty? Hint: Comute

34 9 Dirichlet Series Desite the intimidating name, Dirichlet series are easy to work with, and can rovide quick roofs to certain number-theoretic identities, such as Examle 3.. Let α be a function taking the ositive integers to the integers. Then we say that f(s) = n=1 α(n) n s = α(1) + α() s + α(3) 3 s + is the Dirichlet series generating function (Dsgf) of the function α, which we denote by f(s) α(n). Like general generating functions, these generating functions are used to rovide information about their corresonding number-theoretic functions, rimarily through maniulation of the generating functions. Let 1 denote the function which is 1 for all ositive integers; that is, 1(n) = 1 for all n. Let δ 1 (n) be the function defined by { 1 if n = 1, δ 1 (n) = 0 if n > 1. It is easy to check that 1 and δ 1 are multilicative. Now, let α and β be functions taking the ositive integers to the integers. The convolution of α and β, denoted α β, is defined by (α β)(n) = d n α(d)β(n/d). Note that convolution is symmetric; that is, α β = β α. Theorem 9.1. Let f(s) α(n) and g(s) β(n). Then (f g)(s) (α β)(n). We now do three examles. The Dsgf of 1(n) is the well-known Riemann Zeta function ζ(s): ζ(s) = n=1 1 n s = s s +, so ζ(s) 1(n). This function will lay a rominent role in this theory. What makes this theory nice to work with is that we may work with these 34

35 functions at a urely formal level; no knowledge of the analytic roerties of ζ(s) or indeed of any other Dsgf is required. By Theorem 9.1, the number-theoretic function corresonding to ζ (s) is 1(d)1(n/d) = 1 = τ(n). d n d n Hence, ζ (s) τ(n). Finally, it is clear that 1 δ 1 (n). If α is a multilicative function, then we can comute the Dsgf corresonding to α using the following theorem. n=1 Theorem 9.. Let α be a multilicative function. Then α(n) n s = k=0 α( k ) ks = [1 + α() s + α( ) s + α( 3 ) 3s + ], where the roduct on the right is taken over all rime numbers. As before, if we take α = 1, then we obtain ζ(s) = = = (1 + s + s + 3s + ) ( 1 ) 1 s 1 (1 s ), an identity that will be useful. We say that a ositive integer n > 1 is square-free if n contains no reeated rime factors; that is, n for all rimes. With this in mind, we define the Möbius function µ as follows: µ(n) = 1 if n = 1, 0 if n is not square-free, and ( 1) k if n is square-free and has k rime factors. It is easy to check that µ is multilicative. By Theorem 9., the corresonding Dsgf is given by (1 s ) = 1 ζ(s). 35

36 Hence, 1/ζ(s) µ(n), and this roerty makes the the seemingly mysterious function µ very imortant, as seen in the following theorem. Theorem 9.3. (Möbius Inversion Formula) Let α and β be functions such that β(n) = α(d). d n Then α(n) = d n µ(n/d)β(d). Proof. Let f(s) α(n) and g(s) β(n). The condition is equivalent to β = α 1, or g(s) = f(s)ζ(s), and the conclusion is equivalent to α = β µ, or f(s) = g(s)/ζ(s). Theorem 9.4. Let f(s) α(n). Then for any integer k, f(s k) n k α(n). For more on Dirichlet series, and generating functions in general, see H. Wilf, Generatingfunctionology. Problems 1. Let α, β, and γ be functions taking the ositive integers to the integers. (a) Prove that α 1 = α. (b) Prove that (α β) γ = α (β γ). (c) Prove that if α and β are multilicative, then so is α β.. Prove that the following relations hold: ζ(s 1) φ(n), ζ(s) ζ(s)ζ(s 1) σ(n), ζ(s) ζ(s) µ(n). 3. Let the rime factorization of a ositive integer n > 1 be e 1 1 e e k k. Define the functions λ and θ by λ(n) = ( 1) e 1+e + +e k and θ(n) = k. Set λ(1) = θ(1) = 1. Show that λ and θ are multilicative, and that ζ(s) ζ(s) λ(n) and ζ (s) ζ(s) θ(n). 36

37 4. For all ositive integers n, let f(n) = n m=1 (a) Show that f(n) = d n dφ(d). (b) Let n = e 1 1 e e k k that ( e 1 +1 f(n) = n gcd(m, n). > 1 be the rime factorization of n. Show ) ( e Verify Examle 3. in one calculation ) ( e k k Let id denote the identity function; that is, id(n) = n for all n. Verify each of the following identities in one calculation: (a) φ τ = σ. (b) µ 1 = δ 1. (c) µ id = φ. (d) φ σ = id τ. (e) σ id = 1 (id τ). 7. Let a 1, a,..., be the sequence of ositive integers satisfying a d = n d n for all n. Hence, a 1 =, a = =, a 3 = 3 = 6, a 4 = 4 = 1, and so on. Show that for all n, n a n. Hint: Don t use the Dsgf of (a n ) 1 ; use the Möbius Inversion Formula. Bigger Hint: Consider the function f : [0, 1] [0, 1] defined by f(x) = {x}, where {x} = x x is the fractional art of x. Find how the formula in the roblem relates to the function f (n) = f f f. }{{} n ). 37

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

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

More information

MATH 3240Q Introduction to Number Theory Homework 7

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

More information

By Evan Chen OTIS, Internal Use

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

More information

Practice Final Solutions

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

More information

Practice Final Solutions

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

More information

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

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

More information

Math 104B: Number Theory II (Winter 2012)

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

More information

The Euler Phi Function

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

More information

1 Integers and the Euclidean algorithm

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

More information

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

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

More information

Elementary Number Theory

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

MA3H1 TOPICS IN NUMBER THEORY PART III

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

More information

Algebraic Number Theory

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

More information

PRIME NUMBERS YANKI LEKILI

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

More information

Mobius Functions, Legendre Symbols, and Discriminants

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

More information

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.

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

Introductory Number Theory

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

More information

Summary Slides for MATH 342 June 25, 2018

Summary Slides for MATH 342 June 25, 2018 Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.

More information

t s (p). An Introduction

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

More information

2 Asymptotic density and Dirichlet density

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

More information

Elementary Analysis in Q p

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

More information

Characteristics of Fibonacci-type Sequences

Characteristics 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

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

MA3H1 Topics in Number Theory. Samir Siksek

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

More information

Mersenne and Fermat Numbers

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

More information

MAS 4203 Number Theory. M. Yotov

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

More information

2 Asymptotic density and Dirichlet density

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

More information

MATH342 Practice Exam

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

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

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

More information

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

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

More information

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

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

More information

6 Binary Quadratic forms

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

More information

MATH 361: NUMBER THEORY EIGHTH LECTURE

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

More information

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

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

More information

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

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

More information

p-adic Measures and Bernoulli Numbers

p-adic Measures and Bernoulli Numbers -Adic Measures and Bernoulli Numbers Adam Bowers Introduction The constants B k in the Taylor series exansion t e t = t k B k k! k=0 are known as the Bernoulli numbers. The first few are,, 6, 0, 30, 0,

More information

Chapter 3. Number Theory. Part of G12ALN. Contents

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

PartII Number Theory

PartII Number Theory PartII Number Theory zc3 This is based on the lecture notes given by Dr.T.A.Fisher, with some other toics in number theory (ossibly not covered in the lecture). Some of the theorems here are non-examinable.

More information

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

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

More information

MATH 361: NUMBER THEORY THIRD LECTURE

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

More information

Maths 4 Number Theory Notes 2012 Chris Smyth, University of Edinburgh ed.ac.uk

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

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove

More information

On the Multiplicative Order of a n Modulo n

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

Elementary Number Theory Review. Franz Luef

Elementary Number Theory Review. Franz Luef Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then

More information

Math 314 Course Notes: Brief description

Math 314 Course Notes: Brief description Brief description These are notes for Math 34, an introductory course in elementary number theory Students are advised to go through all sections in detail and attempt all problems These notes will be

More information

HOMEWORK # 4 MARIA SIMBIRSKY SANDY ROGERS MATTHEW WELSH

HOMEWORK # 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 information

A Curious Property of the Decimal Expansion of Reciprocals of Primes

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

More information

AN INTRODUCTION TO GAUSS S NUMBER THEORY. Andrew Granville

AN INTRODUCTION TO GAUSS S NUMBER THEORY. Andrew Granville AN INTRODUCTION TO GAUSS S NUMBER THEORY Andrew Granville We resent a modern introduction to number theory, aimed both at students who have little exerience of university level mathematics, as well as

More information

I(n) = ( ) f g(n) = d n

I(n) = ( ) f g(n) = d n 9 Arithmetic functions Definition 91 A function f : N C is called an arithmetic function Some examles of arithmetic functions include: 1 the identity function In { 1 if n 1, 0 if n > 1; 2 the constant

More information

HENSEL S LEMMA KEITH CONRAD

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

More information

MAT 311 Solutions to Final Exam Practice

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

More information

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru

Number Theory Marathon. Mario Ynocente Castro, National University of Engineering, Peru Number Theory Marathon Mario Ynocente Castro, National University of Engineering, Peru 1 2 Chapter 1 Problems 1. (IMO 1975) Let f(n) denote the sum of the digits of n. Find f(f(f(4444 4444 ))). 2. Prove

More information

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

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

More information

RECIPROCITY LAWS JEREMY BOOHER

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

More information

INTRODUCTION TO GAUSS S NUMBER THEORY. Andrew Granville

INTRODUCTION TO GAUSS S NUMBER THEORY. Andrew Granville INTRODUCTION TO GAUSS S NUMBER THEORY Andrew Granville We resent a modern introduction to number theory. There are many introductory number theory books available, mostly develoed more-or-less directly

More information

Primes - Problem Sheet 5 - Solutions

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

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

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

More information

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

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

More information

MATH 2710: NOTES FOR ANALYSIS

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

More information

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

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

More information

GAUSSIAN INTEGERS HUNG HO

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

More information

Factorability in the ring Z[ 5]

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

More information

MATH 152 NOTES MOOR XU NOTES FROM A COURSE BY KANNAN SOUNDARARAJAN

MATH 152 NOTES MOOR XU NOTES FROM A COURSE BY KANNAN SOUNDARARAJAN MATH 5 NOTES MOOR XU NOTES FROM A COURSE BY KANNAN SOUNDARARAJAN Abstract These notes were taken from math 5 (Elementary Theory of Numbers taught by Kannan Soundararajan in Fall 00 at Stanford University

More information

Pythagorean triples and sums of squares

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

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby

Math 118: Advanced Number Theory. Samit Dasgupta and Gary Kirby Math 8: Advanced Number Theory Samit Dasgupta and Gary Kirby April, 05 Contents Basics of Number Theory. The Fundamental Theorem of Arithmetic......................... The Euclidean Algorithm and Unique

More information

Prime Reciprocal Digit Frequencies and the Euler Zeta Function

Prime Reciprocal Digit Frequencies and the Euler Zeta Function Prime Recirocal Digit Frequencies and the Euler Zeta Function Subhash Kak. The digit frequencies for rimes are not all equal. The least significant digit for rimes greater than 5 can only be, 3, 7, or

More information

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018

MA257: 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 information

Introduction to Number Theory

Introduction to Number Theory INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,

More information

Algebraic number theory LTCC Solutions to Problem Sheet 2

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

More information

QUADRATIC RECIPROCITY

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

More information

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

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

More information

Dirichlet s Theorem on Arithmetic Progressions

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

More information

QUADRATIC RECIPROCITY

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

More information

(Workshop on Harmonic Analysis on symmetric spaces I.S.I. Bangalore : 9th July 2004) B.Sury

(Workshop on Harmonic Analysis on symmetric spaces I.S.I. Bangalore : 9th July 2004) B.Sury Is e π 163 odd or even? (Worksho on Harmonic Analysis on symmetric saces I.S.I. Bangalore : 9th July 004) B.Sury e π 163 = 653741640768743.999999999999.... The object of this talk is to exlain this amazing

More information

Elementary Number Theory MARUCO. Summer, 2018

Elementary Number Theory MARUCO. Summer, 2018 Elementary Number Theory MARUCO Summer, 2018 Problem Set #0 axiom, theorem, proof, Z, N. Axioms Make a list of axioms for the integers. Does your list adequately describe them? Can you make this list as

More information

CONGRUENCES CONCERNING LUCAS SEQUENCES ZHI-HONG SUN

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

More information

SOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,

SOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2, SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.

More information

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

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

More information

DISCRIMINANTS IN TOWERS

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

PARTITIONS AND (2k + 1) CORES. 1. Introduction

PARTITIONS AND (2k + 1) CORES. 1. Introduction PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007

More information

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

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

More information

19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017

19th Bay Area Mathematical Olympiad. Problems and Solutions. February 28, 2017 th Bay Area Mathematical Olymiad February, 07 Problems and Solutions BAMO- and BAMO- are each 5-question essay-roof exams, for middle- and high-school students, resectively. The roblems in each exam are

More information

3 Properties of Dedekind domains

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

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

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

More information

Sets of Real Numbers

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

More information

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

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

More information

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER

ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER #A43 INTEGERS 17 (2017) ARITHMETIC PROGRESSIONS OF POLYGONAL NUMBERS WITH COMMON DIFFERENCE A POLYGONAL NUMBER Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.edu

More information

arxiv: v1 [math.nt] 4 Nov 2015

arxiv: 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 information

SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015

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

More information

MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT p-adic L-FUNCTION. n s = p. (1 p s ) 1.

MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT p-adic L-FUNCTION. n s = p. (1 p s ) 1. MAZUR S CONSTRUCTION OF THE KUBOTA LEPOLDT -ADIC L-FUNCTION XEVI GUITART Abstract. We give an overview of Mazur s construction of the Kubota Leooldt -adic L- function as the -adic Mellin transform of a

More information

An Estimate For Heilbronn s Exponential Sum

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

More information

SOME SUMS OVER IRREDUCIBLE POLYNOMIALS

SOME SUMS OVER IRREDUCIBLE POLYNOMIALS SOME SUMS OVER IRREDUCIBLE POLYNOMIALS DAVID E SPEYER Abstract We rove a number of conjectures due to Dinesh Thakur concerning sums of the form P hp ) where the sum is over monic irreducible olynomials

More information

MATH 371 Class notes/outline October 15, 2013

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

More information

16 The Quadratic Reciprocity Law

16 The Quadratic Reciprocity Law 16 The Quadratic Recirocity Law Fix an odd rime If is another odd rime, a fundamental uestion, as we saw in the revious section, is to know the sign, ie, whether or not is a suare mod This is a very hard

More information

QUADRATIC RESIDUES AND DIFFERENCE SETS

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

Number Theory Proof Portfolio

Number Theory Proof Portfolio Number Theory Proof Portfolio Jordan Rock May 12, 2015 This portfolio is a collection of Number Theory proofs and problems done by Jordan Rock in the Spring of 2014. The problems are organized first by

More information

Chapter 2 Arithmetic Functions and Dirichlet Series.

Chapter 2 Arithmetic Functions and Dirichlet Series. Chater 2 Arithmetic Functions and Dirichlet Series. [4 lectures] Definition 2.1 An arithmetic function is any function f : N C. Examles 1) The divisor function d (n) (often denoted τ (n)) is the number

More information

RATIONAL AND INTEGRAL POINTS ON CURVES. Andrew Granville. Table of Contents

RATIONAL AND INTEGRAL POINTS ON CURVES. Andrew Granville. Table of Contents RATIONAL AND INTEGRAL POINTS ON CURVES Andrew Granville Abstract. These are notes that have been extracted from a book that I am writing on elementary number theory. I make no attemt here to organize this

More information

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

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

More information

.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

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