Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ ¹ ² ³ °
 

You are not logged in. Post a replyTopic review (newest first)
Hi y'all
Hi tangent;
The quickest way to know whether a number is prime aside from using the sieve of eratosthenes method is:
Hi, prime numbers are basically numbers which you can only divide 1 and itself into. E.G 7 is a prime number, 2 is a prime number you can decide easily if a number is prime by using a sieve of eratosthenes. (putting numbers on a grid and crossing off the even numbers and the ones that can be divided by other numbers) Remember though that 1 is not a prime and 2 is! Hope I helped a little bit.
Hi;
Are you saying divide X by all the squares between 2 and y? Or all the primes form 2  y? Which is just trial division.
by the way
That is what I can not give you. The fermat's method on the Wikipedia page is well known, the one you are asking about looks like it but I am not sure. It could be a modification of the standard fermats method, there are a couple of improvements. But I do not recognize it.
I knew it from someone .
Where did you get it?
hi bobbym
Hi;
I read one before that says .
