Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. For -bounded multiplicative functions put , and write for the logarithmic average over . 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 are -bounded multiplicative functions and one of them satisfies as for every Dirichlet character , then . Then for every odd . Under the same assumption, every completely multiplicative with odd takes the value at , and for some . The step from such functions to is unconditional: for odd , equals the supremum, over all completely multiplicative , of the least with , taken as when there is none.
Covers. The second question of Problem 436, whether is finite for every odd , answered yes conditionally on the assumption above, which is an open conjecture. Unconditionally the claim adds no case: is settled by the accepted Lehmer, Lehmer, Mills and Selfridge claim, and every odd remains open. No bound on 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 -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 , 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.