The Pólya conjecture (Pólya 1919) asserts that the Liouville summatory function is nonpositive at every integer . Let
be a positive integer
and
the number of (not necessarily distinct) prime factors
of
(with
).
Let
be the number of positive integers
with an odd number of prime factors, and
the number of positive
integers
with an even number of prime
factors. Their difference is
|
(1)
| |||
|
(2)
|
where
is the Liouville function.
The conjecture was disproven by Haselgrove (1958) using a method due to Ingham (1942). Lehman (1960) found the first explicit counterexample,
, and the smallest counterexample
was found by Tanaka (1980).
It begins a run of counterexamples through
(OEIS A189229).
The first
for which
are
,
4, 6, 10, 16, 26, 40, 96, 586, 906150256, 906150294, 906150308, 906150310, 906150314,
906151516, ... (Tanaka 1980, OEIS A028488).
The accompanying OEIS b-file records 317312 known zeros through
, and lists
. These are known zeros, and the table
does not establish completeness beyond the first 252 terms (Borwein et al. 2008).
The function
changes sign infinitely often (Haselgrove 1958, Borwein et al. 2008).
This Pólya conjecture is unrelated to the Hilbert-Pólya conjecture, which concerns a spectral interpretation of the zeros of the Riemann zeta function.