I have also begonnen with the first of the two problems from the second chapter. I can generate all odd numbers, but I can't see the light to express in a algorithm to check if it is a prim number.
Any suggestion...???

Question

I have also begonnen with the first of the two problems from the second chapter. I can generate all odd numbers, but I can't see the light to express in a algorithm to check if it is a prim number.
Any suggestion...???

anonymous · Answer

How big are the numbers you want to test?

anonymous · Answer

Please post your attempt to check of the number is prime>

anonymous · Answer

Thanks for the reply:
 > 1 < 1000

anonymous · Answer

Can you post the code that checks if a number is prime?

anonymous · Answer

I don't have it...!

anonymous · Answer

Don't you want to try and code it yourself? I can give you the code to find a prime, but it won't do you any good!

Up to you though!

anonymous · Answer

Thank you very much, but like you reply, i want it to find it out by myself...:-)

anonymous · Answer

To give you a hint... use modulo!

anonymous · Answer

Again thanks...:-)

anonymous · Answer

Any time!