This is all about on efficiency of the program, the faster the better, something which python is bad at, so other languages are also accepted (in English that is)
The most basic way of doing this is by checking whether all numbers between 1 and p (the number we are gonna check whether prime or not) are not factors of p
This can be easily sped up by only checking numbers from to as factors,
Also prime numbers after and come as this too can be exploited
Are there are any more techniques to make this faster?
Make your own program and report the time it took for finding all prime numbers from to ( if faster than everyone else put up your program as well )
For python, if you want to calculate the time it takes for it do so, you will have to import the time module and use the function time
1 2 3 4 5 6