[New post] How to check if a number is prime in Python?

Subash Chandran posted: "# Time Efficient Primality Check in Python def primeCheck(n): # 0, 1, even numbers greater than 2 are NOT PRIME if n==1 or n==0 or (n % 2 == 0 and n > 2): return "Not prime" else: # Not prime if divisable by anoth" New post on Poopcode How to check if a number is prime in Python? by Subash Chandran # Time Efficient Primality Check in Python def primeCheck(n): # 0, 1, even numbers greater than 2 are NOT PRIME if n==1 or n==0 or (n % 2 == 0 and n > 2): return "Not prime" else: # Not prime if divisable by another number less # or equal to the square root of itself. # n**(1/2) returns square root of n for i in range(3, int(n**(1/2))+1, 2): if n%i == 0: return "Not prime" return "Prime" Read more of this post Subash Chandran | October 17, 2021 at 3:13 pm | Tags: How to check if a number is prime in Python? | Categories: Snippets | URL: https://wp.me/pb9kQA-3PK Comment    See all comments Unsubscribe to no longer receive posts from Poopcode. Change your email settings at Manage Subscriptions. Trouble clicking? Copy and paste this URL into your browser: https://poopcode.com/how-to-check-if-a-number-is-prime-in-python/