Claims

../

1987_12_01_schinzel_wirsing: Schinzel and Wirsing bound from below the number of multiplicatively independent partition numbers in a range, which gives F(n) >> log n.

1990_01_01_schinzel: Schinzel's argument, printed by Erdős and Ivić as their Lemma 2, that the number of distinct prime factors of p(1)...p(n) tends to infinity.

2000_01_01_ono: Ono proves that every prime divides some value of the partition function, so every prime eventually divides the product of the partition numbers.

---