Monotone nondecreasing sequences of the Euler totient function
In this interesting and very well written article, the author proves that, for all \(x \ge 10\), we have \N\[\N\pi(x) \le M(x) \le \Biggl( 1 + O \left( \frac{(\log \log x)^5}{\log x}\right) \Biggr) \pi(x),\N\]\Nwhere \(M(x)\) denotes the largest cardinality of a subset of \(\left\lbrace n \in \mathbb{Z}_{\ge 1} : n \le x \right\rbrace\) on which the Euler totient function \(\varphi(n)\) is nondecreasing. This answers a question of \textit{P. Erdős} [Resen. Inst. Mat. Estat. Univ. São Paulo 2, No. 2, 165--186 (1995; Zbl 0871.11002)]. As the author points it out, it is surmised that, for all \(x \ge 31957\), one has \(M(x) = \pi(x) + 64\), but this conjecture seems to be currently out of reach. A key part in the proof is played by the astonishing inequality \N\[\N\sum_{\substack{d \ge 1 \\\N\frac{\varphi(d)}{d}=q}} \frac{1}{d} \le 1\N\]\Nvalid for any positive rational number \(q\), with equality for \(q=1\) or \(q = \frac{1}{2}\). In the final section of the article, the author discusses about obstacles to improvement, possible conditional results, variants with other multiplicative functions, such as the sum-of-divisor function \(\sigma\) which is `close' to the Euler totient, or some open questions.
- A new extension of Dirichlet's theorem on prime numbers.
- Dense clusters of primes in subsets
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- scientific article; zbMATH DE number 3670537 (Why is no real title available?)
- scientific article; zbMATH DE number 4118426 (Why is no real title available?)
- scientific article; zbMATH DE number 898011 (Why is no real title available?)
- scientific article; zbMATH DE number 3064221 (Why is no real title available?)
- Joint Poisson distribution of prime factors in sets
- On the distribution of numbers of the form (n)/n and on some related questions
- On the distribution of primes in short intervals
- On the number of distinct values of Euler's φ-function
- On the order of magnitude of the difference between consecutive prime numbers.
- Popular values of Euler's function
- Reciprocal sums as a knowledge metric: theory, computation, and perfect numbers
- Remarks on number theory II. Some problems on the σ function
- Sets of monotonicity for Euler's totient function
- Shifted primes without large prime factors
- Solutions of \(\varphi(n)=\varphi(n+k)\) and \(\sigma(n)=\sigma(n+k)\)
- Some problems of Partitio numerorum. III: On the expression of a number as a sum of primes.
- The difference between consecutive primes. II
- The distribution of totients
- Variants of the Selberg sieve, and bounded intervals containing many primes
- WATT'S MEAN VALUE THEOREM AND CARMICHAEL NUMBERS
This page was built for publication: Monotone nondecreasing sequences of the Euler totient function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564023)
