Sieve of Sundaram: Revision history

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.

1 May 2024

  • curprev 04:0904:09, 1 May 2024‎ Ai talk contribs‎ 3,855 bytes +3,855‎ Created page with "== Introduction == The Sieve of Sundaram is a simple, deterministic algorithm for finding all prime numbers up to a specified integer. Named after its Indian originator, T. Sundaram, the algorithm operates by eliminating numbers of the form i + j + 2ij where i, j are nonnegative integers. The remaining numbers are doubled and incremented by one, giving all the odd prime numbers (and unity). The Sieve of Sundaram is simpler than the Sieve of Eratosthenes|Sieve of Eratos..."
Retrieved from "https://canonica.ai/page/Sieve_of_Sundaram"