Basically its what the title says. It's a real simple program dealing with prime numbers, I don't know much about modular division though....
The user inputs a number and then the program checks to see if the number is PRIME. There is a looping statement to be included that uses modular division of the input number including all integers up to the sq. root of the input number.
Like I said, I don't know very much at all about modular division or using it to find PRIME numbers......the actual programming part I shouldn't have a problem with, but I just need a push on generally what the looping statement COULD look like.
The user inputs a number and then the program checks to see if the number is PRIME. There is a looping statement to be included that uses modular division of the input number including all integers up to the sq. root of the input number.
Like I said, I don't know very much at all about modular division or using it to find PRIME numbers......the actual programming part I shouldn't have a problem with, but I just need a push on generally what the looping statement COULD look like.
Facebook
Twitter