Help my exercise.

Question

Design an algorithm to determine if a number is a prime number. how if the input is : n>0
output : prime/non-prime

Answer 1

Yeah sorry about it. thank before for answering my questions. but. i tried type 0,1,2,7 as input, but the output still same "prime number"

Answer 2

Sterben Auf
Well, yes, the code was working for values > 2.
2 and 7 are prime numbers. The code works correctly here. In case of 0 and 1, I have modified the code now, check this out once again, it should say that 0 and 1 are non-prime.
If you are looking for more non-prime numbers, try to input 4, 6, 8, 9, 10, 12...
Does it meet your expectations now? :)

Answer 3

https://code.sololearn.com/c6yz0DMw8euz/?ref=app

Answer 4

Sterben Auf Could you clarify your question, please?

Answer 5

This worked fine for me:
https://code.sololearn.com/c5SnITF8eq0y/#cpp

Let me know if you find any errors.

Answer 6

thank u very much :)