Python Practice Questions Tutorial

Print First N Prime Numbers

❮ Previous Next ❯

A Python program to print the first N prime numbers efficiently.

Step-by-Step Explanation of the Code in Points:

1. Function is_prime(num):

Checks whether a given number num is a prime number.
If num < 2, returns False (since prime numbers start from 2).
Iterates from 2 to sqrt(num), checking divisibility.
If num is divisible by any number in this range, return False (not prime).
If no divisors are found, return True (num is prime).

2. Function print_n_primes(n):

Prints the first n prime numbers.
Initializes count = 0 (tracks the number of primes found).
Starts with num = 2 (first prime number).
Uses a while loop until count == n.

3. Inside the while Loop:

Call is_prime(num) to check if num is prime.
If num is prime:
- Prints num.
- Increments count.
Increments num to check the next number.

4. User Input and Execution:

Takes an integer n as input (number of primes to print).
Calls print_n_primes(n) to display the first n prime numbers.

Program:

def is_prime(num):

    if num < 2:

        return False  

    for i in range(2, int(num ** 0.5) + 1):

        if num % i == 0:

            return False  

    return True  



def print_n_primes(n):

    count, num = 0, 2  

    while count < n:

        if is_prime(num):

            print(num, end=" ")

            count += 1  

        num += 1  



n = int(input("Enter the number of prime numbers to print: "))  

print_n_primes(n)

❮ Previous Next ❯

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Python Coding Questions on Numbers

Python Coding Questions on String

Python Coding Questions On List

Python Coding Questions On Dictionary

Python Coding Questions On Star Pattern

Print First N Prime Numbers

Important Links