SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, 2015
|
|
- Edgar Hodges
- 5 years ago
- Views:
Transcription
1 SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS COURSE NOTES, Squarefree values of olynomials: History In this section we study the roblem of reresenting square-free integers by integer olynomials. It is conjectured that a searable olynomial (that is, without reeated roots) f Z[x] takes infinitely many square-free values, barring some simle excetional cases, in fact that the integers a for which f(a) is square-free have a ositive density. A clear necessary condition is that the sequence f(n) has no fixed square divisor; the conjecture is that this is the only obstruction: Conjecture 1. Let f(x) Z[x] be a searable olynomial (i.e. with no reeated roots) of ositive degree. Assume that gcd{f(n) : n Z} is squarefree 1. Then there are infinitely many square-free values taken by f(n), in fact that a ositive roortion of the values are square-free: with #{1 n X : f(n) is square-free } c f X, as X, (1.1) c f = where (1 ρ f ( 2 ) 2 ), (1.2) ρ f (D) = #{c mod D : f(c) = 0 mod D}. The roblem is most difficult when f is irreducible. Nagell ([6] 1922) showed the infinitude of squarefree values in the quadratic case. Estermann ([2] 1931) gave ositive density for the case f(x) = x 2 + k. The general quadratic case was solved by Ricci in 1933 [7]. For cubics, Erdös ([1], 1953) showed that there are infinitely many square-free values, and Hooley ([4], 1967) gave the result about ositive density. Beyond that nothing seems known unconditionally for irreducible f, for instance it is still not known that a is infinitely often square-free. Date: March 29, In fact one can even allow fixed, square divisors of f(n), rovided we divide them out in advance, by relacing f(n) by f(n)/b, where B is the smallest divisor of B := gcd{f(n) : n Z} so that B/B is square-free, and if we relace c f by (1 ω f () 2+q ), where for each rime, we denote by q the largest ower of dividing B, and by ω f () the number of a mod 2+q for which f(a)/b = 0 mod 2. 1
2 2 A roblem which has recently been solved is to ask how often an irreducible olynomial f Z[x] of degree d attains values which are free of (d 1)-th owers, either when evaluated at integers or at rimes, see [8] The ABC conjecture. Granville [3] showed that the ABC conjecture comletely solves the conjecture 1. The ABC conjecture states that for every ε > 0, there exist only finitely many triles (a, b, c) of ositive corime integers, with a + b = c, such that c > rad(abc) 1+ε. Here the radical of an integer is the roduct of all distinct rimes dividing it: rad(n) := N. Equivalently, for every ε > 0, there exists a constant K ε such that for all triles (a, b, c) of corime ositive integers, with a + b = c, we have c < K ε rad(abc) 1+ε. 2. The density c f We ause to analyze the conjectural density c f of squarefree values of f, given by (1.1). Exercise 1. Assume that f(n) admits no common square factor. Show that c f > 0, i.e. that ρ f ( 2 ) < 2 for all rimes. By the Chinese remainder theorem, D ρ f (D) is a multilicative function The slit quadratic case f(x) = x(x + 1). Lemma 2.1. Suose f(x) = x(x + 1). Then for all rime, and k 1, ρ( k ) = 2. Proof. We want to count solutions modulo k of c(c + 1) = 0 mod k. But since is rime, and c, c+1 have no common factors, this means that either c = 0 mod k or c + 1 = 0 mod k and each case has exactly one solution. Thus ρ f ( k ) = The irreducible quadratic case f(x) = x Lemma 2.2. Suose f(x) = x i) If 2 then ρ( k ) = ρ() for all k 1. iii) For 2, { 2, = 1 mod 4 ρ() = 0, = 3 mod 4 iii) ρ(4) = 0. Proof. Part (i) follows from Hensel s Lemma, and is valid for any olynomial f Z[x], for disc(f). Part (ii) is secific to f(x) = x and is due to Fermat. Part (iii) is a direct comutation.
3 SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS 3 Note: The above shows that for f(x) = x 2 + 1, our density c f is ( ) (2.1) c f = (1 ρ(2 ) 2 ) = (1 2 ) = The quadratic case Our goal here is to treat the quadratic case, in fact below we will secialize to the simle cases of f(x) = x(x + 1) (the slit case) and f(x) = x (the irreducible case). For X 1, we set and N(X) := #N (X). N (X) := {n X : f(n) squarefree} Theorem 3.1. Let f(x) = x(x + 1) or f(x) = x Then N(X) = c f X + O(X 2/3 log X), as X with c f = C slit = (1 2 2 ) in the slit case f(x) = x(x + 1), and c f = 2 (1 1+( 1 ) 2 ) = in the irreducible case f(x) = x Note that in the slit case, since n(n + 1) is squarefree if and only if both n and n + 1 are squarefree (because n, n + 1 are corime), the result says that the robability that both n and n + 1 are squarefree is C slit = (1 2 2 ) = , which is smaller than 1/ζ(2) 2 = (1 2/2 + 1/ 4 ) = , which would be the case if these were indeendent events The strategy. We use the sieve of Eratosthenes and Legendre: Recall that the indicator function of the squarefrees is Hence N(X) = n X 1 SF (f(n)) = n X 1 SF (m) = d 2 m µ(d). d 2 f(n) µ(d) = µ(d)#{n X : d 2 f(n)} d X Note that we can constrain d X because d 2 divides the quadratic olynomial f(n), which is X 2 if n X. We ick a arameter Y (eventually taken to be Y = X 1/3 ) and decomose the sum into two arts, a sum N (X) over small divisors d < Y, and a sum N (X) over large divisors Y < d < X: N(X) = N (X) + N (X), N (X) = µ(d)#{n X : d 2 f(n)} and N (X) = µ(d)#{n X : d 2 f(n)} Y <d X
4 4 We will show that (3.1) N (X) = c f X + O( X Y log Y + Y log Y ) and (3.2) N (X) X2 Y 2 Taking Y = X 1/3 we obtain giving Theorem 3.1. N(X) = c f X + O(X 2/3 log X) 4. The main term: small divisors We will estimate N (X) (the main term) by using inclusion-exclusion. Recall N (X) = µ(d)#{n X : d 2 f(n)}. Lemma 4.1. Proof. We decomose Using we get #{n X : D f(n)} = Xρ(D) ( ) D + O ρ(d). #{n X : D f(n)} = C mod D f(c)=0 mod D #{n X : n = C mod D}. #{n X : n = C mod D} = X D + O(1) #{n X : D f(n)} = C mod D f(c)=0 mod D X D + O(1) = Xρ(D) D + ρ(d). (4.1) Hence we obtain N (X) = = X ( Xρ(d 2 ) ) µ(d) d 2 + O(ρ(d 2 )) µ(d)ρ(d 2 ) d 2 ( + O ) µ(d) ρ(d 2 ).
5 We have SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS 5 µ(d)ρ(d 2 ) d 2 = d=1 µ(d)ρ(d 2 ) d 2 ( + O Using multilicativity of ρ (and of µ) gives µ(d)ρ(d 2 ) d 2 = (1 ρ(2 ) 2 ) = c f. d=1 µ(d) ρ(d 2 ) ) d 2 By Lemmas 2.1 and 2.2, ρ( 2 ) 2 for rime, and thus for d squarefree ρ(d 2 ) = d ρ( 2 ) d 2 = τ(d) where τ is the divisor function. Hence the tail of the sum is bounded by µ(d) ρ(d 2 ) d 2 τ(d) d 2 log Y Y and the remainder in (4.1) is bounded by µ(d) ρ(d 2 ) τ(d) Y log Y. Therefore as claimed. N (X) = c f X + O( X Y log Y ) + O(Y log Y ) Exercise 2. Using n x τ(n) = x(log x + C) + O(x1/2 ), show that n>y τ(n) n 2 = log Y + C + 2 Y 1 + O( Y 3/2 ) 5. Bounding the contribution of large divisors We write the condition d 2 f(n) as f(n) = d 2 D for some integer D 1. Then N (X) = µ(d) #{n X : f(n) = d 2 D}. n X d 2 f(n) We now interchange the roles of d and D: If d > Y then D = f(n)/d 2 X 2 /Y 2. Hence ignoring the size and squarefreeness restriction on d, (5.1) N (X) #{u, v X : f(u) = v 2 D}. 1 D X 2 /Y 2 Now take f(x) = x Then the equation f(u) = Dv 2 becomes which is a Pellian equation. u 2 Dv 2 = 1
6 6 The main new arithmetic ingredient we need now is a bound on the number of solutions of the Pellian equation x 2 Dy 2 = 1 lying in a box of side X: Let (5.2) S D (X) := #{(x, y) [1, X] 2 : x 2 Dy 2 = 1} Proosition 5.1. Suose 1 < D < X is not a erfect square. Then S D (X) log X log D. If D = is a erfect square, then there are are no solutions of x 2 Dy 2 = 1 if D > 1, while for D = 1 there are 2 solutions. Proof. Suose D > 1 is not a erfect square. By the theory of Pell s equation, if the equation x 2 Dy 2 = 1 is solvable in integers, then all integer solutions (x, y) are of the form x + Dy = ±ɛ 2n+1 D, n Z, where ɛ D = x 1 + y 1 D is the fundamental solution, with x1, y 1 1. Hence if 1 x, y X then x + y D = ɛ 2n+1 D for some n 0 and then 0 n log(x + Dy) = log(x + x 2 + 1) log X. 2 log ɛ D 2 log ɛ D log ɛ D Since ɛ D = x 1 + y 1 D > D, we obtain S D (X) log X log D. For D = C 2 a erfect square, the equation x 2 Cy 2 = 1 becomes x 2 (Cy) 2 = 1 or (Cy x)(cy+x) = 1, which forces Cy x = Cy+x = ±1, so that x = 0, and then C 2 y 2 = 1 is solvable only for C = 1 in which case there are two solutions. Inserting Proosition 5.1 into the bound (5.1) for N 2 gives N 2 log X S D (X) 1 + log D X2 Y 2 1 D<X 2 /Y 2 1<D<X 2 /Y 2 as claimed, on using 1<D<Z 1 Z log D 2 1 log t dt Z log Z Other quadratic olynomials. The considerations above extend to the case when f(x) = Ax 2 +Bx+C Z[x] is any quadratic olynomial, say f(x) = x(x + 1) (the slit case). All we have to do is rewrite the equation f(u) = Dv 2 : Multilying by 4A and comleting the square gives 4ADv 2 = (2Au + B) 2 f where f = B 2 4AC is the discriminant of f, which is nonzero if and only if f has no reeated roots. Thus the equation f(u) = Dv 2 becomes (2Au + B) 2 AD(2v) 2 = f
7 SQUAREFREE VALUES OF QUADRATIC POLYNOMIALS 7 and we need to bound the number of solutions of U 2 (AD)V 2 = f with U, V X. For instance, in the slit case f(x) = x 2 +x we get = +1 and the equation becomes U 2 DV 2 = 1, to which we aly a version of Proosition 5.1. Remark. When > 1 there may be more than one orbit of the unit grou {±ɛ n D } and one has to account for that. References [1] P. Erdös. Arithmetical roerties of olynomials. J. London Math. Soc. 28, (1953) [2] T. Estermann, Einige Sätze über quadratfreie Zahlen. Math. Ann. 105 (1931), [3] A. Granville, ABC allows us to count square-frees. Internat. Math. Res. Notices 1998, no. 19, [4] C. Hooley, On the ower free values of olynomials. Mathematika [5] C. Hooley, On the square-free values of cubic olynomials. Journal für die reine und angewandte Mathematik (Crelles Journal). (1968), 229, [6] T. Nagell, Zur Arithmetik der Polynome, Abhandl. Math. Sem. Hamburg 1 (1922), [7] G. Ricci, Ricerche aritmetiche sui olinomi. Rend. Circ. Mat. Palermo 57 (1933), [8] T. Reuss, Power-Free Values of Polynomials, Bull. London Math. Soc. (2015) doi: /blms/bdu116. arxiv: [math.nt]
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 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 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 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 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 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 informationarxiv: v1 [math.nt] 4 Nov 2015
Wall s Conjecture and the ABC Conjecture George Grell, Wayne Peng August 0, 018 arxiv:1511.0110v1 [math.nt] 4 Nov 015 Abstract We show that the abc conjecture of Masser-Oesterlé-Sziro for number fields
More informationThe inverse Goldbach problem
1 The inverse Goldbach roblem by Christian Elsholtz Submission Setember 7, 2000 (this version includes galley corrections). Aeared in Mathematika 2001. Abstract We imrove the uer and lower bounds of the
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 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 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 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 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 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 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 informationRINGS OF INTEGERS WITHOUT A POWER BASIS
RINGS OF INTEGERS WITHOUT A POWER BASIS KEITH CONRAD Let K be a number field, with degree n and ring of integers O K. When O K = Z[α] for some α O K, the set {1, α,..., α n 1 } is a Z-basis of O K. We
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 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 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 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 informationBy Evan Chen OTIS, Internal Use
Solutions Notes for DNY-NTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there
More informationPractice Final Solutions
Practice Final Solutions 1. 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 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 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 informationANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM
ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM JOHN BINDER Abstract. In this aer, we rove Dirichlet s theorem that, given any air h, k with h, k) =, there are infinitely many rime numbers congruent to
More informationMATH 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 informationBOUNDS FOR THE SIZE OF SETS WITH THE PROPERTY D(n) Andrej Dujella University of Zagreb, Croatia
GLASNIK MATMATIČKI Vol. 39(59(2004, 199 205 BOUNDS FOR TH SIZ OF STS WITH TH PROPRTY D(n Andrej Dujella University of Zagreb, Croatia Abstract. Let n be a nonzero integer and a 1 < a 2 < < a m ositive
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 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 informationI(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 informationOn the irreducibility of a polynomial associated with the Strong Factorial Conjecture
On the irreducibility of a olynomial associated with the Strong Factorial Conecture Michael Filaseta Mathematics Deartment University of South Carolina Columbia, SC 29208 USA E-mail: filaseta@math.sc.edu
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 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 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 informationAliquot sums of Fibonacci numbers
Aliquot sums of Fibonacci numbers Florian Luca Instituto de Matemáticas Universidad Nacional Autónoma de Méico C.P. 58089, Morelia, Michoacán, Méico fluca@matmor.unam.m Pantelimon Stănică Naval Postgraduate
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 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 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 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 informationCONGRUENCES 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 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 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 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 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 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 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 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 informationEötvös Loránd University Faculty of Informatics. Distribution of additive arithmetical functions
Eötvös Loránd University Faculty of Informatics Distribution of additive arithmetical functions Theses of Ph.D. Dissertation by László Germán Suervisor Prof. Dr. Imre Kátai member of the Hungarian Academy
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 informationOn the smallest point on a diagonal quartic threefold
On the smallest oint on a diagonal quartic threefold Andreas-Stehan Elsenhans and Jörg Jahnel Abstract For the family x = a y +a 2 z +a 3 v + w,,, > 0, of diagonal quartic threefolds, we study the behaviour
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 informationSome sophisticated congruences involving Fibonacci numbers
A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; July 20, 2011 and Shanghai Jiaotong University (Nov. 4, 2011 Some sohisticated congruences involving Fibonacci numbers Zhi-Wei
More information#A6 INTEGERS 15A (2015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I. Katalin Gyarmati 1.
#A6 INTEGERS 15A (015) ON REDUCIBLE AND PRIMITIVE SUBSETS OF F P, I Katalin Gyarmati 1 Deartment of Algebra and Number Theory, Eötvös Loránd University and MTA-ELTE Geometric and Algebraic Combinatorics
More informationUniversity of Bristol - Explore Bristol Research. Peer reviewed version. Link to published version (if available): 10.
Booker, A. R., & Pomerance, C. (07). Squarefree smooth numbers and Euclidean rime generators. Proceedings of the American Mathematical Society, 45(), 5035-504. htts://doi.org/0.090/roc/3576 Peer reviewed
More informationπ(x) π( x) = x<n x gcd(n,p)=1 The sum can be extended to all n x, except that now the number 1 is included in the sum, so π(x) π( x)+1 = n x
Math 05 notes, week 7 C. Pomerance Sieving An imortant tool in elementary/analytic number theory is sieving. Let s begin with something familiar: the sieve of Ertatosthenes. This is usually introduced
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 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 information(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 informationIntroductory Number Theory
Introductory Number Theory Lecture Notes Sudita Mallik May, 208 Contents Introduction. Notation and Terminology.............................2 Prime Numbers.................................. 2 2 Divisibility,
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 informationAdmissible primes and Euclidean quadratic fields
J. Ramanujan Math. Soc. 33, No.2 (2018) 135 147 Admissible primes Euclidean quadratic fields M. Ram Murty 1, Kotyada Srinivas 2 Muthukrishnan Subramani 3 1 Department of Mthematics Statistics, Jeffery
More informationLARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS
LARGE GAPS BETWEEN CONSECUTIVE PRIME NUMBERS CONTAINING SQUARE-FREE NUMBERS AND PERFECT POWERS OF PRIME NUMBERS HELMUT MAIER AND MICHAEL TH. RASSIAS Abstract. We rove a modification as well as an imrovement
More informationMATH 250: THE DISTRIBUTION OF PRIMES. ζ(s) = n s,
MATH 50: THE DISTRIBUTION OF PRIMES ROBERT J. LEMKE OLIVER For s R, define the function ζs) by. Euler s work on rimes ζs) = which converges if s > and diverges if s. In fact, though we will not exloit
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 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 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 informationNumber Theory. Lectured by V. Neale Michaelmas Term 2011
Number Theory Lectured by V Neale Michaelmas Term 0 NUMBER THEORY C 4 lectures, Michaelmas term Page Page 5 Page Page 5 Page 9 Page 3 Page 4 Page 50 Page 54 Review from Part IA Numbers and Sets: Euclid
More informationPartII 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 informationOn Character Sums of Binary Quadratic Forms 1 2. Mei-Chu Chang 3. Abstract. We establish character sum bounds of the form.
On Character Sums of Binary Quadratic Forms 2 Mei-Chu Chang 3 Abstract. We establish character sum bounds of the form χ(x 2 + ky 2 ) < τ H 2, a x a+h b y b+h where χ is a nontrivial character (mod ), 4
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 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 informationDistribution of Matrices with Restricted Entries over Finite Fields
Distribution of Matrices with Restricted Entries over Finite Fields Omran Ahmadi Deartment of Electrical and Comuter Engineering University of Toronto, Toronto, ON M5S 3G4, Canada oahmadid@comm.utoronto.ca
More informationYOUNESS LAMZOURI H 2. The purpose of this note is to improve the error term in this asymptotic formula. H 2 (log log H) 3 ζ(3) H2 + O
ON THE AVERAGE OF THE NUMBER OF IMAGINARY QUADRATIC FIELDS WITH A GIVEN CLASS NUMBER YOUNESS LAMZOURI Abstract Let Fh be the number of imaginary quadratic fields with class number h In this note we imrove
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 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 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 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 informationOn a special case of the Diophantine equation ax 2 + bx + c = dy n
Sciencia Acta Xaveriana Vol. 2 No. 1 An International Science Journal pp. 59 71 ISSN. 0976-1152 March 2011 On a special case of the Diophantine equation ax 2 + bx + c = dy n Lionel Bapoungué Université
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 informationThe Arm Prime Factors Decomposition
The Arm Prime Factors Decomosition Arm Boris Nima arm.boris@gmail.com Abstract We introduce the Arm rime factors decomosition which is the equivalent of the Taylor formula for decomosition of integers
More 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 informationChapter 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 informationarxiv: v4 [math.nt] 11 Oct 2017
POPULAR DIFFERENCES AND GENERALIZED SIDON SETS WENQIANG XU arxiv:1706.05969v4 [math.nt] 11 Oct 2017 Abstract. For a subset A [N], we define the reresentation function r A A(d := #{(a,a A A : d = a a }
More informationON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES
C O L L O Q U I U M M A T H E M A T I C U M VOL. * 0* NO. * ON THE DISTRIBUTION OF THE PARTIAL SUM OF EULER S TOTIENT FUNCTION IN RESIDUE CLASSES BY YOUNESS LAMZOURI, M. TIP PHAOVIBUL and ALEXANDRU ZAHARESCU
More informationMATH 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#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 informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China
Ramanuan J. 40(2016, no. 3, 511-533. CONGRUENCES INVOLVING g n (x n ( n 2 ( 2 0 x Zhi-Wei Sun Deartment of Mathematics, Naning University Naning 210093, Peole s Reublic of China zwsun@nu.edu.cn htt://math.nu.edu.cn/
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 informationarxiv: v1 [math.nt] 11 Jun 2016
ALMOST-PRIME POLYNOMIALS WITH PRIME ARGUMENTS P-H KAO arxiv:003505v [mathnt Jun 20 Abstract We imrove Irving s method of the double-sieve [8 by using the DHR sieve By extending the uer and lower bound
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 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 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.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 informationFrank Moore Algebra 901 Notes Professor: Tom Marley
Frank Moore Algebra 901 Notes Professor: Tom Marley Examle/Remark: Let f(x) K[x] be an irreducible olynomial. We know that f has multile roots (f, f ) = 1 f f, as f is irreducible f = 0. So, if Char K
More information192 VOLUME 55, NUMBER 5
ON THE -CLASS GROUP OF Q F WHERE F IS A PRIME FIBONACCI NUMBER MOHAMMED TAOUS Abstract Let F be a rime Fibonacci number where > Put k Q F and let k 1 be its Hilbert -class field Denote by k the Hilbert
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 informationElliptic Curves Spring 2015 Problem Set #1 Due: 02/13/2015
18.783 Ellitic Curves Sring 2015 Problem Set #1 Due: 02/13/2015 Descrition These roblems are related to the material covered in Lectures 1-2. Some of them require the use of Sage, and you will need to
More informationMultiplicative group law on the folium of Descartes
Multilicative grou law on the folium of Descartes Steluţa Pricoie and Constantin Udrişte Abstract. The folium of Descartes is still studied and understood today. Not only did it rovide for the roof of
More informationBEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO
BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what
More informationBRANDON HANSON, ROBERT C. VAUGHAN, AND RUIXIANG ZHANG
THE LEAST NUMBER WITH PRESCRIBED LEGENDRE SYMBOLS arxiv:1605.05584v2 [math.nt] 29 Oct 2016 BRANDON HANSON, ROBERT C. VAUGHAN, AND RUIXIANG ZHANG Abstract. In this article we estimate the number of integers
More information