Optimizations in SIEVE OF ERASTHONES:Modular Arithmatic

can anyone please let me know the optimizations that can be made to sieve of erasthones so that it can be used to calculate prime numbers upto 1e6 or even 1e8 …suggest any kind of optimization…or if there is some other algo i.e. a better and efficient way to generate prime numbers…also if u could suggest optimizations using modular arithmatic i would be very helpful…pls help me codefolks…

1 Like

You should read Sieve Of Atkins . Though I could never understand the logic of its algo completely , its by far very fast than Sieve of Eranthones.

//