GitHub - gameywinehouse/prime_checker: A for-loop is iterated from i = 2 to i < n/2 . If n is perfectly divisible by i , n is not a prime number. In this case, flag is set to 1, and the loop is terminated using the break statement.

gameywinehouse / prime_checker Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A for-loop is iterated from i = 2 to i < n/2 . If n is perfectly divisible by i , n is not a prime number. In this case, flag is set to 1, and the loop is terminated using the break statement.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
README.md		README.md
prime checker.py		prime checker.py

Repository files navigation

README_PrimeNumberChecker.md

About

A for-loop is iterated from i = 2 to i < n/2 . If n is perfectly divisible by i , n is not a prime number. In this case, flag is set to 1, and the loop is terminated using the break statement.

python calculator prime prime-numbers calculator-application calculator-python

Report repository

Releases

No releases published

Packages

No packages published

Languages

Python 100.0%