-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfunction_prime_number.py
More file actions
71 lines (55 loc) · 1.58 KB
/
function_prime_number.py
File metadata and controls
71 lines (55 loc) · 1.58 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
import math
#def prime_number():
#digit = input("Enter a number: ")
#number = int(digit)
#if number < 2:
#print("Try again. Number must be greater than 1.")
#return
#prime = False
#for i in range(2,number):
#print(i)
#print(number)
#if number %i == 0:
#prime = True
#break
#if prime == False:
#print(f"Congratulations, {number} is a prime number.")
#else:
# print(f"{number} is a composite number.")
#prime_number()
##math method code
#def prime_number():
#digit = input("Enter a number: ")
#number = int(digit)
#if number < 2:
#print("Try again. Number must be greater than 1.")
#prime = True
#for i in range(2,math.ceil(number/2)+1):
#print(i)
#print(number)
#if number % i == 0:
#prime = False
#break
#if prime:
#print(f"Congratulations, {number} is a prime number.")
#else:
#print(f"{number} is a composite number.")
#prime_number()
## time compliexity
def prime_number():
digit = input("Enter a number: ")
number = int(digit)
if number < 2:
print("Try again. Number must be greater than 1.")
prime = True
for i in range(2,math.isqrt(number)+1):
print(i)
print(number)
if number % i == 0:
prime = False
break
if prime:
print(f"Congratulations, {number} is a prime number.")
else:
print(f"{number} is a composite number.")
prime_number()