Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. For 11-bounded multiplicative functions put D(f,g;x)2=∑p≤x(1−Re⁡f(p)g(p)‾)/p\mathbb D(f,g;x)^2=\sum_{p\le x}(1-\operatorname{Re}f(p)\overline{g(p)})/p, and write En≤Xlog⁡\mathbb E^{\log}_{n\le X} for the logarithmic average over n≤Xn\le X. Assume the three-function case of the logarithmically averaged Elliott conjecture, in the form of Conjecture 1.3(ii) of Tao and Teräväinen's 2019 structure paper: if g1,g2,g3g_1,g_2,g_3 are 11-bounded multiplicative functions and one of them satisfies inf⁡∣t∣≤XD(gj,χ(n)nit;X)→∞\inf_{|t|\le X}\mathbb D(g_j,\chi(n)n^{it};X)\to\infty as X→∞X\to\infty for every Dirichlet character χ\chi, then En≤Xlog⁡g1(n)g2(n+1)g3(n+2)→0\mathbb E^{\log}_{n\le X}g_1(n)g_2(n+1)g_3(n+2)\to0. Then Λ(k,3)<∞\Lambda(k,3)<\infty for every odd kk. Under the same assumption, every completely multiplicative f:N→μkf:\mathbb N\to\mu_k with kk odd takes the value 11 at nn, n+1n+1 and n+2n+2 for some nn. The step from such functions to Λ(k,3)\Lambda(k,3) is unconditional: for odd kk, Λ(k,3)\Lambda(k,3) equals the supremum, over all completely multiplicative f:N→μkf:\mathbb N\to\mu_k, of the least nn with f(n)=f(n+1)=f(n+2)=1f(n)=f(n+1)=f(n+2)=1, taken as ∞\infty when there is none.

Covers. The second question of Problem 436, whether Λ(k,3)\Lambda(k,3) is finite for every odd kk, answered yes conditionally on the assumption above, which is an open conjecture. Unconditionally the claim adds no case: k=3k=3 is settled by the accepted Lehmer, Lehmer, Mills and Selfridge claim, and every odd k≥5k\ge5 remains open. No bound on Λ(k,3)\Lambda(k,3) is given, so the growth question is not addressed, nor is the first question.

Credit. The assumption is Tao and Teräväinen's conjecture, recorded with their 2019 structure paper. The proof uses the Chebotarev density theorem, the fixed-modulus Vinogradov–Korobov bound for Dirichlet LL-functions, the fixed-modulus prime number theorem in arithmetic progressions with Mertens' estimates, and the fundamental lemma of sieve theory, all at their published statements. The realization of prescribed character values at primes, the identity for Λ(k,3)\Lambda(k,3), the sieve argument for functions at bounded pretentious distance from a Dirichlet character, and the conditional deduction are Plasma AI's.

Standing. Author-recorded at tier 0, with no independent review and no executable evidence. The assumption is unproved, so the claim derives nothing for the problem's standing. Catalog acceptance is pending.

Depends on. The odd-order triple lead (tier 0), through Sections 1, 4 and 7 of its proof sketch.