Fermat primality test: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

3 June 2024

  • curprev 08:3208:32, 3 June 2024 imported>David Eppstein 7,774 bytes +7,774 →Flaw: This is WP:CALC. Reading MR, Erdos proves a bound n/exp(c log n logloglog n / loglog n), substantially smaller than n/log n for all c>1.
Retrieved from "https://en.wiki.beta.math.wmflabs.org/wiki/Fermat_primality_test"