Uniform distribution mod 1, results and open problems

Similar documents
New methods for constructing normal numbers

RESEARCH PROBLEMS IN NUMBER THEORY

ON THE UNIFORM DISTRIBUTION OF CERTAIN SEQUENCES INVOLVING THE EULER TOTIENT FUNCTION AND THE SUM OF DIVISORS FUNCTION

The Mysterious World of Normal Numbers

SOME RESULTS AND PROBLEMS IN PROBABILISTIC NUMBER THEORY

THE DISTRIBUTION OF ADDITIVE FUNCTIONS IN SHORT INTERVALS ON THE SET OF SHIFTED INTEGERS HAVING A FIXED NUMBER OF PRIME FACTORS

A characterization of the identity function

TOPICS IN NUMBER THEORY - EXERCISE SHEET I. École Polytechnique Fédérale de Lausanne

Prime-like sequences leading to the construction of normal numbers

ITERATES OF THE SUM OF THE UNITARY DIVISORS OF AN INTEGER

ON THE SUM OF DIVISORS FUNCTION

Les chiffres des nombres premiers. (Digits of prime numbers)

THE SUM OF DIGITS OF PRIMES

THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS

Acta Mathematica Academiae Paedagogicae Nyíregyháziensis 32 (2016), ISSN

DIGITAL EXPANSION OF EXPONENTIAL SEQUENCES

On the maximal exponent of the prime power divisor of integers

INTEGERS DIVISIBLE BY THE SUM OF THEIR PRIME FACTORS

CONTINUATION OF THE LAUDATION TO Professor Bui Minh Phong on his 65-th birthday

as x. Before giving the detailed proof, we outline our strategy. Define the functions for Re s > 1.

A NOTE ON NORMAL NUMBERS IN MATRIX NUMBER SYSTEMS

Randomness and Complexity of Sequences over Finite Fields. Harald Niederreiter, FAMS. RICAM Linz and University of Salzburg (Austria)

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

Advanced Number Theory Note #8: Dirichlet's theorem on primes in arithmetic progressions 29 August 2012 at 19:01

Existence of a Limit on a Dense Set, and. Construction of Continuous Functions on Special Sets

Eötvös Loránd University Faculty of Informatics. Distribution of additive arithmetical functions

A LITTLE BIT OF NUMBER THEORY

An Introduction to Ergodic Theory

Carmichael numbers and the sieve

arithmetic properties of weighted catalan numbers

THE EULER FUNCTION OF FIBONACCI AND LUCAS NUMBERS AND FACTORIALS

Solving a linear equation in a set of integers II

Part IA Numbers and Sets

USING LARGE PRIME DIVISORS TO CONSTRUCT NORMAL NUMBERS

Kolmogorov Complexity and Diophantine Approximation

DIVISOR FUNCTION τ 3 (ω) IN ARITHMETIC PROGRESSION

Ergodic aspects of modern dynamics. Prime numbers in two bases

Acta Academiae Paedagogicae Agriensis, Sectio Mathematicae 30 (2003) ON ADDITIVE FUNCTIONS SATISFYING CONGRUENCE PROPERTIES

Partial Sums of Powers of Prime Factors

The universality of quadratic L-series for prime discriminants

On Normal Numbers. Theodore A. Slaman. University of California Berkeley

JEAN-MARIE DE KONINCK AND IMRE KÁTAI

Before giving the detailed proof, we outline our strategy. Define the functions. for Re s > 1.

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

Special values of derivatives of L-series and generalized Stieltjes constants

On the discrepancy estimate of normal numbers

A numerically explicit Burgess inequality and an application to qua

Almost Primes of the Form p c

Part II. Number Theory. Year

Counting Prime Numbers with Short Binary Signed Representation

Three-Bit Monomial Hyperovals

A little bit of number theory

UNIVERSALITY OF THE RIEMANN ZETA FUNCTION: TWO REMARKS

Dept of Math., SCU+USTC

On the digits of prime numbers

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

The Prime Number Theorem

ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS

Large gaps in sets of primes and other sequences II. New bounds for large gaps between primes Random methods and weighted sieves

On a diophantine inequality involving prime numbers

Integers without divisors from a fixed arithmetic progression

(Primes and) Squares modulo p

Elementary Proof that an Infinite Number of Pierpont Primes Exist

Theorem 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.

Pretentiousness in analytic number theory. Andrew Granville A report on joint work with K. Soundararajan, and Antal Balog

PROBLEMS ON CONGRUENCES AND DIVISIBILITY

Perfect numbers among polynomial values

Solutions to Assignment 1

Reciprocals of the Gcd-Sum Functions

Vinogradov s mean value theorem and its associated restriction theory via efficient congruencing.

ANALYTIC NUMBER THEORY AND DIRICHLET S THEOREM

CSE 1400 Applied Discrete Mathematics Definitions

Chapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem

Möbius Randomness and Dynamics

An Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD

Covering Subsets of the Integers and a Result on Digits of Fibonacci Numbers

ON THE RACE BETWEEN PRIMES WITH AN ODD VERSUS AN EVEN SUM OF THE LAST k BINARY DIGITS

The ranges of some familiar arithmetic functions

Two problems in combinatorial number theory

Analytic. Number Theory. Exploring the Anatomy of Integers. Jean-Marie. De Koninck. Florian Luca. ffk li? Graduate Studies.

arxiv: v1 [math.nt] 24 Mar 2009

Apéry Numbers, Franel Numbers and Binary Quadratic Forms

Some new representation problems involving primes

Counting patterns in digital expansions

On the maximal density of sum-free sets

JOINT LIMIT THEOREMS FOR PERIODIC HURWITZ ZETA-FUNCTION. II

Predictive criteria for the representation of primes by binary quadratic forms

Representation of p-adic numbers in rational base numeration systems

arxiv:math/ v1 [math.nt] 17 Apr 2006

EXISTENCE OF MOMENTS IN THE HSU ROBBINS ERDŐS THEOREM

Almost All Palindromes Are Composite

PALINDROMIC SUMS OF PROPER DIVISORS. Paul Pollack Department of Mathematics, University of Georgia, Athens, GA 30602, USA

On the low-lying zeros of elliptic curve L-functions

The ternary Goldbach problem. Harald Andrés Helfgott. Introduction. The circle method. The major arcs. Minor arcs. Conclusion.

EXPONENTIAL SUMS EQUIDISTRIBUTION

Exact exponent in the remainder term of Gelfond s digit theorem in the binary case

PATTERNS OF PRIMES IN ARITHMETIC PROGRESSIONS

On Carmichael numbers in arithmetic progressions

arxiv: v2 [math.nt] 15 Oct 2017

Defining the Integral

Transcription:

Uniform distribution mod 1, Jean-Marie De Koninck and Imre Kátai Uniform Distribution Theory October 3, 2018

The plan I. The Vienna conference of 2016 II. Old and recent results on regularly varying arithmetical functions III. The Chowla conjecture and normal numbers IV. Remarks on a theorem of Hedi Daboussi

I. The 2016 Vienna conference Title : New approaches in the construction of normal numbers available at : www.jeanmariedekoninck.mat.ulaval.ca

Open problems formulated in 2016 1. Let M be the semi-group generated by the integers 2 and 3. Let m 1 < m 2 < be the list of all the elements of M. Is it possible to construct a real number α such that the sequence (y n ) n N, where y n = {m n α}, is uniformly distributed in the interval [0, 1)? 2. Is it possible to construct a real number β for which the corresponding sequence (s n ) n N, where s n = {( 2) n β}, is uniformly distributed in the interval [0, 1)?

Conjectures formulated in 2016 3. Fix an integer q 3 and let 1 = l 0 < l 1 < < l ϕ(q) 1 be the list of reduced residues modulo q. Let q = {p : p q} = {p 1, p 2,...}. For each p q, let h(p) = ν if p l ν (mod q). Let α = 0.h(p 1 ) h(p 2 ) h(p 3 )... (ϕ(q)-ary expansion). Conjecture 1 : α is a ϕ(q)-ary normal number. Conjecture 2 : α is a ϕ(q)-ary normal number with weight 1/n, that is, for every positive integer k, given e 1... e k, an arbitrary block of k digits in {0, 1,..., ϕ(q) 1}, we have lim N 1 log N n N h(p n+1 )...h(p n+k )=e 1...e k 1 n = 1 ϕ(q). k

I. The 2016 Vienna conference Detailed account of our results is available in : Nineteen papers on normal numbers Accessible at : www.jeanmariedekoninck.mat.ulaval.ca

II. Old and recent results on arithmetic functions ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

II. Old and recent results on arithmetic functions If f A and f (n) := f (n + 1) f (n) 0 as n, then f (n) = c log n (P. Erdős, 1946) ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

II. Old and recent results on arithmetic functions If f A and f (n) := f (n + 1) f (n) 0 as n, then f (n) = c log n (P. Erdős, 1946) If f A and 1 x f (n) 0 as x, then f (n) = c log n (conjectured by Erdős and proved by Kátai and Wirsing) ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

II. Old and recent results on arithmetic functions If f A and f (n) := f (n + 1) f (n) 0 as n, then f (n) = c log n (P. Erdős, 1946) If f A and 1 x f (n) 0 as x, then f (n) = c log n (conjectured by Erdős and proved by Kátai and Wirsing) If f M and f (n) 0 as n, then lim n f (n) = 0 or f (n) = n s (with R(s) < 1) (conjectured by Kátai and proved by Wirsing, Shao Pintsung and Tang Yuan Shang) ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

II. Old and recent results on arithmetic functions Two conjectures of Kátai :

II. Old and recent results on arithmetic functions Two conjectures of Kátai : 1 (a) If f M and lim x x f (n) = 0, then either f (n) = 0 or f (n) = ns (with R(s) < 1) lim x 1 x

II. Old and recent results on arithmetic functions Two conjectures of Kátai : 1 (a) If f M and lim x x f (n) = 0, then either f (n) = 0 or f (n) = ns (with R(s) < 1) lim x 1 x f (n) n 1 (b) If f M and lim x = 0, then either log x f (n) = 0 or f (n) = ns (with R(s) < 1) lim x 1 x

II. Old and recent results on arithmetic functions Two conjectures of Kátai : 1 (a) If f M and lim x x f (n) = 0, then either f (n) = 0 or f (n) = ns (with R(s) < 1) lim x 1 x f (n) n 1 (b) If f M and lim x = 0, then either log x f (n) = 0 or f (n) = ns (with R(s) < 1) lim x 1 x In 2017, Oleksiy Klurman proved the two conjectures (a) and (b).

II. Old and recent results on arithmetic functions

II. Old and recent results on arithmetic functions Consider the set M 1 of multiplicative functions f : N T := {z : z = 1} and let S(f ) stand for the set of limit points of {f (n) : n N}.

II. Old and recent results on arithmetic functions Consider the set M 1 of multiplicative functions f : N T := {z : z = 1} and let S(f ) stand for the set of limit points of {f (n) : n N}. Kátai s conjecture (Quebec Number Theory Conference, 1987) : Let f M 1 be such that S(f ) = T. Then, S({f (n + 1)f (n) : n N}) = T, except when f (n) = n iτ g(n) and g k (n) = 1 for all n N for some positive integer k.

II. Old and recent results on arithmetic functions Consider the set M 1 of multiplicative functions f : N T := {z : z = 1} and let S(f ) stand for the set of limit points of {f (n) : n N}. Kátai s conjecture (Quebec Number Theory Conference, 1987) : Let f M 1 be such that S(f ) = T. Then, S({f (n + 1)f (n) : n N}) = T, except when f (n) = n iτ g(n) and g k (n) = 1 for all n N for some positive integer k. In 2017, Oleksiy Klurman and Alexander Mangerel proved Kátai s conjecture.

II. Old and recent results on arithmetic functions As a consequence of Klurman s result, the following could be proved :

II. Old and recent results on arithmetic functions As a consequence of Klurman s result, the following could be proved : (A) (Indlekofer, Kátai, Bui Minh Phong) If f M and f (n) = O(log x), then either f (n) n = O(log x) or n f (n) = n σ+it for some σ (0, 1).

II. Old and recent results on arithmetic functions As a consequence of Klurman s result, the following could be proved : (A) (Indlekofer, Kátai, Bui Minh Phong) If f M and f (n) = O(log x), then either f (n) n = O(log x) or n f (n) = n σ+it for some σ (0, 1). (B) (Indlekofer, Kátai, Bui Minh Phong) If f M and 1 lim sup x <, then either f (n) n log x f (n+k) f (n) n = O(log x) or f (n) = n σ+it χ, where χ is a Dirichlet character mod k. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

II. Old and recent results on arithmetic functions As a consequence of Klurman s result, the following could be proved : (A) (Indlekofer, Kátai, Bui Minh Phong) If f M and f (n) = O(log x), then either f (n) n = O(log x) or n f (n) = n σ+it for some σ (0, 1). (B) (Indlekofer, Kátai, Bui Minh Phong) If f M and 1 lim sup x <, then either f (n) n log x f (n+k) f (n) n = O(log x) or f (n) = n σ+it χ, where χ is a Dirichlet character mod k. Remark. Perhaps similar theorems can be proved if one replaces k f (n) := f (n + k) f (n) by P(E)f (n) := a 0 f (n) + + a k f (n + k). ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

II. Old and recent results on arithmetic functions

II. Old and recent results on arithmetic functions (C) (Kátai and Bui Minh Phong) Given k {1, 2, 3} and assuming that P(E)f (n) = O(log x), then either f (n) n = O(log x) or n f (n) = n s F (n) with P(E)F (n) = 0.

II. Old and recent results on arithmetic functions (C) (Kátai and Bui Minh Phong) Given k {1, 2, 3} and assuming that P(E)f (n) = O(log x), then either f (n) n = O(log x) or n f (n) = n s F (n) with P(E)F (n) = 0. (D) From the theorem of Klurman and Mangerel, one can prove the following. Given an additive function f and τ 1, τ 2 R such that τ 2 /τ 1 R \ Q. Then, if lim x 1 τ i f (n) log x n we have f (n) = c log n. = 0 (i = 1, 2), ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

III. A problem related to the Chowla conjecture ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

III. A problem related to the Chowla conjecture According to the Chowla conjecture, if λ(n) stands for the Liouville function, 1 λ(a 1 n + b 1 ) λ(a k n + b k ) 0 as x, x provided that a i b j b i a j for all 1 i j k. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

III. A problem related to the Chowla conjecture According to the Chowla conjecture, if λ(n) stands for the Liouville function, 1 λ(a 1 n + b 1 ) λ(a k n + b k ) 0 as x, x provided that a i b j b i a j for all 1 i j k. Hence, setting ε n = λ(n)+1 2 for each n N and assuming the Chowla conjecture, each number ξ k,l := 0.ε k+l ε 2k+l ε 3k+l... is a binary normal number for all integers k 1 and l 0. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

III. A problem related to the Chowla conjecture According to the Chowla conjecture, if λ(n) stands for the Liouville function, 1 λ(a 1 n + b 1 ) λ(a k n + b k ) 0 as x, x provided that a i b j b i a j for all 1 i j k. Hence, setting ε n = λ(n)+1 2 for each n N and assuming the Chowla conjecture, each number ξ k,l := 0.ε k+l ε 2k+l ε 3k+l... is a binary normal number for all integers k 1 and l 0. Problem. Construct such a sequence ε n {0, 1} for which the corresponding numbers ξ k,l represent binary normal numbers. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi

IV. Remarks on a theorem of Hedi Daboussi Daboussi (1974) : Given any irrational number α and any complex-valued multiplicative function f such that f (n) 1, one has 1 lim f (n)e(αn) = 0. x x

IV. Remarks on a theorem of Hedi Daboussi Daboussi (1974) : Given any irrational number α and any complex-valued multiplicative function f such that f (n) 1, one has 1 lim f (n)e(αn) = 0. x x Kátai : Let be a set of primes satisfying p 1/p = + and let f : N C and u : N C be two functions satisfying f (n) 1 and u(n) 1 for all n N. If 1 (1) lim u(p 1 n)u(p 2 n) = 0 for every p 1 p 2, x x (2) f (pm) = f (p)f (m) for all p and m N, 1 then, lim x x f (n)u(n) = 0. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi Kátai : Let be a set of primes satisfying p 1/p = + and let f : N C and u : N C be two functions satisfying f (n) 1 and u(n) 1 n N. If 1 (1) lim u(p 1 n)u(p 2 n) = 0 for every p 1 p 2, x x (2) f (pm) = f (p)f (m) for all p and m N, then, 1 ( ) lim f (n)u(n) = 0. x x ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi Kátai : Let be a set of primes satisfying p 1/p = + and let f : N C and u : N C be two functions satisfying f (n) 1 and u(n) 1 n N. If 1 (1) lim u(p 1 n)u(p 2 n) = 0 for every p 1 p 2, x x (2) f (pm) = f (p)f (m) for all p and m N, then, 1 ( ) lim f (n)u(n) = 0. x x Remark. More is true. Let and u be as above. Then ( ) holds uniformly for every f satisfying the above condition (2) as well as the condition f (n) 1 for all n N. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi Let be a set of primes satisfying p x,p log p = τx + O(x/ log A x) for some positive τ and A. Further set N ( ) := {n N : p n = p } and N (x) := #{n x : n N ( )}. Let be such that p 1/p = +. We can prove the following. ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

IV. Remarks on a theorem of Hedi Daboussi Let be a set of primes satisfying p x,p log p = τx + O(x/ log A x) for some positive τ and A. Further set N ( ) := {n N : p n = p } and N (x) := #{n x : n N ( )}. Let be such that p 1/p = +. We can prove the following. Given f : N ( ) C satisfying f (pm) = f (p)f (m) p and m N ( ) and such that f (n) 1 n N ( ), then, for all functions u : N ( ) C such that u(n) 1 n N ( ) and such that 1 lim x x m x m N ( ) we have lim x 1 x u(p 1 m)u(p 2 m) = 0 for all p 1 p 2, n N ( ) ean-marie De Koninck and Imre Kátai Uniform distribution mod 1, f (n)u(n) = 0.

IV. Remarks on a theorem of Hedi Daboussi Open problem Is it true or not that, for every irrational number α, lim x 1 N (x) n N ( ) e(nα) = 0? ean-marie De Koninck and Imre Kátai Uniform distribution mod 1,

Food for thought... Thank you! katai@inf.elte.hu