GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT

Size: px
Start display at page:

Download "GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT"

Transcription

1 Journal of Prime Research in Mathematics Vol , GAPS IN BINARY EXPANSIONS OF SOME ARITHMETIC FUNCTIONS, AND THE IRRATIONALITY OF THE EULER CONSTANT JORGE JIMÉNEZ URROZ, FLORIAN LUCA 2, MICHEL WALDSCHMIDT 3 Abstract. We show that if F n = 2 2n + is the nth Fermat number, then the binary digit sum of πf n tends to infinity with n, where πx is the counting function of the primes p x. We also show that if F n is not prime, then the binary expansion of φf n starts with a long string of s, where φ is the Euler function. We also consider the binary expansion of the counting function of irreducible monic polynomials of degree a given power of 2 over the field F 2. Finally, we relate the problem of the irrationality of Euler constant with the binary expansion of the sum of the divisor function. Key words : Binary expansions, Prime Number Theorem, Rational approximations to log 2, Fermat numbers, Euler constant, Irreducible polynomials over a finite field. AMS SUBJECT : A63, D75, N05.. Fermat numbers.. The prime counting function. Let F n = 2 2n + be the nth Fermat number. In 650, Fermat conjectured that all the numbers F n are prime. However, to date it is known that F n is prime for n {0,, 2, 3, 4} and for no other n in the set {5, 6,..., 32}. It is believed that F n is composite for all n 5. For more information on Fermat numbers, see [3]. Departamento de Matemática Aplicada IV, Universidad Politecnica de Catalunya, Barcelona, 08034, España. jjimenez@ma4.upc.edu 2 Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México. fluca@matmor.unam.mx 3 Université Pierre et Marie Curie Paris 6, Institut de Mathématiques de Jussieu, 4 Place Jussieu, Paris, Cedex 05, France. miw@math.jussieu.fr. 28

2 Gaps in binary expansions of arithmetic functions 29 For a positive real number x we put πx = #{p x} for the counting function of the primes p x. Consider the sequence P n = πf n for all n 0. Observe that F n is prime if and only if πf n > πf n. Here, we look at the binary expansion of P n. In particular, we prove that P n cannot have few bits in its binary expansion. To quantify our result, let s 2 P n be the binary sum of digits of P n. Theorem. There exists a constant c 0 such that the inequality s 2 P n > log n 2 log 2 c 0 holds for all n 0. Before proving the theorem we need a preliminary lemma. Let log 2 = a k + 2 log 2 = b k + where A = {a k } k 0 is the sequence 0, 2, 3, 4, 8,... giving the position of the kth bit in the binary expansion of log 2, and B = {b k } k 0 is the sequence, 5, 6, 7, 9,... giving the position of the kth zero coefficient in the binary expansion of 2 log 2. These sequences are disjoint and their union is the sequence of nonnegative integers. Lemma 2. There exist k 0 such that for any k k 0 we have a k+ < 4a k and b k+ < 4b k. Proof. By definition log 2 = k 2 a i + M, i=0 where M < 2 ak++. We use the fact see below that there exists a constant K such that log 2 p q > q K holds for all positive rational numbers p/q. We take q = 2 a k and p = k i=0 2a k a i, to get 2 a k+ = 2 m > log 2 p q > 2 Ka, k m a k+ so a k+ < Ka k + forall k 0. It is known that we can take K = 3.58 for k sufficiently large, say k k 0 see [4]; see also [8] for the fact that we can take K = 3.9 for k k 0. The result

3 30 Jorge Jiménez Urroz, Florian Luca, Michel Waldschmidt for a k now follows trivially. The exact same reasoning, substituting /log 2 by 2 /log 2 everywhere, gives the result for b k. Corollary 3. For each integer n let κ 0 := κ 0 n be the largest positive integer k such that b k < n 3 and κ := κ n be the largest positive integer k such that a k < b κ0. Then the inequalities b κ0 n 3/4 and a κ n 3/6 hold for all sufficiently large n. Proof. We have and a κ < b κ0 < n 3 b κ0 + < 4b κ0 b κ0 < a κ + < 4a κ. We now start the proof of theorem.. Proof. Assume now that n 4. By Theorem in [7], we have x + < πx < x + 3 forall x log x 2 log x log x 2 log x Since F n F 4 > 59, we may apply inequality 2 with x = F n. Since both functions x x/ log x and x x/log x 2 are increasing for x > e 2, and F n > 2 2n > e 2 for n 4, we have that πf n 22n n log n+ log 2 where we used the fact that /2 < log 2 <. Further, F n 3 πf n + log F n 2 log F n < 22n n 3 + log 2 2 n+ log 2 Hence, < 22n n log 2 < 22n n log 2 < 2 2n n > 2 2n n log n+, + 2 n n 2 n 2 log n 3 2 2n +n P n = 2 2n n log 2 + θ n, where θ n 2 n+, 2 n n

4 Gaps in binary expansions of arithmetic functions 3 Thus, the binary digits of P n are the same as the binary digits of the number log 2 + θ n and, in fact, the first binary digits of P n are exactly the a k for all k κ since a κ < b κ0 and, hence, θ n does not induce a carry over a κ. Applying Lemma 2, iteratively, we get that a k 4 k k 0 a k0 for all k k 0. Hence, s 2 P n > by Corollary 3. j κ,a j A = κ log a κ /a k0 log 4 + k 0 > log n log 4 c 0,.2. The Euler function. Let φn be the Euler function of n. If F n is prime, then φf n = 2 2n. We show that if F n is not prime, then the binary expansion of φf n starts with a long string of s. More precisely, we have the following result. Theorem 4. If F n is not prime, then the binary expansion of φf n starts with a string of s of length at least n log n/ log 2. We need the following well known lemma see Proposition 3.2 and Theorem 6. in [3]. Lemma 5. Any two Fermat numbers are coprime. Further, for n 2, each prime factor of F n is congruent to modulo 2 n+2. Proof. Let n 0 and let p be a prime factor of F n. Since 2 2n is congruent to modulo p, the order of the class of 2 in the multiplicative group Z/pZ is 2 n+. This shows that two Fermat numbers have no common prime divisor. Assume now n 2. Then p is congruent to modulo 8, hence 2 is a square modulo p. Let a satisfy a 2 2 mod p. Then the order of the class of a in the multiplicative group Z/pZ is 2 n+2 and therefore 2 n+2 divides p. Proof of Theorem 4. Assume that F n is not prime. Then n 5. Write F n = k pα i i, where p < < p k are distinct primes and α,..., α k are positive integer exponents. Using Lemma 5, we can write p i = 2 n+2 m i + for each i =,..., k. Further, no m i is a power of 2, for otherwise p i itself would be a Fermat prime, which is false because any two Fermat numbers are coprime by Lemma 5. Let P be the set of primes p mod 2 n+2 which are not Fermat primes and for any positive real number x let Px = P [, x]. Then p i P2 2n. Thus, k p i 2n+2 3 p 22n p P p = #Pt t t=22 n 2 2 n + t=2 n n+2 3 #Pt t 2 dt,

5 32 Jorge Jiménez Urroz, Florian Luca, Michel Waldschmidt where the above equality follows from the Abel summation formula. In order to estimate the first term and the integral, we use the fact that #Pt πt,, 2 n+2 2t φ2 n+2 logt/2 n+2 forall t 2 n+2 3, where πt; a, b is the number of primes p t in the arithmetic progression a mod b. The right most inequality is due to Montgomery and Vaughan [5]. Thus, k #P22n + p i 2 2n 2 2 n 2 n n log2 2n n n < 2 n + 2 n 2 2 n n 2 3 #Pt t 2 dt 2 2 n du u log u n n 2 2 n+2 3 dt t logt/2 n+2 u := t/2 n+2 = log log u + u=22 2n 2 n < u=3 2 n + log2n n 2 log 2 2 n < n 2 n. Using the inequality k k x i < valid for all k and x,..., x k 0, with x i = /p i for i =,..., k, we get φf n k k = pi < < n F n p i 2 n, therefore x i φf n > F n n 2 n > 2 2n n 2 n, which together with the fact that φf n < F n = 2 2n since F n is composite implies the desired conclusion. 2. Digits of the number of irreducible polynomials of a given degree over a finite field Let F q be a finite field with q elements. For any positive integer m, denote by N q m the number of monic irreducible polynomials over F q of degree m. Then see for instance 4.3 of [] for each m, we have q m = dn q d and N q m = µdq m/d. m d m d m

6 Gaps in binary expansions of arithmetic functions 33 The two formulae are equivalent by Möbius inversion formula. From the first one, given the fact that all the elements in the sum are positive, we deduce N q m < qm for m 2. m A consequence of the second one is q m mn q m = µdq d/m q m/2 + d m,d<m d m/3 q d < 2q m/2 for m 2. Hence, we have q m m 2qm/2 m < N qm < qm m For q = 2 and m = 2 n we deduce that the number P n := N 2 2 n satisfies 2 2n n 2 2n n+ < P n < 2 2n n. It follows that the binary expansion of P n starts with a number of s at least 2 n. 3. Irrationality of the Euler constant Let T k = n 2 k τn with τn = d n and let T k = v k i=0 a i2 i be its binary expansion. If we have a l+i = 0, for any 0 i L, we say that T k has a gap of length at least L starting at l. We introduce the following condition depending on a parameter κ > 0 and involving Euler s constant γ. Assumption A κ : There exists a positive constant B 0 with the following property. For any b 0, b, b 2 Z 3 with b 0, we have with b 0 + b log 2 + b 2 γ B κ B = max{b 0, b 0, b, b 2 }. From Dirichlet s box principle see [9], it follows that if condition A κ is satisfied, then κ 2. According to, condition A κ is satisfied with κ = 3 if Euler s constant γ is rational. It is likely that it is also satisfied if γ is irrational, but this is an open problem. A folklore conjecture is that, log 2 and γ are linearly independent over Q. If this is true, then A κ can be seen as a measure of linear independence of these three numbers. It is known see [9] that for almost all tuples x,..., x m in R m in the sense of Lebesgue s measure, the following measure of linear independence holds: For any κ > m, there exists a positive constant B 0 such that, for any b 0, b,..., b m Z m+ \ {0}, we have b 0 + b x + + b m x m B κ

7 34 Jorge Jiménez Urroz, Florian Luca, Michel Waldschmidt with B = max{b 0, b 0, b,..., b m }. It is also expected that most constants from analysis, like log 2 and γ, behave, from the above point of view, as almost all numbers. Hence, one should expect condition A κ to be satisfied for any κ > 2. Theorem 6. Assume κ is a positive number such that the condition A κ is satisfied. Then, for any sufficiently large k, any l and L satisfying 2 + κ log k log 2 k l L, T k does not have a gap of length at least L starting at l. Proof. Assume k is large enough, in particular k > B 0. It is well known see, for instance, Theorem 320 in [2], that τn = x log x + 2γ x + Ex, n x where Ex < c x for some positive constant c. For x = 2 k, we get T k = 2 k k log k 2γ + E2 k. 3 Suppose now that T k has a gap of length at least L starting at l. Then the binary expansion of T k is T k = v k i=l+l a i2 i + l i=0 a i2 i, and, by 3, we get 2 k k log k+ γ b < 2 l + E2 k, with b = 2 k + v k i=l+l a i2 i. Now, since l + L k and 2 k b, we can first divide by 2 k, and then apply Assumption A κ with b 0 = 2 k b, b = k, b 2 = 2 to obtain k κ k log 2 + 2γ + b 0 < 2 l k + 2 k/ Observe that in this case, in Assumption A κ we have B k since for k sufficiently large we have b 2 k + T k < k2 k. We just have to observe that the inequality 2 k/2+2 < k κ /2 holds for all sufficiently large k, to conclude that the last inequality 4 is impossible for any l in the range k l κlog k/ log 2. As a corollary of Theorem 6 and inequality, we give a criterion for the irrationality of the Euler s constant. Corollary 7. Assume that for infinitely many positive integers k, there exist l and L satisfying log k k l L log 2

8 Gaps in binary expansions of arithmetic functions 35 and such that T k has a gap of length at least L starting at l. Then Euler s constant γ is irrational. 4. Further comments There are other similar games we can play in order to say something about the binary expansion of the average of other arithmetic functions evaluated in powers of 2 or in Fermat numbers, once the average value of such a function involves a constant for which we have a grasp on its irrationality measure. For example, using the fact see for instance [2] 8.4, Th. 330 that Ax = φn = 2ζ2 x2 + Ox log x n x together with the fact that the approximation exponent of ζ2 = π 2 /6 is smaller than 5.5 see [6], then s 2 A2 n > log n/ log5.5 c 2, where c 2 is some positive constant. We give no further details. Acknowledgements This work was done when all authors were in residence at the Abdus Salam School of Mathematical Sciences in Lahore, Pakistan. They thank the institution for its hospitality. References [] D. S. Dummit and R. M. Foote, Abstract algebra, John Wiley & Sons Inc., Hoboken, NJ, third ed., [2] Hardy-Wright, An introduction to the theory of numbers. Sixth edition. Oxford University Press, Oxford, [3] M. Křížek, F. Luca and L. Somer, 7 Lectures on Fermat Numbers: From Number Theory to Geometry, CMS books in mathematics, 0, Springer New York, [4] R. Marcovecchio, The Rhin-Viola method for log 2, Acta Arithmetica , [5] H. L. Montgomery and R. C. Vaughan, The large sieve, Mathematika , [6] G. Rhin and C. Viola, On a permutation group related to ζ2, Acta Arith , [7] J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math , [8] E. A. Rukhadze, A lower bound for the approximation of ln 2 by rational numbers, Vestnik Moskov. Univ. Ser. I Mat. Mekh , 97 in Russian. [9] M. Waldschmidt, Recent advances in Diophantine approximation, D. Goldfeld et al. eds., Number Theory, Analysis and Geometry: In Memory of Serge Lang, Springer Verlag, to appear in 202.

Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24

Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24 Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 31 (2004) 19 24 PRIMITIVE DIVISORS OF LUCAS SEQUENCES AND PRIME FACTORS OF x 2 + 1 AND x 4 + 1 Florian Luca (Michoacán, México) Abstract. In this

More information

On a problem of Nicol and Zhang

On a problem of Nicol and Zhang Journal of Number Theory 28 2008 044 059 www.elsevier.com/locate/jnt On a problem of Nicol and Zhang Florian Luca a, József Sándor b, a Instituto de Matemáticas, Universidad Nacional Autonoma de México,

More information

Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México

Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P , Morelia, Michoacán, México Florian Luca Instituto de Matemáticas, Universidad Nacional Autonoma de México, C.P. 8180, Morelia, Michoacán, México e-mail: fluca@matmor.unam.mx Laszlo Szalay Department of Mathematics and Statistics,

More information

Summary Slides for MATH 342 June 25, 2018

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

More information

On the Fractional Parts of a n /n

On the Fractional Parts of a n /n On the Fractional Parts of a n /n Javier Cilleruelo Instituto de Ciencias Matemáticas CSIC-UAM-UC3M-UCM and Universidad Autónoma de Madrid 28049-Madrid, Spain franciscojavier.cilleruelo@uam.es Angel Kumchev

More information

Journal of Number Theory

Journal of Number Theory Journal of Number Theory 132 2012) 324 331 Contents lists available at SciVerse ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt Digit sums of binomial sums Arnold Knopfmacher a,florianluca

More information

Irreducible radical extensions and Euler-function chains

Irreducible radical extensions and Euler-function chains Irreducible radical extensions and Euler-function chains Florian Luca Carl Pomerance June 14, 2006 For Ron Graham on his 70th birthday Abstract We discuss the smallest algebraic number field which contains

More information

FIBONACCI DIOPHANTINE TRIPLES. Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary

FIBONACCI DIOPHANTINE TRIPLES. Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary GLASNIK MATEMATIČKI Vol. 436300, 53 64 FIBONACCI DIOPHANTINE TRIPLES Florian Luca and László Szalay Universidad Nacional Autonoma de México, Mexico and University of West Hungary, Hungary Abstract. In

More information

Fibonacci Diophantine Triples

Fibonacci Diophantine Triples Fibonacci Diophantine Triples Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de México C.P. 58180, Morelia, Michoacán, México fluca@matmor.unam.mx László Szalay Institute of Mathematics

More information

ON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS. Yann Bugeaud Université de Strasbourg, France

ON 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

Partial Sums of Powers of Prime Factors

Partial Sums of Powers of Prime Factors 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 10 (007), Article 07.1.6 Partial Sums of Powers of Prime Factors Jean-Marie De Koninck Département de Mathématiques et de Statistique Université Laval Québec

More information

Fibonacci numbers of the form p a ± p b

Fibonacci numbers of the form p a ± p b Fibonacci numbers of the form p a ± p b Florian Luca 1 and Pantelimon Stănică 2 1 IMATE, UNAM, Ap. Postal 61-3 (Xangari), CP. 8 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn University

More information

Arithmetic properties of the Ramanujan function

Arithmetic properties of the Ramanujan function Proc. Indian Acad. Sci. (Math. Sci.) Vol. 116, No. 1, February 2006, pp. 1 8. Printed in India Arithmetic properties of the Ramanujan function FLORIAN LUCA 1 and IGOR E SHPARLINSKI 2 1 Instituto de Matemáticas,

More information

#A12 INTEGERS 11 (2011) ON THE NUMBER OF FACTORIZATIONS OF AN INTEGER

#A12 INTEGERS 11 (2011) ON THE NUMBER OF FACTORIZATIONS OF AN INTEGER #A12 INTEGERS 11 (2011) ON THE NUMBER OF FACTORIZATIONS OF AN INTEGER R. Balasubramanian The Institute of Mathematical Sciences, Chennai, India balu@imsc.res.in Florian Luca 1 Instituto de Matemáticas,

More information

Cullen Numbers in Binary Recurrent Sequences

Cullen Numbers in Binary Recurrent Sequences Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn

More information

On the largest prime factor of the Mersenne numbers

On the largest prime factor of the Mersenne numbers arxiv:0704.137v1 [math.nt] 10 Apr 007 On the largest prime factor of the Mersenne numbers Kevin Ford Department of Mathematics The University of Illinois at Urbana-Champaign Urbana Champaign, IL 61801,

More information

Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela

Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela #A89 INTEGERS 16 (016) ON SIERPIŃSKI NUMBERS OF THE FORM '(N)/ n Marcos J. González Departamento de Matemáticas Puras y Aplicadas, Universidad Simón Bolívar, Sartenejas, Caracas, Venezuela mago@usb.ve

More information

#A2 INTEGERS 12A (2012): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS

#A2 INTEGERS 12A (2012): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS #A2 INTEGERS 2A (202): John Selfridge Memorial Issue ON A CONJECTURE REGARDING BALANCING WITH POWERS OF FIBONACCI NUMBERS Saúl Díaz Alvarado Facultad de Ciencias, Universidad Autónoma del Estado de México,

More information

Irrationality exponent and rational approximations with prescribed growth

Irrationality exponent and rational approximations with prescribed growth Irrationality exponent and rational approximations with prescribed growth Stéphane Fischler and Tanguy Rivoal June 0, 2009 Introduction In 978, Apéry [2] proved the irrationality of ζ(3) by constructing

More information

Part II. Number Theory. Year

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

More information

Perfect Powers With All Equal Digits But One

Perfect Powers With All Equal Digits But One 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 8 (2005), Article 05.5.7 Perfect Powers With All Equal Digits But One Omar Kihel Department of Mathematics Brock University St. Catharines, Ontario L2S

More information

Two Diophantine Approaches to the Irreducibility of Certain Trinomials

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

Houston Journal of Mathematics c 2050 University of Houston Volume 76, No. 1, Communicated by George Washington

Houston Journal of Mathematics c 2050 University of Houston Volume 76, No. 1, Communicated by George Washington Houston Journal of Mathematics c 2050 University of Houston Volume 76, No., 2050 SUMS OF PRIME DIVISORS AND MERSENNE NUMBERS WILLIAM D. BANKS AND FLORIAN LUCA Communicated by George Washington Abstract.

More information

Members of binary recurrences on lines of the Pascal triangle

Members of binary recurrences on lines of the Pascal triangle Publ. Math. Debrecen 67/1-2 (2005), 103 113 Members of binary recurrences on lines of the Pascal triangle By FLORIAN LUCA (Morelia) and FRANCESCO PAPPALARDI (Roma) Abstract. In this paper, we look at a

More information

ABSTRACT. In this note, we find all the solutions of the Diophantine equation x k = y n, 1, y 1, k N, n INTRODUCTION

ABSTRACT. In this note, we find all the solutions of the Diophantine equation x k = y n, 1, y 1, k N, n INTRODUCTION Florian Luca Instituto de Matemáticas UNAM, Campus Morelia Apartado Postal 27-3 (Xangari), C.P. 58089, Morelia, Michoacán, Mexico e-mail: fluca@matmor.unam.mx Alain Togbé Mathematics Department, Purdue

More information

E-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )

E-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, ) E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric

More information

On the number of elements with maximal order in the multiplicative group modulo n

On the number of elements with maximal order in the multiplicative group modulo n ACTA ARITHMETICA LXXXVI.2 998 On the number of elements with maximal order in the multiplicative group modulo n by Shuguang Li Athens, Ga.. Introduction. A primitive root modulo the prime p is any integer

More information

ON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A.

ON SUMS OF PRIMES FROM BEATTY SEQUENCES. Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD , U.S.A. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A08 ON SUMS OF PRIMES FROM BEATTY SEQUENCES Angel V. Kumchev 1 Department of Mathematics, Towson University, Towson, MD 21252-0001,

More information

ON THE DECIMAL EXPANSION OF ALGEBRAIC NUMBERS

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

Proofs of the infinitude of primes

Proofs of the infinitude of primes Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number

More information

Chapter 1 : The language of mathematics.

Chapter 1 : The language of mathematics. MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :

More information

The primitive root theorem

The primitive root theorem The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under

More information

THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS

THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Annales Univ. Sci. Budapest., Sect. Comp. 40 (2013) nn nnn THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated to

More information

198 VOLUME 46/47, NUMBER 3

198 VOLUME 46/47, NUMBER 3 LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson

More information

A Gel fond type criterion in degree two

A Gel fond type criterion in degree two ACTA ARITHMETICA 111.1 2004 A Gel fond type criterion in degree two by Benoit Arbour Montréal and Damien Roy Ottawa 1. Introduction. Let ξ be any real number and let n be a positive integer. Defining the

More information

Revista Colombiana de Matemáticas Volumen 40 (2006), páginas 81 86

Revista Colombiana de Matemáticas Volumen 40 (2006), páginas 81 86 Revista Colombiana de Matemáticas Volumen 40 2006), páginas 81 86 Palindromic powers Santos Hernández Hernández Pontificia Universidad Católica de Chile, Santigo Florian Luca Universidad Nacional Autónoma

More information

PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca

PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER. Bernadette Faye and Florian Luca PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série tome 05 207 23 245 https://doiorg/02298/pim7523f PELL NUMBERS WHOSE EULER FUNCTION IS A PELL NUMBER Bernadette Faye and Florian Luca Abstract We show

More information

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

PUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime. PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice

More information

PRIME NUMBERS YANKI LEKILI

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

More information

THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5

THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 JEREMY LOVEJOY Abstract. We establish a relationship between the factorization of n+1 and the 5-divisibility of Q(n, where Q(n is the number

More information

Density of non-residues in Burgess-type intervals and applications

Density of non-residues in Burgess-type intervals and applications Bull. London Math. Soc. 40 2008) 88 96 C 2008 London Mathematical Society doi:0.2/blms/bdm Density of non-residues in Burgess-type intervals and applications W. D. Banks, M. Z. Garaev, D. R. Heath-Brown

More information

A New Attack on RSA with Two or Three Decryption Exponents

A New Attack on RSA with Two or Three Decryption Exponents A New Attack on RSA with Two or Three Decryption Exponents Abderrahmane Nitaj Laboratoire de Mathématiques Nicolas Oresme Université de Caen, France nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj

More information

Winter Camp 2009 Number Theory Tips and Tricks

Winter 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

Flat primes and thin primes

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

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

More information

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography

Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups

More information

Notes on Equidistribution

Notes on Equidistribution otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for

More information

On the β-expansion of an algebraic number in an algebraic base β. (Strasbourg)

On the β-expansion of an algebraic number in an algebraic base β. (Strasbourg) On the β-expansion of an algebraic number in an algebraic base β Yann BUGEAUD (Strasbourg) Abstract. Let α in (0, 1] and β > 1 be algebraic numbers. We study the asymptotic behaviour of the function that

More information

Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt

Abstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt 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

More information

Math 412: Number Theory Lecture 3: Prime Decomposition of

Math 412: Number Theory Lecture 3: Prime Decomposition of Math 412: Number Theory Lecture 3: Prime Decomposition of Integers Gexin Yu gyu@wm.edu College of William and Mary Prime numbers Definition: a (positive) integer p is prime if p has no divisor other than

More information

INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS

INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS JEAN-MARIE DE KONINCK and FLORIAN LUCA Abstract. For each integer n 2, let β(n) be the sum of the distinct prime divisors of n and let B(x) stand for

More information

On Integers for Which the Sum of Divisors is the Square of the Squarefree Core

On Integers for Which the Sum of Divisors is the Square of the Squarefree Core 1 3 47 6 3 11 Journal of Integer Sequences, Vol. 15 (01), Article 1.7.5 On Integers for Which the Sum of Divisors is the Square of the Squarefree Core Kevin A. Broughan Department of Mathematics University

More information

2 More on Congruences

2 More on Congruences 2 More on Congruences 2.1 Fermat s Theorem and Euler s Theorem definition 2.1 Let m be a positive integer. A set S = {x 0,x 1,,x m 1 x i Z} is called a complete residue system if x i x j (mod m) whenever

More information

Introduction to Number Theory

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

More information

Zsigmondy s Theorem. Lola Thompson. August 11, Dartmouth College. Lola Thompson (Dartmouth College) Zsigmondy s Theorem August 11, / 1

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

Elementary Properties of Cyclotomic Polynomials

Elementary Properties of Cyclotomic Polynomials Elementary Properties of Cyclotomic Polynomials Yimin Ge Abstract Elementary properties of cyclotomic polynomials is a topic that has become very popular in Olympiad mathematics. The purpose of this article

More information

Rational approximations to π and some other numbers

Rational approximations to π and some other numbers ACTA ARITHMETICA LXIII.4 (993) Rational approximations to π and some other numbers by Masayoshi Hata (Kyoto). Introduction. In 953 K. Mahler [2] gave a lower bound for rational approximations to π by showing

More information

GENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA

GENERALIZATIONS OF SOME ZERO-SUM THEOREMS. Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad , INDIA INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A52 GENERALIZATIONS OF SOME ZERO-SUM THEOREMS Sukumar Das Adhikari Harish-Chandra Research Institute, Chhatnag Road, Jhusi, Allahabad

More information

ON THE SEMIPRIMITIVITY OF CYCLIC CODES

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

When do Fibonacci invertible classes modulo M form a subgroup?

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

Fermat numbers and integers of the form a k + a l + p α

Fermat numbers and integers of the form a k + a l + p α ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac

More information

arxiv: v1 [math.nt] 8 Jan 2014

arxiv: v1 [math.nt] 8 Jan 2014 A NOTE ON p-adic VALUATIONS OF THE SCHENKER SUMS PIOTR MISKA arxiv:1401.1717v1 [math.nt] 8 Jan 2014 Abstract. A prime number p is called a Schenker prime if there exists such n N + that p nandp a n, wherea

More information

= 1 2x. x 2 a ) 0 (mod p n ), (x 2 + 2a + a2. x a ) 2

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

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

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

More information

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

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

More information

Math 314 Course Notes: Brief description

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

More information

Probabilistic Aspects of the Integer-Polynomial Analogy

Probabilistic Aspects of the Integer-Polynomial Analogy Probabilistic Aspects of the Integer-Polynomial Analogy Kent E. Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu Zhou Dong Department

More information

On the Subsequence of Primes Having Prime Subscripts

On the Subsequence of Primes Having Prime Subscripts 3 47 6 3 Journal of Integer Sequences, Vol. (009, Article 09..3 On the Subsequence of Primes Having Prime Subscripts Kevin A. Broughan and A. Ross Barnett University of Waikato Hamilton, New Zealand kab@waikato.ac.nz

More information

On the spacings between C-nomial coefficients

On the spacings between C-nomial coefficients On the spacings between C-nomial coefficients lorian Luca, Diego Marques,2, Pantelimon Stănică 3 Instituto de Matemáticas, Universidad Nacional Autónoma de México C.P. 58089, Morelia, Michoacán, México,

More information

A Pellian equation with primes and applications to D( 1)-quadruples

A Pellian equation with primes and applications to D( 1)-quadruples A Pellian equation with primes and applications to D( 1)-quadruples Andrej Dujella 1, Mirela Jukić Bokun 2 and Ivan Soldo 2, 1 Department of Mathematics, Faculty of Science, University of Zagreb, Bijenička

More information

Prime divisors of binary holonomic sequences

Prime divisors of binary holonomic sequences Advances in Applied Mathematics 40 (2008) 168 179 www.elsevier.com/locate/yaama Prime divisors of binary holonomic sequences Florian Luca Instituto de Matemáticas, Universidad Nacional Autónoma de México,

More information

arxiv:math/ v1 [math.nt] 9 Aug 2004

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

Journal of Number Theory

Journal of Number Theory Journal of Number Theory 133 2013) 1809 1813 Contents lists available at SciVerse ScienceDirect Journal of Number Theory www.elsevier.com/locate/jnt The abc conjecture and non-wieferich primes in arithmetic

More information

Approximation exponents for algebraic functions in positive characteristic

Approximation exponents for algebraic functions in positive characteristic ACTA ARITHMETICA LX.4 (1992) Approximation exponents for algebraic functions in positive characteristic by Bernard de Mathan (Talence) In this paper, we study rational approximations for algebraic functions

More information

A remark on a conjecture of Chowla

A remark on a conjecture of Chowla J. Ramanujan Math. Soc. 33, No.2 (2018) 111 123 A remark on a conjecture of Chowla M. Ram Murty 1 and Akshaa Vatwani 2 1 Department of Mathematics, Queen s University, Kingston, Ontario K7L 3N6, Canada

More information

P -adic root separation for quadratic and cubic polynomials

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

Contest Number Theory

Contest Number Theory Contest Number Theory Andre Kessler December 7, 2008 Introduction Number theory is one of the core subject areas of mathematics. It can be somewhat loosely defined as the study of the integers. Unfortunately,

More information

ON THE EQUATION τ(λ(n)) = ω(n) + k

ON THE EQUATION τ(λ(n)) = ω(n) + k ON THE EQUATION τ(λ(n)) = ω(n) + k A. GLIBICHUK, F. LUCA AND F. PAPPALARDI Abstract. We investigate some properties of the positive integers n that satisfy the equation τ(λ(n)) = ω(n)+k providing a complete

More information

Möbius Inversion Formula and Applications to Cyclotomic Polynomials

Möbius Inversion Formula and Applications to Cyclotomic Polynomials Degree Project Möbius Inversion Formula and Applications to Cyclotomic Polynomials 2012-06-01 Author: Zeynep Islek Subject: Mathematics Level: Bachelor Course code: 2MA11E Abstract This report investigates

More information

Combinatorics, Automata and Number Theory

Combinatorics, Automata and Number Theory Combinatorics, Automata and Number Theory CANT Edited by Valérie Berthé LIRMM - Université Montpelier II - CNRS UMR 5506 161 rue Ada, F-34392 Montpellier Cedex 5, France Michel Rigo Université de Liège,

More information

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

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

More information

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

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

More information

ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT

ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT #A34 INTEGERS 1 (01) ODD REPDIGITS TO SMALL BASES ARE NOT PERFECT Kevin A. Broughan Department of Mathematics, University of Waikato, Hamilton 316, New Zealand kab@waikato.ac.nz Qizhi Zhou Department of

More information

THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS

THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Annales Univ. Sci. Budapest., Sect. Comp. 41 (2013) 119 124 THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS Florian Luca (Morelia, Mexico) Pantelimon Stănică (Monterey, USA) Dedicated

More information

MIT Algebraic techniques and semidefinite optimization February 16, Lecture 4

MIT Algebraic techniques and semidefinite optimization February 16, Lecture 4 MIT 6.972 Algebraic techniques and semidefinite optimization February 16, 2006 Lecture 4 Lecturer: Pablo A. Parrilo Scribe: Pablo A. Parrilo In this lecture we will review some basic elements of abstract

More information

NOTES ON ZHANG S PRIME GAPS PAPER

NOTES ON ZHANG S PRIME GAPS PAPER NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for

More information

On strings of consecutive economical numbers of arbitrary length

On strings of consecutive economical numbers of arbitrary length INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 5(2) (2005), #A05 1 On strings of consecutive economical numbers of arbitrary length Jean-Marie De Koninck 1 and Florian Luca 2 Received: 11/5/03,

More information

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY

NORMAL NUMBERS AND UNIFORM DISTRIBUTION (WEEKS 1-3) OPEN PROBLEMS IN NUMBER THEORY SPRING 2018, TEL AVIV UNIVERSITY ORMAL UMBERS AD UIFORM DISTRIBUTIO WEEKS -3 OPE PROBLEMS I UMBER THEORY SPRIG 28, TEL AVIV UIVERSITY Contents.. ormal numbers.2. Un-natural examples 2.3. ormality and uniform distribution 2.4. Weyl s criterion

More information

Exponential and character sums with Mersenne numbers

Exponential and character sums with Mersenne numbers Exponential and character sums with Mersenne numbers William D. Banks Dept. of Mathematics, University of Missouri Columbia, MO 652, USA bankswd@missouri.edu John B. Friedlander Dept. of Mathematics, University

More information

Open Problems with Factorials

Open Problems with Factorials Mathematics Open Problems with Factorials Sílvia Casacuberta supervised by Dr. Xavier Taixés November 3, 2017 Preamble This essay contains the results of a research project on number theory focusing on

More information

Order and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA

Order and chaos. Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Order and chaos Carl Pomerance, Dartmouth College Hanover, New Hampshire, USA Perfect shuffles Suppose you take a deck of 52 cards, cut it in half, and perfectly shuffle it (with the bottom card staying

More information

Evidence for the Riemann Hypothesis

Evidence for the Riemann Hypothesis Evidence for the Riemann Hypothesis Léo Agélas September 0, 014 Abstract Riemann Hypothesis (that all non-trivial zeros of the zeta function have real part one-half) is arguably the most important unsolved

More information

7. Prime Numbers Part VI of PJE

7. Prime Numbers Part VI of PJE 7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.

More information

Low-discrepancy sequences obtained from algebraic function fields over finite fields

Low-discrepancy sequences obtained from algebraic function fields over finite fields ACTA ARITHMETICA LXXII.3 (1995) Low-discrepancy sequences obtained from algebraic function fields over finite fields by Harald Niederreiter (Wien) and Chaoping Xing (Hefei) 1. Introduction. We present

More information

Proof by Contradiction

Proof by Contradiction Proof by Contradiction MAT231 Transition to Higher Mathematics Fall 2014 MAT231 (Transition to Higher Math) Proof by Contradiction Fall 2014 1 / 12 Outline 1 Proving Statements with Contradiction 2 Proving

More information

Numération : mathématiques et informatique

Numération : mathématiques et informatique Numération : mathématiques et informatique Rencontre organisée par : Boris Adamczewski, Anne Siegel and Wolfgang Steiner 23-27 mars 2009 Tanguy Rivoal On the binary expansion of irrational algebraic numbers

More information

Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively

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

1 Diophantine quintuple conjecture

1 Diophantine quintuple conjecture Conjectures and results on the size and number of Diophantine tuples Andrej Dujella Department of Mathematics, University of Zagreb Bijenička cesta 30, 10000 Zagreb, CROATIA E-mail: duje@math.hr URL :

More information

On Some Mean Value Results for the Zeta-Function and a Divisor Problem

On Some Mean Value Results for the Zeta-Function and a Divisor Problem Filomat 3:8 (26), 235 2327 DOI.2298/FIL6835I Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On Some Mean Value Results for the

More information