Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt
|
|
- Jewel Perkins
- 5 years ago
- Views:
Transcription
1 Roma Tre April 8 0, 08 4th Mini Symposium of the Roman umber Theory Association (RTA) Representation of integers by cyclotomic binary forms Michel Waldschmidt Institut de Mathématiques de Jussieu Paris VI Abstract The homogeneous form n (X, Y ) of degree '(n) which is associated with the cyclotomic polynomial n(t) is dubbed a cyclotomic binary form A positive integer m is said to be representable by a cyclotomic binary form if there exist integers n, x, y with n 3 and max{ x, y } such that n(x, y) =m These definitions give rise to a number of questions that we plan to address update: 3/04/08 /49 /49 This is a joint work with Étienne Fouvry and Claude Levesque Cyclotomic polynomials Definition by induction : (t) =t, t n = Y d n d(t) For p prime, t p =(t )(t p + t p + + t + ) = (t) p (t), Étienne Fouvry Claude Levesque so p(t) =t p + t p + + t + Representation of integers by cyclotomic binary forms Acta Arithmetica, 0p Online First March 08 arxiv: [matht] For instance (t) =t+, 3(t) =t +t+, 5(t) =t 4 +t 3 +t +t+ 3/49 4/49
2 Cyclotomic polynomials Cyclotomic polynomials and roots of unity n(t) = tn Y d(t) d6=n d n For n, if is a primitive n th root of unity, n(t) = Y (t j ) gcd(j,n)= For instance 6(t) = The degree of function 4(t) = t4 t = t + = (t ), t 6 (t 3 )(t + ) = t3 + t + = t t + = 3 ( t) n(t) is '(n), where ' is the Euler totient For n, n(t) is the irreducible polynomial over Q of the primitive n th roots of unity, Let K be a field and let n be a positive integer Assume that K has characteristic either 0 or else a prime number p prime to n Then the polynomial n(t) is separable over K and its roots in K are exactly the primitive n th roots of unity which belong to K 5/49 6/49 Properties of For n n(t) we have n(t) =t '(n) n(/t) Let n = e 0 p e p er r where p,,p r are di erent odd primes, e 0 0, e i for i =,,r and r Denote by R the radical of n, namely ( p p r if e 0, R = p p r if e 0 = 0 Then, Let n = m with m odd n(t) = R (t n/r ) 3 Then n(t) = m ( t) n() For n, we have n() =e (n), where the von Mangoldt function is defined for n as ( log p if n = p r with p prime and r ; (n) = 0 otherwise In other terms we have ( p if n = p r with p prime and r ; n() = otherwise 7/49 8/49
3 n( ) For n 3, n( ) = ( if n is odd ; n/() if n is even Lower bound for n(t) For n 3, the polynomial n(t) has real coe cients and no real root, hence it takes only positive values (and its degree '(n) is even) For n 3 and t R, we have n(t) '(n) In other terms, for n 3, ( p if n = p r with p aprimeandr ; n( ) = otherwise Hence n( ) = when n is odd or when n = m where m has at least two distinct prime divisors Consequence : from n(t) =t '(n) n(/t) we deduce, for n 3 and t R, n(t) '(n) max{, t } '(n) 9/49 0 / 49 n(t) '(n) for n 3 and t R Proof Let n be a primitive n-th root of unity in C ; where n(t) = Q( n)/q(t n )= Y (t ( n )), runs over the embeddings Q( n )! C We have t ( n ) =m( ( n )) > 0, (i)=m( ( n )) = ( n ) ( n )= ( n n ) ow (i)=m( n )= n n Q( n ) is an algebraic integer : '(n) n(t) Q( n)/q((i)=m( n )) The cyclotomic binary forms For n, define n(x, Y )=Y '(n) n(x/y ) This is a binary form in Z[X, Y ] of degree '(n) Consequence of the lower bound for n(t) : for n 3 and (x, y) Z, Therefore, if n(x, y) '(n) max{ x, y } '(n) n(x, y) =m, then max{ x, y } apple m /'(n) If max{ x, y } 3, then n is bounded : '(n) apple log m log(3/) / 49 / 49
4 Generalization to CM fields (Győry, 977) Kálmán Győry, László Lovász Let K be a CM field of degree d over Q Let K be such that K = Q( ) ; let f be the irreducible polynomial of over Q and let F (X, Y )=Y d f(x/y ) the associated homogeneous binary form : f(t) =a 0 t d + a t d + + a d, F (X, Y )=a 0 X d + a X d Y + + a d Y d For (x, y) Z we have x d apple d a d d F (x, y) and y d apple d a d 0 F (x, y) K Győry L Lovász K Győry & L Lovász, Representation of integers by norm forms II, Publ Math Debrecen 7, 73 8, (970) K Győry, Représentation des nombres entiers par des formes binaires, Publ Math Debrecen 4, , (977) 3 / 49 4 / 49 Best possible for CM fields Let n 3, not of the form p a nor p a with p prime and a, so that n() = n ( ) = Then the binary form F n (X, Y )= n (X, Y X) has degree d = '(n) and a 0 = a d = Forx Z we have F n (x, x) = n (x, x) =x d Hence, for y = x, we have y d = d a d 0 F (x, y) Binary cyclotomic forms (EF CL MW 08) Let m be a positive integer and let n, x, y be rational integers satisfying n 3, max{ x, y } and n(x, y) = mthen max{ x, y } apple p m /'(n), hence '(n) apple log m 3 log 3 These estimates are optimal, since for `, 3(`, `) =3` If we assume '(n) >, namely '(n) '(n) apple 4 log log m 4, then 5 / 49 which is best possible since 5(, ) = 6 / 49
5 Lower bound for the cyclotomic polynomials The sequence (c n ) n 3 The upper bound max{ x, y } apple p 3 m /'(n) for n(x, y) =m is equivalent to the following result : For n 3 and t R, n(t) p! '(n) 3 Let n 3 Write c n = inf tr n (t) (n 3) n = e 0 p e p er r where p,,p r are odd primes with p < < p r, e 0 0, e i for i =,,r and r 0 (i) For r = 0, we have e 0 and c n = c e 0 = (ii) For r we have c n = c p p r p r 7 / 49 8 / 49 End of the proof of n(t) p! '(n) 3 The sequence (c n ) n 3 n(x, y) c n max{ x, y } '(n) Lemma For any odd squarefree integer n = p p r with p < p < < p r satisfying n and n 6= 5, we have '(n) > r+ log p p! '(n) 3 c n lim inf c n = 0 and lim sup c n = n! n! The sequence (c p ) p odd prime is decreasing from 3/4 to / For p and p primes, c p p p For any prime p, lim p! c p p = p 9 / 49 0 / 49
6 The sequence (a m ) m For each integer m, the set (n, x, y) Z n 3, max{ x, y }, n(x, y) =m is finite Let a m the number of its elements The sequence of integers m such that a m starts with the following values of a m m a m OEIS A994 umber of representations of integers by cyclotomic binary forms The sequence (a m ) m starts with 0, 0, 8, 6, 8, 0, 4, 4, 6, 8, 8,, 40, 0, 0, 40, 6, 4, 4, 8, 4, 0, 0, 0, 4, 8,, 4, 8, 0, 3, 8, 0, 8, 0, 6, 3, 0, 4, 8, 8, 0, 3, 0, 8, 0, 0,, 40,, 0, 3, 8, 0, 8, 0, 3, 8, 0, 0, 48, 0, 4, 40, 6, 0, 4, 8, 0, 0, 0, 4, 48, 8,, 4, / 49 / 49 OEIS A96095 OEIS A Integers represented by cyclotomic binary forms Integers not represented by cyclotomic binary forms a m 6= 0 for m = 3, 4, 5, 7, 8, 9, 0,,, 3, 6, 7, 8, 9, 0,, 5, 6, 7, 8, 9, 3, 3, 34, 36, 37, 39, 40, 4, 43, 45, 48, 49, 50, 5, 53, 55, 57, 58, 6, 63, 64, 65, 67, 68, 7, 73, 74, 75, 76, 79, 80, 8, 8, 84, 85, 89, 90, 9, 93, 97, 98, 00, 0, 03, 04, 06, 08, 09,,, 3, 6, 7,,, a m = 0 for m =,, 6, 4, 5,, 3, 4, 30, 33, 35, 38, 4, 44, 46, 47, 5, 54, 56, 59, 60, 6, 66, 69, 70, 7, 77, 78, 83, 86, 87, 88, 9, 94, 95, 96, 99, 0, 05, 07, 0, 4, 5, 8, 9, 0, 3, 6, 3, 3, 34, 35, 38, 40, 4, 4, 43, 50, 3 / 49 4 / 49
7 Integers represented by cyclotomic binary forms For, let A() be the number of m apple which are represented by cyclotomic binary forms : A() =#{m m apple, a m 6= 0} = The number of positive integers apple represented by 4 (namely the sums of two squares) is! 4 + O (log ) (log ) 3 We have A() = (log ) as! (log ) O (log ) 3! The number of positive integers apple represented by 3 (namely x + xy + y : Loeschian numbers) is! 3 + O (log ) (log ) 3 The number of positive integers apple represented by 4 and by 3 is! + O (log ) 3 4 (log ) / 49 6 / 49 The Landau Ramanujan constant OEIS A OEIS A Decimal expansion of Landau-Ramanujan constant 4 = Edmund Landau Srinivasa Ramanujan The number of positive integers apple which are sums of two squares is asymptotically 4 (log ) /, where 4 = Y p 3 mod 4 p Ph Flajolet and I Vardi, Zeta function expansions of some classical constants, Feb Xavier Gourdon and Pascal Sebah, Constants and records of computation David E G Hare, digits of the Landau-Ramanujan constant 7 / 49 8 / 49
8 The Landau Ramanujan constant References : B C Berndt, Ramanujan s notebook part IV, Springer-Verlag, 994 S R Finch, Mathematical Constants, Cambridge, 003, pp G H Hardy, Ramanujan, Twelve lectures on subjects suggested by his life and work, Chelsea, 940 Institute of Physics, Constants - Landau-Ramanujan Constant Simon Plou e, Landau Ramanujan constant Eric Weisstein s World of Mathematics, Ramanujan constant Sums of two squares If a and q are two integers, we denote by a,q any integer satisfying the condition An integer m p a,q =) p a mod q is of the form m = 4 (x, y) =x + y if and only if there exist integers a 0, 3,4 and,4 such that m = a 3,4,4 9 / / 49 Loeschian numbers : m = x + xy + y An integer m is of the form m = 3 (x, y) = 6 (x, y) =x + xy + y if and only if there exist integers b 0,,3 and,3 such that m = 3 b,3,3 The number of positive integers apple which are represented by the quadratic form X + XY + Y is asymptotically 3 (log ) / where 3 = 3 4 Y p mod 3 p OEIS A3049 OEIS A3049 Decimal expansion of an analog of the Landau-Ramanujan constant for Loeschian numbers 3 = 3 4 Y p mod 3 3 = p = = / 49 3 / 49
9 Zeta function expansions of some classical constants, Feb OEIS A30430 OEIS A30430 Decimal expansion of an analog of the Landau-Ramanujan constant for Loeschian numbers which are sums of two squares Philippe Flajolet Ilan Vardi 3 = = 3 4 p 5 (log(+ 3)) 4 4 (/4) Y p 5, 7, mod = Only digits after the decimal point are known p Bill Allombert 33 / / 49 Zeta function expansions of some classical constants, Feb Further developments Philippe Flajolet Bill Allombert Ilan Vardi = Prove similar estimates for the number of integers represented by other binary forms (done for quadratic forms) ; eg : prove similar estimates for the number of integers which are sums of two cubes, two biquadrates, Prove similar estimates for the number of integers which are represented by n for a given n Prove similar estimates for the number of integers which are represented by n for some n with '(n) d 35 / / 49
10 Stewart - Xiao Cam Stewart and Stanley Yao Xiao Let F be a binary form of degree d 3 with nonzero discriminant There exists a positive constant C F > 0 such that the number of integers of absolute value at most which are represented by F (X, Y ) is asymptotic to C F /d Cam Stewart Stanley Yao Xiao CL Stewart and S Yao Xiao, On the representation of integers by binary forms, arxiv: v (March 3, 08) 37 / / 49 K Mahler (933) Kurt Mahler Let F be a binary form of degree d 3 with nonzero discriminant Denote by A F the area (Lebesgue measure) of the domain {(x, y) R F (x, y) apple } For Z > 0 denote by F (Z) the number of (x, y) Z such that 0 < F (x, y) apple Z Then F (Z) =A F Z /d + O(Z /(d ) ) as Z! Kurt Mahler Über die mittlere Anzahl der Darstellungen grosser Zahlen durch binäre Formen, Acta Math 6 (933), / / 49
11 Higher degree The situation for positive definite forms of degree 3 is di erent for the following reason : If a positive integer m is represented by a positive definite quadratic form, it usually has many such representations ; while if a positive integer m is represented by a positive definite binary form of degree d 3, it usually has few such representations If F is a positive definite quadratic form, the number of (x, y) with F (x, y) apple is asymptotically a constant times, but the number of F (x, y) is much smaller If F is a positive definite binary form of degree d 3, the number of (x, y) with F (x, y) apple is asymptotically a constant times /d, the number of F (x, y) is also asymptotically a constant times /d Sums of k th powers If a positive integer m is a sum of two squares, there are many such representations Indeed, the number of (x, y) in Z Z with x + y apple is asymptotic to, while the number of values apple taken by the quadratic form 4 is asymptotic to 4 / p log where 4 is the Landau Ramanujan constant Hence 4 takes each of these values with a high multiplicity, on the average ( / ) p log On the opposite, it is extremely rare that a positive integer is a sum of two biquadrates in more than one way (not counting symmetries) 4 / 49 4 / = = Sums of k th powers Leonhard Euler The smallest integer represented by x 4 + y 4 in two essentially di erent ways was found by Euler, it is = One conjectures that given k 5, if an integer is of the form x k + y k, there is essentially a unique such representation But there is no value of k for which this has been proved [OEIS A684] umber of solutions to the equation x 4 + y 4 = n with x y > 0 An infinite family with one parameter is known for non trivial solutions to x 4 + x 4 = x x / / 49
12 Higher degree The situation for positive definite forms of degree di erent also for the following reason 3 is Quartan primes [OEIS A00645] Quartan primes: primes of the form x 4 + y 4, x > 0, y > 0 A necessary and su cient condition for a number m to be represented by one of the quadratic forms 3, 4, is given by acongruence By contrast, consider the quartic binary form 8(X, Y )=X 4 + Y 4 On the one hand, an integer represented by 8 is of the form,8 ( 3,8 5,8 7,8 ) 4 On the other hand, there are many integers of this form which are not represented by 8 The list of prime numbers represented by 8 start with, 7, 97, 57, 337, 64, 88, 97, 47, 657, 3697, 477, 47, 6577, 0657, 40, 4657, 4897, 5937, 656, 887, 3856, 3904, 4997, 547, 65537, 6567, 666, 66977, 8077, 83537, 83777, 8904, 0560, 07377, 967, It is not known whether this list is finite or not The largest known quartan prime is currently the largest known generalized Fermat prime: The digit ( ) / / 49 Primes of the form x k + y k Primes of the form X + Y 4 [OEIS A0033] primes of the form x + y [OEIS A00645] primes of the form x 4 + y 4, [OEIS A006686] primes of the form x 8 + y 8, [OEIS A0066] primes of the form x 6 + y 6, [OEIS A0067] primes of the form x 3 + y 3 John Friedlander Étienne Fouvry But it is known that there are infinitely many prime numbers of the form X + Y 4 Friedlander, J & Iwaniec, H The polynomial X + Y 4 captures its primes, Ann of Math () 48 (998), no 3, / / 49
Abstract. Michel Waldschmidt. Étienne Fouvry and. This is a joint work with Claude Levesque. November 6, On the Landau Ramanujan constant
November 27, 208 Department of Mathematics, Ramakrishna Mission Vivekananda University (RKMVU), Belur Math, Howrah, Kolkata (India). Abstract The Landau Ramanujan constant is defined as follows : for N!,
More informationRepresentation of integers by cyclotomic binary forms
ACTA ARITHMETICA Online First version Representation of integers by cyclotomic binary forms by Étienne Fouvry Orsay), Claude Levesque Québec) and Michel Waldschmidt Paris) Dedicated to Robert Tijdeman
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationPOLYNOMIAL SOLUTIONS OF PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS
J. London Math. Soc. 67 (2003) 16 28 C 2003 London Mathematical Society DOI: 10.1112/S002461070200371X POLYNOMIAL SOLUTIONS OF PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS J. MCLAUGHLIN
More informationAN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS
AN EASY GENERALIZATION OF EULER S THEOREM ON THE SERIES OF PRIME RECIPROCALS PAUL POLLACK Abstract It is well-known that Euclid s argument can be adapted to prove the infinitude of primes of the form 4k
More informationGAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT
Journal of Prime Research in Mathematics Vol. 8 202, 28-35 GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL
More information#A14 INTEGERS 18A (2018) COMPUTATIONAL REDISCOVERY OF RAMANUJAN S TAU NUMBERS
#A14 INTEGERS 18A (2018) COMPUTATIONAL REDISCOVERY OF RAMANUJAN S TAU NUMBERS Yuri Matiyasevich 1 St.Petersburg Department of Steklov Institute of Mathematics St.Petersburg, Russia https://logic.pdmi.ras.ru/
More informationON THE SEMIPRIMITIVITY OF CYCLIC CODES
ON THE SEMIPRIMITIVITY OF CYCLIC CODES YVES AUBRY AND PHILIPPE LANGEVIN Abstract. We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic
More informationIntroduction to Number Theory
INTRODUCTION Definition: Natural Numbers, Integers Natural numbers: N={0,1,, }. Integers: Z={0,±1,±, }. Definition: Divisor If a Z can be writeen as a=bc where b, c Z, then we say a is divisible by b or,
More informationof Classical Constants Philippe Flajolet and Ilan Vardi February 24, 1996 Many mathematical constants are expressed as slowly convergent sums
Zeta Function Expansions of Classical Constants Philippe Flajolet and Ilan Vardi February 24, 996 Many mathematical constants are expressed as slowly convergent sums of the form C = f( ) () n n2a for some
More informationPOLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS arxiv: v1 [math.nt] 27 Dec 2018
POLYNOMIAL SOLUTIONS TO PELL S EQUATION AND FUNDAMENTAL UNITS IN REAL QUADRATIC FIELDS arxiv:1812.10828v1 [math.nt] 27 Dec 2018 J. MC LAUGHLIN Abstract. Finding polynomial solutions to Pell s equation
More informationTHE LIND-LEHMER CONSTANT FOR 3-GROUPS. Stian Clem 1 Cornell University, Ithaca, New York
#A40 INTEGERS 18 2018) THE LIND-LEHMER CONSTANT FOR 3-GROUPS Stian Clem 1 Cornell University, Ithaca, New York sac369@cornell.edu Christopher Pinner Department of Mathematics, Kansas State University,
More informationRepresenting numbers as the sum of squares and powers in the ring Z n
Representing numbers as the sum of squares powers in the ring Z n Rob Burns arxiv:708.03930v2 [math.nt] 23 Sep 207 26th September 207 Abstract We examine the representation of numbers as the sum of two
More informationarxiv: v1 [math.nt] 3 Jun 2016
Absolute real root separation arxiv:1606.01131v1 [math.nt] 3 Jun 2016 Yann Bugeaud, Andrej Dujella, Tomislav Pejković, and Bruno Salvy Abstract While the separation(the minimal nonzero distance) between
More informationSection X.55. Cyclotomic Extensions
X.55 Cyclotomic Extensions 1 Section X.55. Cyclotomic Extensions Note. In this section we return to a consideration of roots of unity and consider again the cyclic group of roots of unity as encountered
More informationP -adic root separation for quadratic and cubic polynomials
P -adic root separation for quadratic and cubic polynomials Tomislav Pejković Abstract We study p-adic root separation for quadratic and cubic polynomials with integer coefficients. The quadratic and reducible
More informationTHE HEIGHT OF ALGEBRAIC UNITS IN LOCAL FIELDS*
THE HEIGHT OF ALGEBRAIC UNITS IN LOCAL FIELDS* CLAYTON PETSCHE Abstract. Given a number field k and a non-archimedean place v of k, we give a quantitative lower bound on the height of non-torsion algebraic
More informationCONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES. Reinier Bröker
CONSTRUCTING SUPERSINGULAR ELLIPTIC CURVES Reinier Bröker Abstract. We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over F q with trace
More informationIdentities Inspired by the Ramanujan Notebooks Second Series
Identities Inspired by the Ramanujan Notebooks Second Series by Simon Plouffe First draft August 2006 Revised March 4, 20 Abstract A series of formula is presented that are all inspired by the Ramanujan
More informationarxiv:math/ v1 [math.nt] 9 Aug 2004
arxiv:math/0408107v1 [math.nt] 9 Aug 2004 ELEMENTARY RESULTS ON THE BINARY QUADRATIC FORM a 2 + ab + b 2 UMESH P. NAIR Abstract. This paper examines with elementary proofs some interesting properties of
More informationOn the power-free parts of consecutive integers
ACTA ARITHMETICA XC4 (1999) On the power-free parts of consecutive integers by B M M de Weger (Krimpen aan den IJssel) and C E van de Woestijne (Leiden) 1 Introduction and main results Considering the
More informationGalois theory (Part II)( ) Example Sheet 1
Galois theory (Part II)(2015 2016) Example Sheet 1 c.birkar@dpmms.cam.ac.uk (1) Find the minimal polynomial of 2 + 3 over Q. (2) Let K L be a finite field extension such that [L : K] is prime. Show that
More informationAlmost fifth powers in arithmetic progression
Almost fifth powers in arithmetic progression L. Hajdu and T. Kovács University of Debrecen, Institute of Mathematics and the Number Theory Research Group of the Hungarian Academy of Sciences Debrecen,
More informationDivisibility of class numbers of imaginary quadratic fields whose discriminant has only two prime factors
Divisibility of class numbers of imaginary quadratic fields whose discriminant has only two prime factors by Dongho Byeon and Shinae Lee Abstract. Let g and n 1 be integers. In this paper, we shall show
More informationON POWER VALUES OF POLYNOMIALS. A. Bérczes, B. Brindza and L. Hajdu
ON POWER VALUES OF POLYNOMIALS ON POWER VALUES OF POLYNOMIALS A. Bérczes, B. Brindza and L. Hajdu Abstract. In this paper we give a new, generalized version of a result of Brindza, Evertse and Győry, concerning
More informationDIOPHANTINE PROBLEMS, POLYNOMIAL PROBLEMS, & PRIME PROBLEMS. positive ) integer Q how close are you guaranteed to get to the circle with rationals
DIOPHANTINE PROBLEMS, POLYNOMIAL PROBLEMS, & PRIME PROBLEMS CHRIS PINNER. Diophantine Problems. Given an arbitrary circle in R 2 and( positive ) integer Q how close are you guaranteed to get to the circle
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
More informationERIC LARSON AND LARRY ROLEN
PROGRESS TOWARDS COUNTING D 5 QUINTIC FIELDS ERIC LARSON AND LARRY ROLEN Abstract. Let N5, D 5, X) be the number of quintic number fields whose Galois closure has Galois group D 5 and whose discriminant
More informationConstructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography Naomi Benger and Michael Scott, 1 School of Computing, Dublin City University, Ireland nbenger@computing.dcu.ie
More informationContent. CIMPA-ICTP Research School, Nesin Mathematics Village The Riemann zeta function Michel Waldschmidt
Artin L functions, Artin primitive roots Conjecture and applications CIMPA-ICTP Research School, Nesin Mathematics Village 7 http://www.rnta.eu/nesin7/material.html The Riemann zeta function Michel Waldschmidt
More informationOn integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1
ACTA ARITHMETICA LXXXII.1 (1997) On integer solutions to x 2 dy 2 = 1, z 2 2dy 2 = 1 by P. G. Walsh (Ottawa, Ont.) 1. Introduction. Let d denote a positive integer. In [7] Ono proves that if the number
More informationOn the representation of primes by polynomials (a survey of some recent results)
On the representation of primes by polynomials (a survey of some recent results) B.Z. Moroz 0. This survey article has appeared in: Proceedings of the Mathematical Institute of the Belarussian Academy
More informationQuasi-reducible Polynomials
Quasi-reducible Polynomials Jacques Willekens 06-Dec-2008 Abstract In this article, we investigate polynomials that are irreducible over Q, but are reducible modulo any prime number. 1 Introduction Let
More informationON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS. Yann Bugeaud Université de Strasbourg, France
GLASNIK MATEMATIČKI Vol. 44(64)(2009), 323 331 ON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS Yann Bugeaud Université de Strasbourg, France Abstract. Let n be a positive integer. Let ξ
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationarxiv: v5 [math.nt] 23 May 2017
TWO ANALOGS OF THUE-MORSE SEQUENCE arxiv:1603.04434v5 [math.nt] 23 May 2017 VLADIMIR SHEVELEV Abstract. We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse
More informationAlgebraic Number Theory and Representation Theory
Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationSEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS
SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS STEVEN H. WEINTRAUB ABSTRACT. We present a number of classical proofs of the irreducibility of the n-th cyclotomic polynomial Φ n (x).
More informationTHERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11
THERE ARE NO ELLIPTIC CURVES DEFINED OVER Q WITH POINTS OF ORDER 11 ALLAN LACY 1. Introduction If E is an elliptic curve over Q, the set of rational points E(Q), form a group of finite type (Mordell-Weil
More informationThree cubes in arithmetic progression over quadratic fields
Arch. Math. 95 (2010), 233 241 c 2010 Springer Basel AG 0003-889X/10/030233-9 published online August 31, 2010 DOI 10.1007/s00013-010-0166-5 Archiv der Mathematik Three cubes in arithmetic progression
More informationGauss and Riemann versus elementary mathematics
777-855 826-866 Gauss and Riemann versus elementary mathematics Problem at the 987 International Mathematical Olympiad: Given that the polynomial [ ] f (x) = x 2 + x + p yields primes for x =,, 2,...,
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS
ARITHMETIC PROGRESSIONS OF SQUARES, CUBES AND n-th POWERS L. HAJDU 1, SZ. TENGELY 2 Abstract. In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp
More informationOn intervals containing full sets of conjugates of algebraic integers
ACTA ARITHMETICA XCI4 (1999) On intervals containing full sets of conjugates of algebraic integers by Artūras Dubickas (Vilnius) 1 Introduction Let α be an algebraic number with a(x α 1 ) (x α d ) as its
More informationFlat primes and thin primes
Flat primes and thin primes Kevin A. Broughan and Zhou Qizhi University of Waikato, Hamilton, New Zealand Version: 0th October 2008 E-mail: kab@waikato.ac.nz, qz49@waikato.ac.nz Flat primes and thin primes
More informationA Natural Extension of the Pythagorean Equation to Higher Dimensions
A Natural Extension of the Pythagorean Equation to Higher Dimensions Marc Chamberland Department of Mathematics and Statistics Grinnell College Grinnell, Iowa 50112 August 25, 2008 Abstract. The Pythagorean
More informationON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS
Fizikos ir matematikos fakulteto Seminaro darbai, Šiaulių universitetas, 8, 2005, 5 13 ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS Boris ADAMCZEWSKI 1, Yann BUGEAUD 2 1 CNRS, Institut Camille Jordan,
More informationarxiv: v1 [math.gm] 31 Dec 2015
On the Solution of Gauss Circle Problem Conjecture Revised arxiv:60.0890v [math.gm] 3 Dec 05 Nikolaos D. Bagis Aristotle University of Thessaloniki Thessaloniki, Greece email: nikosbagis@hotmail.gr Abstract
More informationTwo Diophantine Approaches to the Irreducibility of Certain Trinomials
Two Diophantine Approaches to the Irreducibility of Certain Trinomials M. Filaseta 1, F. Luca 2, P. Stănică 3, R.G. Underwood 3 1 Department of Mathematics, University of South Carolina Columbia, SC 29208;
More informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
More informationThis theorem allows us to describe all integer solutions as follows:
On the Diophantine equation a 3 + b 3 + c 3 + d 3 = 0 by RACHEL GAR-EL and LEONID VASERSTEIN (University Park, PA) Introduction. The equation a 3 + b 3 + c 3 + d 3 = 0 (1) has been studied by many mathematicians
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationUNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY
UNDERSTANDING RULER AND COMPASS CONSTRUCTIONS WITH FIELD THEORY ISAAC M. DAVIS Abstract. By associating a subfield of R to a set of points P 0 R 2, geometric properties of ruler and compass constructions
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationOn additive decompositions of the set of primitive roots modulo p
On additive decompositions of the set of primitive roots modulo p Cécile Dartyge, András Sárközy To cite this version: Cécile Dartyge, András Sárközy. On additive decompositions of the set of primitive
More informationZsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1
Zsigmondy s Theorem Lola Thompson Dartmouth College August 11, 2009 Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, 2009 1 / 1 Introduction Definition o(a modp) := the multiplicative order
More informationExtend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1
Extend Fermats Small Theorem to r p 1 mod p 3 for divisors r of p ± 1 Nico F. Benschop AmSpade Research, The Netherlands Abstract By (p ± 1) p p 2 ± 1 mod p 3 and by the lattice structure of Z(.) mod q
More informationSums and products. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA
Sums and products Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA International Number Theory Conference in Memory of Alf van der Poorten, AM 12 16 March, 2012 CARMA, the University of Newcastle
More informationA Generalization of Wilson s Theorem
A Generalization of Wilson s Theorem R. Andrew Ohana June 3, 2009 Contents 1 Introduction 2 2 Background Algebra 2 2.1 Groups................................. 2 2.2 Rings.................................
More informationProjects on elliptic curves and modular forms
Projects on elliptic curves and modular forms Math 480, Spring 2010 In the following are 11 projects for this course. Some of the projects are rather ambitious and may very well be the topic of a master
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationDecomposing Bent Functions
2004 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO. 8, AUGUST 2003 Decomposing Bent Functions Anne Canteaut and Pascale Charpin Abstract In a recent paper [1], it is shown that the restrictions
More information1, for s = σ + it where σ, t R and σ > 1
DIRICHLET L-FUNCTIONS AND DEDEKIND ζ-functions FRIMPONG A. BAIDOO Abstract. We begin by introducing Dirichlet L-functions which we use to prove Dirichlet s theorem on arithmetic progressions. From there,
More informationAutomatic Sequences and Transcendence of Real Numbers
Automatic Sequences and Transcendence of Real Numbers Wu Guohua School of Physical and Mathematical Sciences Nanyang Technological University Sendai Logic School, Tohoku University 28 Jan, 2016 Numbers
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationE.J. Barbeau. Polynomials. With 36 Illustrations. Springer
E.J. Barbeau Polynomials With 36 Illustrations Springer Contents Preface Acknowledgment of Problem Sources vii xiii 1 Fundamentals 1 /l.l The Anatomy of a Polynomial of a Single Variable 1 1.1.5 Multiplication
More informationParametrized Thue Equations A Survey
Parametrized Thue Equations A Survey Clemens Heuberger Institut fr Mathematik B Technische Universitt Graz 8010 Graz Austria clemens.heuberger@tugraz.at January 29, 2005 Abstract We consider families of
More informationExplicit Methods in Algebraic Number Theory
Explicit Methods in Algebraic Number Theory Amalia Pizarro Madariaga Instituto de Matemáticas Universidad de Valparaíso, Chile amaliapizarro@uvcl 1 Lecture 1 11 Number fields and ring of integers Algebraic
More informationIRREDUCIBILITY TESTS IN F p [T ]
IRREDUCIBILITY TESTS IN F p [T ] KEITH CONRAD 1. Introduction Let F p = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(t ) F p [T ] is irreducible that are
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
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 informationRATIONAL POINTS ON SOME FERMAT CURVES AND SURFACES OVER FINITE FIELDS
RATIONAL POINTS ON SOME FERMAT CURVES AND SURFACES OVER FINITE FIELDS JOSÉ FELIPE VOLOCH AND MICHAEL E. ZIEVE Abstract. We give an explicit description of the F q i-rational points on the Fermat curve
More informationAndrzej Schinzel 80: an outstanding scientific career
1 / 18 Andrzej Schinzel 80: an outstanding scientific career Kálmán Győry Short biography 2 / 18 Professor Andrzej Schinzel world-famous number theorist, old friend of Hungarian mathematicians. Born on
More informationTest 2. Monday, November 12, 2018
Test 2 Monday, November 12, 2018 Instructions. The only aids allowed are a hand-held calculator and one cheat sheet, i.e. an 8.5 11 sheet with information written on one side in your own handwriting. No
More informationarxiv: v1 [math.nt] 22 Jan 2019
Factors of some truncated basic hypergeometric series Victor J W Guo School of Mathematical Sciences, Huaiyin Normal University, Huai an 223300, Jiangsu People s Republic of China jwguo@hytceducn arxiv:190107908v1
More informationRANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY
RANK AND PERIOD OF PRIMES IN THE FIBONACCI SEQUENCE. A TRICHOTOMY Christian Ballot Université de Caen, Caen 14032, France e-mail: ballot@math.unicaen.edu Michele Elia Politecnico di Torino, Torino 10129,
More informationSOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM
Acta Arith. 183(018), no. 4, 339 36. SOME VARIANTS OF LAGRANGE S FOUR SQUARES THEOREM YU-CHEN SUN AND ZHI-WEI SUN Abstract. Lagrange s four squares theorem is a classical theorem in number theory. Recently,
More informationP -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS. Tomislav Pejković
RAD HAZU. MATEMATIČKE ZNANOSTI Vol. 20 = 528 2016): 9-18 P -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS Tomislav Pejković Abstract. We study p-adic root separation for quadratic and cubic
More informationOn the prime divisors of elements of a D( 1) quadruple
arxiv:1309.4347v1 [math.nt] 17 Sep 2013 On the prime divisors of elements of a D( 1) quadruple Anitha Srinivasan Abstract In [4] it was shown that if {1,b,c,d} is a D( 1) quadruple with b < c < d and b
More informationThe Diophantine equation x(x + 1) (x + (m 1)) + r = y n
The Diophantine equation xx + 1) x + m 1)) + r = y n Yu.F. Bilu & M. Kulkarni Talence) and B. Sury Bangalore) 1 Introduction Erdős and Selfridge [7] proved that a product of consecutive integers can never
More informationA PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS (A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES)
A PROBLEM ON THE CONJECTURE CONCERNING THE DISTRIBUTION OF GENERALIZED FERMAT PRIME NUMBERS A NEW METHOD FOR THE SEARCH FOR LARGE PRIMES) YVES GALLOT Abstract Is it possible to improve the convergence
More informationOn the counting function of sets with even partition functions by
Author manuscript, published in "Publ. Math. Debrecen 79, 3-4 2011) 687-697" DOI : 10.5486/PMD.2011.5106 On the counting function of sets with even partition functions by F. Ben Saïd Université de Monastir
More informationCongruences among generalized Bernoulli numbers
ACTA ARITHMETICA LXXI.3 (1995) Congruences among generalized Bernoulli numbers by Janusz Szmidt (Warszawa), Jerzy Urbanowicz (Warszawa) and Don Zagier (Bonn) For a Dirichlet character χ modulo M, the generalized
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationPERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A42 PERIODICITY OF SOME RECURRENCE SEQUENCES MODULO M Artūras Dubickas Department of Mathematics and Informatics, Vilnius University,
More informationNON-NEGATIVE INTEGER LINEAR CONGRUENCES. 1. Introduction We consider the problem of finding all non-negative integer solutions to a linear congruence
NON-NEGATIVE INTEGER LINEAR CONGRUENCES JOHN C. HARRIS AND DAVID L. WEHLAU arxiv:math/0409489v1 [math.nt] 24 Sep 2004 Abstract. We consider the problem of describing all non-negative integer solutions
More informationOn the divisibility of the discriminant of an integer polynomial by prime powers.
On the divisibility of the discriminant of an integer polynomial by prime powers. October 14, 2008 V. Bernik Institute of Mathematics, Surganova str. 11, 220072, Minsk, Belarus (e-mail: bernik@im.bas-net.by)
More informationLISTA 1 LUCRARI STIINTIFICE
LISTA 1 LUCRARI STIINTIFICE 1. Eine Eigenschaft der Funktionen uber die Verteilung der Primzahlen. Bull.Math.Soc. Sci.Math.Romania Ser.23(71),No.2(1979),189-194 Zbl.Math. 414.10045 2. Uber einige arithmetische
More informationLINEAR FORMS IN LOGARITHMS
LINEAR FORMS IN LOGARITHMS JAN-HENDRIK EVERTSE April 2011 Literature: T.N. Shorey, R. Tijdeman, Exponential Diophantine equations, Cambridge University Press, 1986; reprinted 2008. 1. Linear forms in logarithms
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationModern Algebra Lecture Notes: Rings and fields set 6, revision 2
Modern Algebra Lecture Notes: Rings and fields set 6, revision 2 Kevin Broughan University of Waikato, Hamilton, New Zealand May 20, 2010 Solving quadratic equations: traditional The procedure Work in
More informationA family of quartic Thue inequalities
A family of quartic Thue inequalities Andrej Dujella and Borka Jadrijević Abstract In this paper we prove that the only primitive solutions of the Thue inequality x 4 4cx 3 y + (6c + 2)x 2 y 2 + 4cxy 3
More informationContinuing the pre/review of the simple (!?) case...
Continuing the pre/review of the simple (!?) case... Garrett 09-16-011 1 So far, we have sketched the connection between prime numbers, and zeros of the zeta function, given by Riemann s formula p m
More informationMATH 4400 SOLUTIONS TO SOME EXERCISES. 1. Chapter 1
MATH 4400 SOLUTIONS TO SOME EXERCISES 1.1.3. If a b and b c show that a c. 1. Chapter 1 Solution: a b means that b = na and b c that c = mb. Substituting b = na gives c = (mn)a, that is, a c. 1.2.1. Find
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationDIGITAL EXPANSION OF EXPONENTIAL SEQUENCES
DIGITAL EXPASIO OF EXPOETIAL SEQUECES MICHAEL FUCHS Abstract. We consider the q-ary digital expansion of the first terms of an exponential sequence a n. Using a result due to Kiss und Tichy [8], we prove
More informationZhi-Wei Sun Department of Mathematics, Nanjing University Nanjing , People s Republic of China
J. Number Theory 16(016), 190 11. A RESULT SIMILAR TO LAGRANGE S THEOREM Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 10093, People s Republic of China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationOn the Representations of xy + yz + zx
On the Representations of xy + yz + zx Jonathan Borwein and Kwok-Kwong Stephen Choi March 13, 2012 1 Introduction Recently, Crandall in [3] used Andrews identity for the cube of the Jacobian theta function
More information