Our program made the following conjectures about , the difference in absolute value of the number of primes no more than x and the logarithmic integral bounded below by 2. It is a result of Koch (1901) that the Riemann Hypothesis is equivalent to the statement that for . So we thought it could be interesting to generate conjectures for this quantity. We got several. Here are 3 that we tested further.

Here digits10(x) is the number of digits in the base-10 representation of x, euler_phi(x) is the value of euler’s phi function, and previous_prime(x) is the largest prime lexx than x. These statements were tested for all integers x from 3 to 1,000,000. Of course, this doesn’t prove these conjectures. But they might imply the Riemann Hypothesis.