Tilted Forum Project Discussion Community - View Single Post

Pragma · 02-03-2005, 10:04 PM

To check if a number is prime, you only need to check the numbers between 2 and sqrt(n) - saves some math time. Still, it'll be a hell of a lot of processing for large values of n.

Just a thought, might help some.

02-03-2005, 10:04 PM	#3 (permalink)
Pragma I am Winter Born Location: Alexandria, VA	To check if a number is prime, you only need to check the numbers between 2 and sqrt(n) - saves some math time. Still, it'll be a hell of a lot of processing for large values of n. Just a thought, might help some.