-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathquestion15.py
More file actions
44 lines (32 loc) · 1.05 KB
/
question15.py
File metadata and controls
44 lines (32 loc) · 1.05 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
def question15():
# Part 1: Check single number for primality
num = int(input("Enter a number:"))
if num <= 1:
print(f"{num} is NOT a prime number")
elif num == 2:
print("2 is a PRIME number")
else:
is_prime = True
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
is_prime = False
break
if is_prime:
print(f"{num} is a PRIME number.")
else:
print(f"{num} is NOT a prime number.")
# Part 2: Find all primes in a given range
start = int(input("Enter start range:"))
end = int(input("Enter end range:"))
primes =[]
for n in range(max(2, start),end + 1):
is_prime = True
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
is_prime = False
break
if is_prime:
primes.append(str(n))
print("Prime numbers:", ", ".join(primes))
# Call the function
question15()