CodeCrucks

CodeCrucks

Program to Print All Prime Numbers Between n and m using For loop

Program to Print All Prime Numbers Between n and m using For loop

by ·

  • Write a program to Print All Prime Numbers Between n and m using For loop in C
  • Write a program to Print All Prime Numbers Between n and m using For loop in C++
  • Write a program to Print All Prime Numbers Between n and m using For loop in Python
  • Write a program to Print All Prime Numbers Between n and m using For loop in PHP
  • Write a program to Print All Prime Numbers Between n and m using For loop in Java
  • Write a program to Print All Prime Numbers Between n and m using For loop in Java Script
  • Write a program to Print All Prime Numbers Between n and m using For loop in C#

Explanation:

Steps

  1. Input: Take the lower limit n and upper limit m.
  2. Prime number check:
    • A prime number is greater than 1 and divisible only by 1 and itself.
    • For each number i between n and m, check if it is prime:
      • Loop through numbers from 2 to sqrt(i) to see if any number divides i.
      • If no number divides i, it is prime.
  3. Print primes: Display all numbers identified as prime.

Explanation:

  • For n = 10 and m = 50:
  • Numbers between 10 and 50 are checked for primality.
  • Prime numbers in this range are printed: 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47.

Program to Print All Prime Numbers Between n and m using For loop

#include <stdio.h>

int is_prime(int num) {
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            return 0;  // Not prime
        }
    }
    return 1;  // Prime
}

int main() {
    int n, m;

    printf("Enter the range (n m): ");
    scanf("%d %d", &n, &m);

    printf("Prime numbers between %d and %d are:\n", n, m);

    for (int num = n; num <= m; num++) {
        if (is_prime(num)) {
            printf("%d ", num);
        }
    }

    return 0;
}

#include <iostream>
using namespace std;

bool is_prime(int num) {
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            return false;  // Not prime
        }
    }
    return true;  // Prime
}

int main() {
    int n, m;

    cout << "Enter the range (n m): ";
    cin >> n >> m;

    cout << "Prime numbers between " << n << " and " << m << " are:" << endl;

    for (int num = n; num <= m; num++) {
        if (is_prime(num)) {
            cout << num << " ";
        }
    }

    return 0;
}

def is_prime(num):
    for i in range(2, int(num ** 0.5) + 1):
        if num % i == 0:
            return False  # Not prime
    return True  # Prime

n, m = map(int, input("Enter the range (n m): ").split())

print(f"Prime numbers between {n} and {m} are:")

for num in range(n, m + 1):
    if is_prime(num):
        print(num, end=" ")


<?php
function is_prime($num) {
    for ($i = 2; $i * $i <= $num; $i++) {
        if ($num % $i == 0) {
            return false;  // Not prime
        }
    }
    return true;  // Prime
}

list($n, $m) = explode(" ", readline("Enter the range (n m): "));

echo "Prime numbers between $n and $m are:\n";

for ($num = $n; $num <= $m; $num++) {
    if (is_prime($num)) {
        echo "$num ";
    }
}
?>


import java.util.Scanner;

public class PrimeNumbers {
    public static boolean isPrime(int num) {
        for (int i = 2; i * i <= num; i++) {
            if (num % i == 0) {
                return false;  // Not prime
            }
        }
        return true;  // Prime
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Enter the range (n m): ");
        int n = scanner.nextInt();
        int m = scanner.nextInt();

        System.out.println("Prime numbers between " + n + " and " + m + " are:");

        for (int num = n; num <= m; num++) {
            if (isPrime(num)) {
                System.out.print(num + " ");
            }
        }

        scanner.close();
    }
}


function isPrime(num) {
    for (let i = 2; i * i <= num; i++) {
        if (num % i === 0) {
            return false;  // Not prime
        }
    }
    return true;  // Prime
}

let [n, m] = prompt("Enter the range (n m):").split(" ").map(Number);

console.log(`Prime numbers between ${n} and ${m} are:`);

for (let num = n; num <= m; num++) {
    if (isPrime(num)) {
        console.log(num);
    }
}


using System;

class Program {
    static bool IsPrime(int num) {
        for (int i = 2; i * i <= num; i++) {
            if (num % i == 0) {
                return false;  // Not prime
            }
        }
        return true;  // Prime
    }

    static void Main() {
        Console.Write("Enter the range (n m): ");
        string[] input = Console.ReadLine().Split();
        int n = int.Parse(input[0]);
        int m = int.Parse(input[1]);

        Console.WriteLine($"Prime numbers between {n} and {m} are:");

        for (int num = n; num <= m; num++) {
            if (IsPrime(num)) {
                Console.Write(num + " ");
            }
        }
    }
}

List of All Programs