Next
1. Print Primes 1 to N2. Sum of Primes in Range3. Count Composite Numbers4. Twin Primes5. Goldbach Conjecture (Even as Sum of Two Primes)6. Prime Factors of Number7. Sum of Prime Factors8. Numbers with Prime Number of Factors9. Semi-Prime Numbers10. Prime Triplets

Print Primes 1 to N

Print all prime numbers from 1 to n.

IntermediatePhase 6 - Category 3: Loop & Conditional MixExample 1 of 10
print-primes-1-to-n.py
1# Helper function
2def is_prime(n):
3    if n < 2:
4        return False
5    for i in range(2, int(n ** 0.5) + 1):
6        if n % i == 0:
7            return False
8    return True
9

10# Take n
11n = int(input("Enter n: "))
12

13# Print primes
14print(f"Primes from 1 to {n}:")
15for num in range(1, n + 1):
16    if is_prime(num):
17        print(num, end=" ")
18print()

Output

Enter n: 20
Primes from 1 to 20:
2 3 5 7 11 13 17 19

What's going on

Loop through range and check each number.

Key Concepts:

Use helper function
Loop from 1 to n
Check and print primes

🔗Related Content

NextSum of Primes in Range