We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Read a number from console and check is prime number or not with a recursive function.
Example prime numbers: 2, 3, 5, 7, 11, 13, 17
Example : N : 23 Output : 23 is a prime number!
N : 32 Output : 32 is not a prime number..
N : 17 Output : 17 is a prime number!
Difficulty : 10/5
The text was updated successfully, but these errors were encountered:
Eta:1 hour
Sorry, something went wrong.
Ata: 35 minutes
HusnaSari
Successfully merging a pull request may close this issue.
Read a number from console and check is prime number or not with a recursive function.
Example prime numbers:
2, 3, 5, 7, 11, 13, 17
Example :
N : 23
Output : 23 is a prime number!
N : 32
Output : 32 is not a prime number..
N : 17
Output : 17 is a prime number!
Difficulty : 10/5
The text was updated successfully, but these errors were encountered: