Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2012_03_25_kovic: Kovič (J. Integer Seq. 2012) proves that a two-cycle of the arithmetic derivative, which a solution of Problem 307 gives, is not two semiprimes, has both members at least 10^4, and has nine primes in an odd smaller member.
2026_06_13_bonfioli: An unrefereed, AI-assisted manuscript by Vico Bonfioli, first posted on 13 June 2026 with the 60-prime bound added on 2 July 2026, claiming that two sets of primes whose reciprocal sums multiply to one have at least 60 primes in all and products above 3.5 times 10^57.
Linked from (1)
Graph