prime number using sieve of atkin
 

hi friends,i am kind of new to programming.i am writing a program to find the prime numbers.i came to know that sieve of atkin is the most efficient algo to find the prime numbers.i am finding difficult to understand it.can anyone please help me to understand it?
thanks in advance

Maybe if you tell us what you do not understand or where you are getting stuck we may be able to help?

Ultimately your question is vague to the point that it looks like you want to be taught the algorithm ... which is not going to happen. You need to do the ground work first.

i am not clear with the equations (4x2+y2,3x2+y2,3x2-y2) which are used in the program.i would be happy if anyone explains me how the equations are got

Maybe a better explanation after searching google: http://en.wikipedia.org/wiki/Sieve_of_Atkin