Is there a better way to find prime number to increase efficiency of old way?
Why in prime number’s problem other programmers divide that number by 2 and numbers increasingly to that number? It is possible to also just divide that number by 2,3,5,7 and check if that number is prime or not? Is there any flaw in it?
Is there a better way to find prime number to increase efficiency of old way? Here is my solution
Why in prime number’s problem other programmers divide that number by 2 and numbers increasingly to that number? It is possible to also just divide that number by 2,3,5,7 and check if that number is prime or not. What do you think? Please tell me if there is any flow in it?