By Evan Chen OTIS, Internal Use
|
|
- Kelley Ford
- 6 years ago
- Views:
Transcription
1 Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 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 exists a ositive integer m for which the equation ϕ(n) = m has at least 015 solutions in n. I consider the following ELEVEN PRIME NUMBERS: S = {11, 13, 17, 19, 9, 31, 37, 41, 43, 61, 71}. It has the roerty that for any S, all rime factors of 1 are one digit. Let N = (10) billion, and consider M = φ (N). For any subset T S, we have M = φ N T ( 1). Since T > 015 we re done. This solution was motivated by the dee fact that ϕ( ) = ϕ( ), for examle. T Solution Notes to IMO 003/6 Let be a rime number. Prove that there exists a rime number q such that for every integer n, the number n is not divisible by q. By orders, we must have q = k + 1 for this to be ossible. So we just need n k 1 (mod q). So we need a rime q 1 (mod ) such that k 1 (mod q). Wishfully we hoe the order of is and k. One way to do this is extract a rime factor from the cyclotomic olynomial 1 1 which does not haen to be 1 (mod ). Internal use: Olymiad Training for Individual Study (OTIS). Last udate January 17,
2 Evan Chen (January 17, 018) 3 Solution Notes to December TST 015/ Prove that for every ositive integer n, there exists a set S of n ositive integers such that for any two distinct a, b S, a b divides a and b but none of the other elements of S. The idea is to look for a sequence d 1,..., d n 1 of differences such that the following two conditions hold. Let s i = d d i 1, and t i,j = d i + + d j 1 for i j. (i) No two of the t i,j divide each other. (ii) There exists an integer a satisfying the CRT equivalences a s i (mod t i,j ) i j Then the sequence a + s 1, a + s,..., a + s n will work. For examle, when n = 3 we can take (d 1, d ) = (, 3) giving 5 {}}{ 10 }{{} 1 }{{} 15 because the only conditions we need satisfy are 3 a 0 (mod ) a 0 (mod 5) a (mod 3). But with this setu we can just construct the d i inductively. To go from n to n+1, take a d 1,..., d n 1 and let be a rime not dividing any of the d i. Moreover, let M = n 1 i=1 d i. Then we claim that d 1 M, d M,..., d n 1 M, is such a difference sequence. For examle, the revious examle extends as follows {}}{ 907 {}}{ a }{{} b }{{} c }{{} d The new numbers, + Md n 1, + Md n,... are all relatively rime to everything else. Hence (i) still holds. To see that (ii) still holds, just note that we can still get a family of solutions for the first n terms, and then the last n + 1th term can be made to work by Chinese Remainder Theorem since all the new + Md k are corime to everything. 7 4 Solution Notes to USAMO 017/1 Prove that there exist infinitely many airs of relatively rime ositive integers a, b > 1 for which a + b divides a b + b a. One construction: let d 1 (mod 4), d > 1. Let x = dd + d d+. Then set a = x + d, b = x d.
3 Evan Chen (January 17, 018) To see this works, first check that b is odd and a is even. Let d = a b be odd. Then: a + b a b + b a ( b) b + b a 0 (mod a + b) b a b 1 (mod a + b) b d 1 (mod d + b) ( ) d d d (mod d + b) d + b d d + d. So it would be enough that d + b = dd + d d + = b = 1 ( d d + d d + ) d which is what we constructed. Also, since gcd(x, d) = 1 it follows gcd(a, b) = gcd(d, b) = 1. Remark. Ryan Kim oints out that in fact, (a, b) = (n 1, n + 1) is always a solution. 5 Solution Notes to JMO 016/ Prove that there exists a ositive integer n < 10 6 such that 5 n has six consecutive zeros in its decimal reresentation. One answer is n = = First, observe that 5 n 5 0 (mod 5 0 ) 5 n 5 0 (mod 0 ) the former being immediate and the latter since ϕ( 0 ) = 19. Hence 5 n 5 0 (mod 10 0 ). Moreover, we have 5 0 = < = Thus the last 0 digits of 5 n will begin with six zeros. 6 Solution Notes to Shortlist 007 N Let b, n > 1 be integers. Suose that for each k > 1 there exists an integer a k such that b a n k is divisible by k. Prove that b = An for some integer A. Just let k = b, so b C n (mod b ). Hence C n = b(bx + 1), but gcd(b, bx + 1) = 1 so b = A n for some A. 7 Solution Notes to IMO 000/5 Does there exist a ositive integer n such that n has exactly 000 rime divisors and n divides n + 1? 3
4 Evan Chen (January 17, 018) Answer: Yes. We say that n is Korean if n n + 1. First, observe that n = 9 is Korean. Now, the roblem is solved uon the following claim: Claim. If n > 3 is Korean, there exists a rime not dividing n such that n is Korean too. Proof. I claim that one can take any rimitive rime divisor of n 1, which exists by Zsigmondy theorem. Obviously. Then: Since ϕ(n) 1 it follows then that n. Moreover, n + 1 since n 1. Hence n n + 1 n + 1 by Chinese Theorem, since gcd(n, ) = 1. 8 Solution Notes to BAMO 011/5 Decide whether there exists a row of Pascal s triangle containing four airwise distinct numbers a, b, c, d such that a = b and c = d. An examle is ( ) ( = 03 ) ( 67 and 03 ) ( 85 = 03 ) 83. To get this, the idea is to look for two adjacent entries and two entries off by one, and solving the corresonding equations. The first one is simle: ( ) ( ) n n = = n = 3j 1. j j 1 The second one is more involved: ( ) ( ) n n = k k = (n k + 1)(n k + ) = k(k 1) = 4(n k + 1)(n k + ) = 8k(k 1) = (n k + 3) 1 = ( (k 1) 1 ) = (n k + 3) (k 1) = 1 Using standard methods for the Pell equation: (7 + 5 )(3 + ) = So k = 15, n = 34, doesn t work. ( )(3 + ) = Then k = 85, n = Solution Notes to TSTST 01/5 A rational number x is given. Prove that there exists a sequence x 0, x 1, x,... of rational numbers with the following roerties: (a) x 0 = x; (b) for every n 1, either x n = x n 1 or x n = x n n ; (c) x n is an integer for some n. 4
5 Evan Chen (January 17, 018) Think of the sequence as a rocess over time. We ll show that: Claim. At any given time t, if the denominator of x t is some odd rime ower q = e, then we can delete a factor of from the denominator, while only adding owers of two to the denominator. (Thus we can just delete off all the odd rimes one by one and then double aroriately many times.) Proof. The idea is to add only fractions of the form ( k q) 1. Indeed, let n be large, and suose t < r+1 q < r+ q < < r+m q < n. For some binary variables ε i {0, 1} we can have x n = n t x t + c 1 ε1 q + c ε q + c s εm q where c i is some ower of (to be exact, c i = n r+i q, but the exact value doesn t r+1 matter). If m is large enough the set {0, c 1 } + {0, c } + + {0, c m } sans everything modulo. (Actually, Cauchy-Davenort imlies m = is enough, but one can also just use Pigeonhole to notice some residue aears more than times, for m = O( ).) Thus we can eliminate one factor of from the denominator, as desired. 10 Solution Notes to Shortlist 014 N4 Let n > 1 be an integer. Prove that there are infinitely many integers k 1 such that n k is odd. k If n is odd, then we can ick any rime dividing n, and select k = m for sufficiently large integers m. Suose n is even now. Then by Kobayashi s Theorem, there exist infinitely many rimes dividing some number of the form n nr 1 1. for some integer r. Let > n be such a rime, with corresonding integer r. It then follows that n nr n r (mod n r ) since this is clearly correct mod n r, and also correct modulo. If we select k = n r, we have n k = nr n r which is odd. k n r 5
6 Evan Chen (January 17, 018) 11 Solution Notes to USAMO 006/3 For integral m, let (m) be the greatest rime divisor of m. By convention, we set (±1) = 1 and (0) =. Find all olynomials f with integer coefficients such that the sequence { ( f ( n )) n} n 0 is bounded above. (In articular, this requires f(n ) 0 for n 0.) If f is the (ossibly emty) roduct of linear factors of the form 4n a, then it satisfies the condition. We will rove no other olynomials work. In what follows, assume f is irreducible and nonconstant. It suffices to show for every ositive integer c, there exists a rime and a nonnegative integer n such that n 1 c and divides f(n ). Firstly, recall there are infinitely many odd rimes, with > c, such that divides some f(n ), by Schur s Theorem. Looking mod such a we can find n between 0 and 1 (since n ( n) (mod )). We claim that only finitely many from this set can fail now. For if a fails, then its n must be between 1 c and 1. That means for some 0 k c we have ( ( ) ) ( 1 ( 0 f k f k + 1 ) ) (mod ). There are only finitely many dividing ( c ( f k + 1 ) ) k=1 unless one of the terms in the roduct is zero; this means that 4n (k + 1) divides f(n). This establishes the claim and finishes the roblem. 1 Solution Notes to USAMO 013/5 Let m and n be ositive integers. Prove that there exists an integer c such that cm and cn have the same nonzero decimal digits. One-line soiler: To work out the details, there exist arbitrarily large rimes such that 10 e m n for some ositive integer e, say by Kobayashi theorem (or other more mundane means). In that case, the eriodic decimal exansions of m and n are cyclic shifts of each other. Thus if one looks at 1 the reeating block of decimals, one may take c to be that resulting integer. Remark. The official USAMO solutions roose using the fact that 10 is a rimitive root modulo 7 e for each e 1, by Hensel lifting lemma. This argument is incorrect, because it breaks if either m or n are divisible by 7. One may be temted to resort to using large rimes rather than owers of 7 to deal with this issue. However it is an oen conjecture (a secial case of Artin s rimitive root conjecture) whether or not 10 (mod ) is rimitive infinitely often, which is the condition necessary for this argument to work. 6
7 Evan Chen (January 17, 018) 13 Solution Notes to RMM 01/4 Prove there are infinitely many integers n such that n does not divide n + 1, but divides n Zsig hammer! Define the sequence n 0, n 1,... as follows. Set n 0 = 3, and then for k 1 we let n k = n k 1 where is a rimitive rime divisor of n k (by Zsigmondy). For examle, n 1 = 57. This sequence of n k s works for k 1, by construction. It s very similar to IMO 000 Problem Solution Notes to Shortlist 013 N4 Determine whether there exists an infinite sequence of nonzero digits a 1, a, a 3,... such that the number a k a k 1... a 1 is a erfect square for all sufficiently large k. The answer is no. Assume for contradiction such a sequence exists, and let x k = a k a k 1... a 1 for k large enough. Difference of squares gives def A k B k = (x k+1 x k )(x k + x k+1 ) = a k 10 k with gcd(a k, B k ) = gcd(x k, x k 1 ) since x k and x k 1 have the same arity. Note that we have the inequalities A k B k < x k+1 < 10 k+1. The idea will be that divisibility issues will force one of A k and B k to be too large. We now slit the roof in two cases: First, assume ν 5 (x k ) k for all k. Then in articular a 1 = 5, so all x k are always odd. So one of A k and B k is divisible by k 1. Moreover, both divisible by at least 5 k/. So for each k, min(a k, B k ) k 1 5 k/ which is imossible for large enough k. Next assume ν 5 (x m) = e < m for some m. Then since x k+1 x k (mod 10k ), we obtain ν 5 (x k ) = e for all k > m. Now, min(a k, B k ) 5 k e which again is imossible for k large enough. 15 Solution Notes to EGMO 014/3 We denote the number of ositive divisors of a ositive integer m by d(m) and the number of distinct rime divisors of m by ω(m). Let k be a ositive integer. Prove that there exist infinitely many ositive integers n such that ω(n) = k and d(n) does not divide d(a + b ) for any ositive integers a, b satisfying a + b = n. 7
8 Evan Chen (January 17, 018) Weird roblem. The condition is very artificial, although the construction is kind of fun. I m guessing the low scores during the actual contest were actually due to an unusually tricky P. Let n = 1 t, where t 5 (mod 6), ω(t) = k 1, and t is a sufficiently large rime. Let a + b = n and a + b = c. We claim that d(c), which solves the roblem since (n). First, note that 3 a + b, since 3 n. Next, note that c < n < 5 1 (since t) so no exonent of an odd rime in c exceeds. Moreover, c < 3 1. So, it remains to check that ν (c) / { 1, 1}. On the one hand, if ν (a) < ν (b), then ν (a) = 1 and ν (c) = ν (a) =. On the other hand, if ν (a) = ν (b) then ν (a), and ν (c) = ν (a) + 1 is odd and less than Solution Notes to USAMO 01/3 Determine which integers n > 1 have the roerty that there exists an infinite sequence a 1, a, a 3,... of nonzero integers such that the equality holds for every ositive integer k. a k + a k + + na nk = 0 Answer: all n >. For n =, we have a k +a k = 0, which is clearly not ossible, since it imlies a k = a 1 k for all k. For n 3 we will construct a comletely multilicative sequence (meaning a ij = a i a j for all i and j). Thus (a i ) is determined by its value on rimes, and satisfies the condition as long as a 1 + a + + na n = 0. The idea is to take two large rimes and use Bezout s theorem, but the details require significant care. We start by solving the case where n 9. In that case, by Bertrand ostulate there exists rimes and q such that n/ < q < n/. and 1 (q 1) < < q 1 Clearly q, and q 7, so > 3. Also, < q < n but q > n, and 4 4 ( 1 (q + 1)) > n. We now stiulate that a r = 1 for any rime r, q (in articular including r = and r = 3). There are now three cases, identical in substance. If,, 3 [1, n] then we would like to choose nonzero a and a q such that 6 a + q a q = 6 + q 1 n(n + 1) which is ossible by Bézout lemma, since gcd(6, q) = 1. Else if, [1, n] then we would like to choose nonzero a and a q such that 3 a + q a q = 3 + q 1 n(n + 1) which is ossible by Bézout lemma, since gcd(3, q) = 1. 8
9 Evan Chen (January 17, 018) Else if [1, n] then we would like to choose nonzero a and a q such that a + q a q = + q 1 n(n + 1) which is ossible by Bézout lemma, since gcd(, q) = 1. (This case is actually ossible in a few edge cases, for examle when n = 9, q = 7, = 5.) It remains to resolve the cases where 3 n 8. We enumerate these cases manually: For n = 3, let a n = ( 1) ν 3(n). For n = 4, let a n = ( 1) ν (n)+ν 3 (n). For n = 5, let a n = ( ) ν 5(n). For n = 6, let a n = 5 ν (n) 3 ν 3(n) ( 4) ν 5(n). For n = 7, let a n = ( 3) ν 7(n). For n = 8, we can choose (, q) = (5, 7) in the rior construction. This comletes the constructions for all n >. 17 Solution Notes to TSTST 016/3 Decide whether or not there exists a nonconstant olynomial Q(x) with integer coefficients with the following roerty: for every ositive integer n >, the numbers Q(0), Q(1), Q(),..., Q(n 1) roduce at most 0.499n distinct residues when taken modulo n. We claim that Q(x) = 40(x 1) works. Clearly, it suffices to rove the result when n = 4 and when n is an odd rime. The case n = 4 is trivial, so assume now n = is an odd rime. First, we rove the following easy claim. ( ) Claim. For any odd rime, there are at least 1 ( 3) values of a for which 1 a = +1. Proof. Note that if k 0, k ±1, k 1, then a = (k + k 1 ) 1 works. Also a = 0 works. Let F (x) = (x 1). The range of F modulo is contained within the 1 ( + 1) quadratic residues modulo. On the other hand, if for some t neither of 1 ± t is a quadratic residue, then t is omitted from the range of F as well. Call such a value of t useful, and let N be the number of useful residues. We aim to show N
10 Evan Chen (January 17, 018) We comute a lower bound on the number N of useful t by writing ( N = 1 [( ( )) ( ( ))] ( 1 t 1 + t t 1 [( ( )) ( ( ))] 1 t 1 + t t ( ( ) ) 1 t 1 ( )) ( 1 ( )) ) = t 1 4 ( + (+1) 1 ( 3) ( 1) (( ) 1 ( 3))) 1 1 ( 5). 4 Thus, the range of F has size at most This is less than for any ( + 1) 1 N 3 ( + 3). 8 Remark. In fact, the comutation above is essentially an equality. There are only two oints where terms are droed: one, when 3 (mod 4) there are no k = 1 in the lemma, and secondly, the terms 1 (/) and 1 ( /) are droed in the initial estimate for N. With suitable modifications, one can show that in fact, the range of F is exactly equal to 1 8 (3 + 5) 1 (mod 8) 1 ( + 1) 1 1 N = 8 (3 + 7) 3 (mod 8) 1 8 (3 + 9) 5 (mod 8) 1(3 + 3) 7 (mod 8). 8 10
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 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 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 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 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 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 informationPythagorean triples and sums of squares
Pythagorean triles and sums of squares Robin Chaman 16 January 2004 1 Pythagorean triles A Pythagorean trile (x, y, z) is a trile of ositive integers satisfying z 2 + y 2 = z 2. If g = gcd(x, y, z) then
More 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 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 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 informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More 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 informationThe Euler Phi Function
The Euler Phi Function 7-3-2006 An arithmetic function takes ositive integers as inuts and roduces real or comlex numbers as oututs. If f is an arithmetic function, the divisor sum Dfn) is the sum of the
More informationThe Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001
The Hasse Minkowski Theorem Lee Dicker University of Minnesota, REU Summer 2001 The Hasse-Minkowski Theorem rovides a characterization of the rational quadratic forms. What follows is a roof of the Hasse-Minkowski
More 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 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 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 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 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 informationMobius Functions, Legendre Symbols, and Discriminants
Mobius Functions, Legendre Symbols, and Discriminants 1 Introduction Zev Chonoles, Erick Knight, Tim Kunisky Over the integers, there are two key number-theoretic functions that take on values of 1, 1,
More 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 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 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 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 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 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 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 informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More 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 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 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 informationA CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS. 1. Abstract
A CONCRETE EXAMPLE OF PRIME BEHAVIOR IN QUADRATIC FIELDS CASEY BRUCK 1. Abstract The goal of this aer is to rovide a concise way for undergraduate mathematics students to learn about how rime numbers behave
More 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 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 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 informationMarch 4, :21 WSPC/INSTRUCTION FILE FLSpaper2011
International Journal of Number Theory c World Scientific Publishing Comany SOLVING n(n + d) (n + (k 1)d ) = by 2 WITH P (b) Ck M. Filaseta Deartment of Mathematics, University of South Carolina, Columbia,
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More 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 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 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 informationp-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 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 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 informationTHE DIOPHANTINE EQUATION x 4 +1=Dy 2
MATHEMATICS OF COMPUTATION Volume 66, Number 9, July 997, Pages 347 35 S 005-57897)0085-X THE DIOPHANTINE EQUATION x 4 +=Dy J. H. E. COHN Abstract. An effective method is derived for solving the equation
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 informationCharacteristics of Fibonacci-type Sequences
Characteristics of Fibonacci-tye Sequences Yarden Blausa May 018 Abstract This aer resents an exloration of the Fibonacci sequence, as well as multi-nacci sequences and the Lucas sequence. We comare and
More 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 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 information= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2
8. p-adic numbers 8.1. Motivation: Solving x 2 a (mod p n ). Take an odd prime p, and ( an) integer a coprime to p. Then, as we know, x 2 a (mod p) has a solution x Z iff = 1. In this case we can suppose
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 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 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 informationWinter Camp 2009 Number Theory Tips and Tricks
Winter Camp 2009 Number Theory Tips and Tricks David Arthur darthur@gmail.com 1 Introduction This handout is about some of the key techniques for solving number theory problems, especially Diophantine
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 informationAlmost 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 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 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 informationSolvability 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 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 informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
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 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 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 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 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 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 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/25/2018 LINEAR INDEPENDENCE LINEAR INDEPENDENCE LINEAR INDEPENDENCE LINEAR INDEPENDENCE
/25/28 Definition: An indexed set of vectors {v,, v } in R n is said to be linearly indeendent if the vector equation x v x v... x v 2 2 has only the trivial solution. The set {v,, v } is said to be linearly
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 informationON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 000-9939XX)0000-0 ON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS WILLIAM D. BANKS AND ASMA HARCHARRAS
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 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 informationf(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 informationMATH 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#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationDiophantine Equations and Congruences
International Journal of Algebra, Vol. 1, 2007, no. 6, 293-302 Diohantine Equations and Congruences R. A. Mollin Deartment of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada,
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 informationPARTITIONS 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 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 informationarxiv: v2 [math.nt] 9 Oct 2018
ON AN EXTENSION OF ZOLOTAREV S LEMMA AND SOME PERMUTATIONS LI-YUAN WANG AND HAI-LIANG WU arxiv:1810.03006v [math.nt] 9 Oct 018 Abstract. Let be an odd rime, for each integer a with a, the famous Zolotarev
More informationChapter 3. Number Theory. Part of G12ALN. Contents
Chater 3 Number Theory Part of G12ALN Contents 0 Review of basic concets and theorems The contents of this first section well zeroth section, really is mostly reetition of material from last year. Notations:
More informationWhen do Fibonacci invertible classes modulo M form a subgroup?
Calhoun: The NPS Institutional Archive DSace Reository Faculty and Researchers Faculty and Researchers Collection 2013 When do Fibonacci invertible classes modulo M form a subgrou? Luca, Florian Annales
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 informationarxiv:math/ v1 [math.nt] 5 Apr 2006
arxiv:math/0604119v1 [math.nt] 5 Ar 2006 SUMS OF ARITHMETIC FUNCTIONS OVER VALUES OF BINARY FORMS R. DE LA BRETÈCHE AND T.D. BROWNING Abstract. Given a suitable arithmetic function h : N R 0, and a binary
More informationt s (p). An Introduction
Notes 6. Quadratic Gauss Sums Definition. Let a, b Z. Then we denote a b if a divides b. Definition. Let a and b be elements of Z. Then c Z s.t. a, b c, where c gcda, b max{x Z x a and x b }. 5, Chater1
More 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 informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationp-adic Properties of Lengyel s Numbers
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 17 (014), Article 14.7.3 -adic Proerties of Lengyel s Numbers D. Barsky 7 rue La Condamine 75017 Paris France barsky.daniel@orange.fr J.-P. Bézivin 1, Allée
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 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 information#A8 INTEGERS 12 (2012) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS
#A8 INTEGERS 1 (01) PARTITION OF AN INTEGER INTO DISTINCT BOUNDED PARTS, IDENTITIES AND BOUNDS Mohammadreza Bidar 1 Deartment of Mathematics, Sharif University of Technology, Tehran, Iran mrebidar@gmailcom
More informationOutline. EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150 - Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
More informationElementary Proof That There are Infinitely Many Primes p such that p 1 is a Perfect Square (Landau's Fourth Problem)
Elementary Proof That There are Infinitely Many Primes such that 1 is a Perfect Square (Landau's Fourth Problem) Stehen Marshall 7 March 2017 Abstract This aer resents a comlete and exhaustive roof of
More informationNew weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review
University of Wollongong Research Online Faculty of Informatics - Paers (Archive) Faculty of Engineering and Information Sciences 1999 New weighing matrices and orthogonal designs constructed using two
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 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 information