Pythagorean triples and sums of squares
|
|
- Charles Hodge
- 5 years ago
- Views:
Transcription
1 Pythagorean triles and sums of squares Robin Chaman 16 January 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 (x/g, y/g, z/g) is also a Pythagorean trile. It follows that if g > 1, (x, y, z) can be obtained from the smaller Pythagorean trile (x/g, y/g, z/g) by multilying each entry by g. It is natural then to focus on Pythagorean triles (x, y, z) with gcd(x, y, z) = 1 these are called rimitive Pythagorean triles. It will be useful to note a basic fact about rimitive Pythagorean triles. Theorem 1 Let (x, y, z) be a rimitive Pythagorean trile. Then gcd(x, y) = gcd(x, z) = gcd(y, z) = 1. Proof Suose gcd(x, y) > 1. Then there is a rime with x and y. Then z 2 = x 2 + y 2 0 (mod ). As z 2 then z and so gcd(x, y, z), contradicting (x, y, z) being a rimitive Pythagorean trile. Thus gcd(x, y) = 1. The roofs that gcd(x, z) = 1 and gcd(y, z) = 1 are similar. Considering things modulo 4 we can determine the arities of the numbers in a rimitive Pythagorean trile. Theorem 2 If (x, y, z) is a rimitive Pythagorean trile, then one of x and y is even, and the other odd. (Equivalently, x + y is odd.) Also z is odd. Proof Note that if x is even then x 2 0 (mod 4) and if x is odd then x 2 1 (mod 4). If x and y are both odd then x 2 y 2 1 (mod 4). Hence z 2 x 2 + y 2 2 (mod 4), which is imossible. If x and y are both even, then gcd(x, y) 2 contradicting Theorem 1. We conclude that one of x and y is even, and the other is odd. In any case, z z 2 = x 2 + y 2 x + y (mod 2), so z is odd. 1
2 As the rôles of x and y in Pythagorean triles are symmetric, it makes little loss in generality in studying only rimitive Pythagorean triles with x odd and y even. We can now rove a theorem characterizing rimitive Pythagorean triles Theorem Let (x, y, z) be a rimitive Pythagorean trile with x odd. Then there are r, s N with r > s, gcd(r, s) = 1 and r + s odd, such that x = r 2 s 2, y = 2rs and z = r 2 + s 2. Conversely, if r, s N with r > s, gcd(r, s) = 1 and r + s odd, then (r 2 s 2, 2rs, r 2 + s 2 ) is a rimitive Pythagorean trile. Proof Let (x, y, z) be a rimitive Pythagorean trile with x odd. Then y is even and z is odd. Let a = 1(z x), b = 1 (z + x) and c = y/2. Then a, b, 2 2 c N. Also (z x)(z + x) ab = = z2 x 2 = y = c2. Let g = gcd(a, b). Then g (a + b) and g (b a); that is g z and g x. As gcd(x, z), by Theorem 1, then g = 1, that is gcd(a, b) = 1. Let be a rime factor of a. Then b, so v (b) = 0. Hence v (a) = v (a) + v (b) = v (ab) = v (c 2 ) = 2v (c) is even. Thus a is a square. Similarly b is a square. Write a = s 2 and b = r 2 where r, s N. Then gcd(r, s) a and gcd(r, s) b; as a and b are corime, gcd(r, s) = 1. Now x = b a = r 2 s 2 ; therefore r > s. Also z = a + b = r 2 + s 2. As c 2 = ab = r 2 s 2, c = rs and so y = 2rs. Finally as x is odd, then 1 x = r 2 + s 2 r + s; that is r + s is odd. This roves the first half of the theorem. To rove the second art, let r, s N with r > s, gcd(r, s) = 1 and r + s odd. Set x = r 2 s 2, y = 2rs and z = r 2 + s 2. Certainly y, z N and also x N as r > s > 0. Also x 2 +y 2 = (r 2 s 2 ) 2 +(2rs) 2 = (r 4 2r 2 s 2 +s 4 )+4r 2 s 2 = r 4 +2r 2 s 2 +s 4 = z 2. Hence (x, y, z) is a Pythagorean trile. Certainly y is even, and x = r 2 s 2 r s r + s (mod 2): x is odd. To show that (x, y, z) is a rimitive Pythagorean trile we examine g = gcd(x, z). As x is odd, g is odd. Also g (x 2 + z 2 ) and g (z 2 x 2 ), that is g 2s 2 and g 2r 2. As r and s are corime, then gcd(2r 2, 2s 2 ) = 2, and so g 2. As g is odd g = 1. Hence (x, y, z) is a rimitive Pythagorean trile. We now aly this to the roof of Fermat s last theorem for exonent 4. 2
3 Theorem 4 There do not exist x, y, z N with x 4 + y 4 = z 4. (1) Proof In fact we rove a stronger result. We claim that there are no x, y, u N with x 4 + y 4 = u 2. (2) A natural number solution (x, y, z) to (1) gives one for (2), namely (x, y, u) = (x, y, z 2 ). Thus it suffices to rove that (2) is insoluble over N. We use Fermat s method of descent. Given a solution (x, y, u) of (2) we roduce another solution (x, y, u ) with u < u. This is a contradiction if we start with the solution of (2) minimizing u. Let (x, y, u) be a solution of (2) over N with minimum ossible u. We claim first that gcd(x, y) = 1. If not, then x and y for some rime. Then 4 (x 4 + y 4 ), that is, 4 u 2. Hence 2 u. Then (x, y, u ) = (x/, y/, u/ 2 ) is a solution of (2) in N with u < u. This is a contradiction. Hence gcd(x, y) = 1. As gcd(x, y) = 1 then gcd(x 2, y 2 ) = 1, and so (x 2, y 2, u) is a rimitive Pythagorean trile by (2). By the symmetry of x and y we may assume that x 2 is odd and y 2 is even, that is, x is odd and y is even. Hence there are r, s N with gcd(r, s) = 1 x 2 = r 2 s 2, y 2 = 2rs, u = r 2 + s 2. Then x 2 +s 2 = r 2, and as gcd(r, s) = 1 then (x, s, r) is a rimitive Pythagorean trile. As x is odd, there exist a, b N with gcd(a, b) = 1 and x = a 2 b 2, s = 2ab, r = a 2 + b 2. Then y 2 = 2rs = 4(a 2 + b 2 )ab, equivalently (y/2) 2 = ab(a 2 + b 2 ) = abr. (Recall that y is even.) If is rime and gcd(a, r) then b 2 = (a 2 + b 2 ) a 2 0 (mod ) and so b. This is imossible, as gcd(a, b) = 1. Thus gcd(a, r) = 1. Similarly gcd(b, r) = 1. Now abr is a square. If a, then b and r. Thus v (a) = v (abr)
4 is even, and so a is a square. Similarly b and r are squares. Write a = x 2, b = y 2 and r = u 2 where x, y, u N. Then so (x, y, u ) is a solution of (2). Also u 2 = a 2 + b 2 = x 4 + y 4 u u 2 = a 2 + b 2 = r r 2 < r 2 + s 2 = u. This contradicts the minimality of u in the solution (x, y, u) of (2). Hence (2) is insoluble over N. Consequently (1) is insoluble over N. 2 Sums of squares For k N we let S k = {a a 2 k : a 1,..., a k Z} be the set of sums of k squares. Note that we allow zero; for instance 1 = S 2. The sets S 2 and S 4 are closed under multilication. Theorem 5 1. If m, n S 2 then mn S If m, n S 4 then mn S 4. Proof Let m, m S 2. Then m = a 2 + b 2 and n = r 2 + s 2 where a, b, r, s Z. By the two-square formula, (a 2 + b 2 )(r 2 + s 2 ) = (ar bs) 2 + (as + br) 2, it is immediate that mn S 2. Let m, m S 4. Then m = a 2 + b 2 + c 2 + d 2 and n = r 2 + s 2 + t 2 + u 2 where a, b, c, d, r, s, t, u Z. By the four-square formula, (a 2 + b 2 + c 2 + d 2 )(r 2 + s 2 + t 2 + u 2 ) = (ar bs ct du) 2 + (as + br + cu dt) 2 it is immediate that mn S 4. + (at bu + cr + ds) 2 + (au + bt cs + dr) 2, We remark that the two-square theorem comes from comlex numbers: (a 2 + b 2 )(c 2 + d 2 ) = a + bi 2 c + di 2 = (a + bi)(c + di) 2 = (ac bd) + (ad + bc) 2 = (ac bd) 2 + (ad + bc) 2. 4
5 Similarly the four-square theorem comes from the theory of quaternions (if you know what they are). We can restrict the ossible factorizations of a sum of two squares. Recall that if is rime, and n is an integer, then v (n) denotes the exonent of the largest ower of dividing n: v(n) n but v(n)+1 n. Theorem 6 Let be a rime with (mod 4) and let n N. If n S 2 then v (n) is even. Proof Let n = a 2 + b 2 with a, b Z and suose n. We aim to show that a and b. Suose a. Then there is c Z with ac 1 (mod( ). ) Then 0 c 2 n = (ac) 2 + (bc) ( 2 ) 1 + (bc) 2 (mod ). This imlies that = 1, but we know that = 1 when (mod 4). This contradiction roves that a. Similarly b. Thus 2 (a 2 + b 2 ) = n and n/ 2 = (a/) 2 + (b/) 2 S 2. Let n S 2 and k = v (n). We have seen that if k > 0 then k 2 and n/ 2 S 2. Note that v (n/ 2 ) = k 2. Similarly if k 2 > 0 (that is if k > 2) then k 2 2 (that is k 4) and n/ 4 S 2. Iterating this argument, we find that if k = 2r + 1 is odd, then n/ 2r S 2 and v(n/ 2r ) = 1, which is imossible. We conclude that k is even. If n N, we can write n = rm 2 where m 2 is the largest square dividing n and r is squarefree, that is either r = 1 or r is a roduct of distinct rimes. If any rime factor of r is congruent to modulo 4 then v (n) = 1+2v (m) is odd, and n / S 2. Hence, if n S 2, the only ossible rime factors of r are = 2 and the congruent to 1 modulo 4. Obviously 2 = S 2. It would be nice if all rimes congruent to 1 modulo 4 were also in S 2. Fortunately, this is the case. Theorem 7 Let be a rime with 1 (mod 4). Then S 2. ( ) Proof As 1 (mod 4) then = 1 and so there is u Z with u 2 (mod ). Let A = {(m 1, m 2 ) : m 1, m 2 Z, 0 m 1, m 2 < }. Then A has (1 + s) 2 elements, where s is the integer art of, that is, s < s + 1. Hence A >. For m = (m 1, m 2 ) R 2 define φ(m) = um 1 + m 2. Then φ is a linear ma from R 2 to R, and if m Z 2 then φ(m) Z. As A >, the φ(m) for m A can t all be distinct modulo. Hence there are distinct m, n A with φ(m) φ(n) (mod ). Let a = m n. Then 5
6 φ(a) = φ(m) φ(n) 0 (mod ). Let a = (a, b). Then a = m 1 n 1 where 0 m 1, n 1 < so that a <. Similarly b <. Then a 2 + b 2 < 2. As m n then a (0, 0) and so a 2 +b 2 > 0. But 0 φ(a) = ua+b (mod ). Hence b ua (mod ) and so a 2 + b 2 a 2 + ( ua) 2 a 2 (1 + u 2 ) 0 (mod ). As a 2 + b 2 is a multile of, and 0 < a 2 + b 2 < 2, then a 2 + b 2 =. We conclude that S 2. We can now characterize the elements of S 2. Theorem 8 (Two-square theorem) Let n N. Then n S 2 if and only if v (n) is even whenever is a rime congruent to modulo 4. Proof If n S 2, is rime and (mod 4) then v (n) is even by Theorem 7. If v (n) is even whenever is a rime congruent to modulo 4 then = rm 2 where each rime factor of r is either 2 or congruent to 1 modulo 4. By Theorem 7 all such lie in S 2. Hence By Theorem 5 r S 2. Hence r = a 2 + b 2 where a, b Z and so n = rm 2 = (am) 2 + (bm) 2 S 2. The reresentation of a rime as a sum of two squares is essentially unique. Theorem 9 Let be a rime. If = a 2 + b 2 = c 2 + d 2 with a, b, c, d N then either a = c and b = d or a = d and b = c. Proof Consider (ac + bd)(ad + bc) = a 2 cd + abc 2 + abd 2 + b 2 cd = (a 2 + b 2 )cd + ab(c 2 + d 2 ) = cd + ab = (ab + cd). As (ac + bd)(ad + bc) then either (ac + bd) or (ad + bc). Assume the former the latter case can be treated by reversing the rôles of c and d. Now ac + bd > 0 so that ac + bd. Also (ac + bd) 2 + (ad bc) 2 = a 2 c 2 + 2abcd + b 2 d 2 + a 2 d 2 2abcd + b 2 c 2 = a 2 c 2 + b 2 d 2 + a 2 d 2 + b 2 c 2 = (a 2 + b 2 )(c 2 + d 2 ) = 2. As ac + bd, the only way this is ossible is if ac + bd = and ad bc = 0. Then ac 2 + bcd = c and ad 2 bcd = 0, so adding gives a(c 2 + d 2 ) = c, that is a = c, so that a = c. Then c 2 + bd = = c 2 + d 2 so that bd = d 2, so that b = d. We wish to rove the theorem of Lagrange to the effect that all natural numbers are sums of four squares. It is crucial to establish this for rimes. 6
7 Theorem 10 Let be a rime. Then S 4. Proof If 1 (mod 4) then there are a, b Z with = a 2 + b (Theorem 7) so that S 4. Also 2 = S 4 and = S 4. We may assume that > and that (mod 4). ( ) As a consequence =. ( ) ( ) w w Let w be the smallest ositive integer with =. Then = 1 ( ) ( ) ( ) and = = 1. Hence there are u, v Z with w 1 u 2 w w (mod ) and w v 2 (mod ). Then 1 + u 2 + v (w 1) w 0 (mod ). Let B = {(m 1, m 2, m, m 4 ) : m 1,..., m 4 Z, 0 m 1,..., m 4 < }. Then B has (1 + s) 4 elements, where s is the integer art of, that is, s < s + 1. Hence A > 2. For m = (m 1, nm 2, m, m 4 ) define ψ(m) = (um 1 +vm 2 +m, vm 1 +um 2 +m 4 ). Then ψ is a linear ma from R 4 to R 2. If m Z 4 then ψ(m) Z 2. We write (a, b) (a, b ) (mod ) if a a (mod ) and b b (mod ). If we have a list (a 1, b 1 ),..., (a N, b N ) of vectors in Z 2 with N > 2, then there must be some i and j with (a i, b i ) (a j, b j ) (mod ). This haens for the vectors ψ(m) with m B as B > 2. There are distinct m, n B with ψ(m) ψ(n) (mod ). Let a = m n. Then ψ(a) = ψ(m) ψ(n) 0 (mod ). Let a = (a, b, c, d). Then a = m 1 n 1 where 0 m 1, n 1 < so that a <. Similarly b, c, d <. Then a 2 +b 2 +c 2 +d 2 < 4. As m n then a (0, 0, 0, 0) and so a 2 +b 2 +c 2 +d 2 > 0. Now (0, 0) φ(a) = (ua + vb + c, va + ub + d) (mod ). Hence c ua vb (mod ) and d va ub (mod ). Then a 2 + b 2 + c 2 + d 2 a 2 + b 2 + (ua + vb) 2 + (va ub) 2 = (1 + u 2 + v 2 )(a 2 + b 2 ) 0 (mod ) As a 2 + b 2 + c 2 + d 2 is a multile of, and 0 < a 2 + b 2 + c 2 + d 2 < 4, then a 2 + b 2 + c 2 + d 2 {, 2, }. When a 2 + b 2 + c 2 + d 2 = then certainly S 4. Alas, we need to consider the bothersome cases where a 2 + b 2 + c 2 + d 2 = 2 or. Suose that a 2 + b 2 + c 2 + d 2 = 2. Then a 2 + b 2 + c 2 + d 2 2 (mod 4) so that two of a, b, c, d are odd and the other two even. Without loss of generality a and b are odd and c and d are even. Then 1(a + b), 1 (a b), (c + d) and 1 (c d) are all integers, and a simle comutation gives 2 2 ( ) 2 ( ) 2 ( ) 2 ( ) 2 a + b a b c + d c d = a2 + b 2 + c 2 + d 2 =
8 so that S 4. Finally suose that a 2 + b 2 + c 2 + d 2 =. Then a 2 + b 2 + c 2 + d 2 is a multile of but not 9. As a 2 0 or 1 (mod ) then either exactly one or all four of a, b, c and d are multiles of. But the latter case is imossible (for then a 2 + b 2 + c 2 + d 2 would be a multile of 9), so without loss of generality a and b, c, d ±1 (mod ). By relacing b by b etc., if necessary, we may assume that b c d 1 (mod ). Then Then 1(b+c+d), 1(a+b c), 1 (a + c d), 1 (a + d b), are all integers, and a simle comutation gives ( ) 2 ( ) 2 ( ) 2 ( ) 2 b + c + d a + b c a + c d a + d b = a2 + b 2 + c 2 + d 2 = so that S 4. We can now rove Lagrange s four-square theorem. Theorem 11 (Lagrange) If n N then n S 4. Proof Either n = 1 = S 4, or n is a roduct of a sequence of rimes. By Theorem 10, each rime factor of n lies in S 4. Then by Theorem 5, n S 4. We finish with some remarks about sums of three squares. This is a much harder toic than sums of two and of four squares. One reason for this is that the analogue of Theorem 5 is false. Let m = = and n = 5 = Then m S and n S but mn = 15 / S. It follows that we cannot reduce the study of sums of three squares to this roblem for rimes. Theorem If m S then m 7 (mod 8). 2. If 4n S then n S. Proof Let m = a a a 2. As a 2 j 0 or 1 (mod 4) then m k (mod 4) where k is the number of odd a j. If m 7 (mod 8) then m (mod 4) and so all of the a j are odd. But if a j is odd, then a 2 j 1 (mod 8) and so m = a a a 2 (mod 8), a contradiction. Let m = 4n = a a a 2. As m 0 (mod 4) then all of the a j are even. Hence n = (a 1 /2) 2 + (a 2 /2) 2 + (a /2) 2 S. As a consequence, if n = 4 k m where k is a nonnegative integer and m 7 (mod 8) then n S. Gauss roved in his Disquisitiones Arithmeticae that if n N is not of this form, then n S. Alas, all known roofs are too difficult to be resented in this course. 8
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 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 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 informationMersenne 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 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 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 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 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 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 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 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 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 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 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 informationFERMAT S LAST THEOREM
FERMAT S LAST THEOREM REVISITED AGAIN Colin Newton 8/0/08 0 FERMAT S LAST THEOREM When Fermat wrote a note in the margin of his coy of Bachet s Arithmetica to the effect that he had a marvellous roof that
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 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 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 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 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 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 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 informationQuadratic Reciprocity
Quadratic Recirocity 5-7-011 Quadratic recirocity relates solutions to x = (mod to solutions to x = (mod, where and are distinct odd rimes. The euations are oth solvale or oth unsolvale if either or has
More 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 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 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 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 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 informationMATH 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 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 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 informationAlgebraic 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 informationIntroductory Number Theory
Introductory Number Theory Lecture Notes Sudita Mallik May, 208 Contents Introduction. Notation and Terminology.............................2 Prime Numbers.................................. 2 2 Divisibility,
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 informationA CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod p) ZHI-HONG SUN
A CRITERION FOR POLYNOMIALS TO BE CONGRUENT TO THE PRODUCT OF LINEAR POLYNOMIALS (mod ) ZHI-HONG SUN Deartment of Mathematics, Huaiyin Teachers College, Huaian 223001, Jiangsu, P. R. China e-mail: hyzhsun@ublic.hy.js.cn
More 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 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 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 informationDedekind sums and continued fractions
ACTA ARITHMETICA LXIII.1 (1993 edekind sums and continued fractions by R. R. Hall (York and M. N. Huxley (Cardiff Let ϱ(t denote the row-of-teeth function ϱ(t = [t] t + 1/2. Let a b c... r be ositive integers.
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 informationDiscrete Mathematics with Applications MATH236
Discrete Mathematics with Applications MATH236 Dr. Hung P. Tong-Viet School of Mathematics, Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Semester 1, 2013 Tong-Viet
More informationMAT 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 informationSolutions of Benelux Mathematical Olympiad 2010
Solutions of Benelux Mathematical Olymiad 200 Problem. A finite set of integers is called bad if its elements add u to 200. A finite set of integers is a Benelux-set if none of its subsets is bad. Determine
More informationA 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#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 informationERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION
ERRATA AND SUPPLEMENTARY MATERIAL FOR A FRIENDLY INTRODUCTION TO NUMBER THEORY FOURTH EDITION JOSEPH H. SILVERMAN Acknowledgements Page vii Thanks to the following eole who have sent me comments and corrections
More informationRECIPROCITY 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 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 informationRATIONAL 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 informationMATH 361: NUMBER THEORY ELEVENTH LECTURE
MATH 361: NUMBER THEORY ELEVENTH LECTURE The subjects of this lecture are characters, Gauss sums, Jacobi sums, and counting formulas for olynomial equations over finite fields. 1. Definitions, Basic Proerties
More 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 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 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 information1 Overview and revision
MTH6128 Number Theory Notes 1 Spring 2018 1 Overview and revision In this section we will meet some of the concerns of Number Theory, and have a brief revision of some of the relevant material from Introduction
More information1. multiplication is commutative and associative;
Chapter 4 The Arithmetic of Z In this chapter, we start by introducing the concept of congruences; these are used in our proof (going back to Gauss 1 ) that every integer has a unique prime factorization.
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 information19th 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 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 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 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 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 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 informationarxiv:math/ v2 [math.nt] 21 Oct 2004
SUMS OF THE FORM 1/x k 1 + +1/x k n MODULO A PRIME arxiv:math/0403360v2 [math.nt] 21 Oct 2004 Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu
More informationSIGN CHANGES OF COEFFICIENTS OF HALF INTEGRAL WEIGHT MODULAR FORMS
SIGN CHANGES OF COEFFICIENTS OF HALF INTEGRAL WEIGHT MODULAR FORMS JAN HENDRIK BRUINIER AND WINFRIED KOHNEN Abstract. For a half integral weight modular form f we study the signs of the Fourier coefficients
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 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 informationFrobenius Elements, the Chebotarev Density Theorem, and Reciprocity
Frobenius Elements, the Chebotarev Density Theorem, and Recirocity Dylan Yott July 30, 204 Motivation Recall Dirichlet s theorem from elementary number theory. Theorem.. For a, m) =, there are infinitely
More informationOn the Rank of the Elliptic Curve y 2 = x(x p)(x 2)
On the Rank of the Ellitic Curve y = x(x )(x ) Jeffrey Hatley Aril 9, 009 Abstract An ellitic curve E defined over Q is an algebraic variety which forms a finitely generated abelian grou, and the structure
More informationSQUARES IN Z/NZ. q = ( 1) (p 1)(q 1)
SQUARES I Z/Z We study squares in the ring Z/Z from a theoretical and comutational oint of view. We resent two related crytograhic schemes. 1. SQUARES I Z/Z Consider for eamle the rime = 13. Write the
More information2 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 information2 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 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 informationSmall Zeros of Quadratic Forms Mod P m
International Mathematical Forum, Vol. 8, 2013, no. 8, 357-367 Small Zeros of Quadratic Forms Mod P m Ali H. Hakami Deartment of Mathematics, Faculty of Science, Jazan University P.O. Box 277, Jazan, Postal
More informationAdvanced Cryptography Midterm Exam
Advanced Crytograhy Midterm Exam Solution Serge Vaudenay 17.4.2012 duration: 3h00 any document is allowed a ocket calculator is allowed communication devices are not allowed the exam invigilators will
More informationARITHMETIC 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 informationPRIME 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 informationTHUE-VINOGRADOV AND INTEGERS OF THE FORM x 2 + Dy 2. Contents. Introduction Study of an Elementary Proof
THUE-VINOGRADOV AND INTEGERS OF THE FORM x 2 + Dy 2 PETE L. CLARK Contents Introduction Study of an Elementary Proof 1 1. The Lemmas of Thue and Vinogradov 4 2. Preliminaries on Quadratic Recirocity and
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 informationPOINTS ON CONICS MODULO p
POINTS ON CONICS MODULO TEAM 2: JONGMIN BAEK, ANAND DEOPURKAR, AND KATHERINE REDFIELD Abstract. We comute the number of integer oints on conics modulo, where is an odd rime. We extend our results to conics
More informationAn 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 informationAN 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 informationSQUAREFREE 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 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 informationComplex Analysis Homework 1
Comlex Analysis Homework 1 Steve Clanton Sarah Crimi January 27, 2009 Problem Claim. If two integers can be exressed as the sum of two squares, then so can their roduct. Proof. Call the two squares that
More informationErnie Croot 1. Department of Mathematics, Georgia Institute of Technology, Atlanta, GA Abstract
SUMS OF THE FORM 1/x k 1 + + 1/x k n MODULO A PRIME Ernie Croot 1 Deartment of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332 ecroot@math.gatech.edu Abstract Using a sum-roduct result
More informationLecture 4: Number theory
Lecture 4: Number theory Rajat Mittal IIT Kanpur In the next few classes we will talk about the basics of number theory. Number theory studies the properties of natural numbers and is considered one of
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 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 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 informationSome Own Problems In Number Theory
Some Own Problems In Number Theory Mathmdmb April 16, 2011 Here are some problems proposed by me, and the problems or their solutions have not been approved by someone else. So if any fault occurs, I shall
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 informationOn the Diophantine Equation x 2 = 4q n 4q m + 9
JKAU: Sci., Vol. 1 No. 1, : 135-141 (009 A.D. / 1430 A.H.) On the Diohantine Equation x = 4q n 4q m + 9 Riyadh University for Girls, Riyadh, Saudi Arabia abumuriefah@yahoo.com Abstract. In this aer, we
More information16 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 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 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 informationCONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION
CONGRUENCE PROPERTIES MODULO 5 AND 7 FOR THE POD FUNCTION SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer, we rove arithmetic roerties modulo 5 7 satisfied by the function odn which denotes the
More informationPROBLEM SET 5 SOLUTIONS. Solution. We prove that the given congruence equation has no solutions. Suppose for contradiction that. (x 2) 2 1 (mod 7).
PROBLEM SET 5 SOLUTIONS 1 Fid every iteger solutio to x 17x 5 0 mod 45 Solutio We rove that the give cogruece equatio has o solutios Suose for cotradictio that the equatio x 17x 5 0 mod 45 has a solutio
More informationLegendre polynomials and Jacobsthal sums
Legendre olynomials and Jacobsthal sums Zhi-Hong Sun( Huaiyin Normal University( htt://www.hytc.edu.cn/xsjl/szh Notation: Z the set of integers, N the set of ositive integers, [x] the greatest integer
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 informationInfinitely Many Quadratic Diophantine Equations Solvable Everywhere Locally, But Not Solvable Globally
Infinitely Many Quadratic Diohantine Equations Solvable Everywhere Locally, But Not Solvable Globally R.A. Mollin Abstract We resent an infinite class of integers 2c, which turn out to be Richaud-Degert
More information