prime factorization python
import math
def primeFactors(n):
# no of even divisibility
while n % 2 == 0:
print(2)
n = n / 2
# n reduces to become odd
for i in range(3, int(math.sqrt(n)) + 1, 2):
# while i divides n
while n % i == 0:
print(i)
n = n / i
# if n is a prime
if n > 2:
print(n)
primeFactors(256)determine if number is prime python
# 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"get prime number python
from num_tool import is_prime
print(is_prime(3))
#returns True because 3 is a primeprime number in python
import math
a=[i for i in range(2,int(input('prime number range'))) if 0 not in [i%n for n in range(2,int(math.sqrt(i)))]]
print(a)primes in python
from math import sqrt
for i in range(2, int(sqrt(num)) + 1):
if num % i == 0:
print("Not Prime")
break
print("Prime")
# Note: Use this if your num is big (ex. 10000 or bigger) for efficiency
# The result is still the same if the num is smallerprime number using python
# Prime number checker
def is_prime(num):
for i in range(2,num):
if (num % i) == 0:
return False
return True
num = int(input("Enter a number:"))
check_prime = is_prime(num)
if check_prime:
print("Your number is a prime")
else:
print("Your number is not a prime ")Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
