Program to Print All Prime Numbers Between n and m using While loop
- Write a program to Print All Prime Numbers Between n and m using While loop in C
- Write a program to Print All Prime Numbers Between n and m using While loop in C++
- Write a program to Print All Prime Numbers Between n and m using While loop in Python
- Write a program to Print All Prime Numbers Between n and m using While loop in PHP
- Write a program to Print All Prime Numbers Between n and m using While loop in Java
- Write a program to Print All Prime Numbers Between n and m using While loop in Java Script
- Write a program to Print All Prime Numbers Between n and m using While loop in C#
Explanation:
Steps
- Input: Take the lower limit n and upper limit m.
- 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.
- 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 While loop
-
C
-
C++
-
Python
-
PHP
-
JAVA
-
Java Script
-
C#
#include <stdio.h> int main() { int n, m, num; printf("Enter the value of n: "); scanf("%d", &n); printf("Enter the value of m: "); scanf("%d", &m); printf("Prime numbers between %d and %d are: ", n, m); num = n; while (num <= m) { int isPrime = 1; for (int i = 2; i <= num / 2; i++) { if (num % i == 0) { isPrime = 0; break; } } if (isPrime && num > 1) { printf("%d ", num); } num++; } return 0; }
#include <iostream> using namespace std; int main() { int n, m, num; cout << "Enter the value of n: "; cin >> n; cout << "Enter the value of m: "; cin >> m; cout << "Prime numbers between " << n << " and " << m << " are: "; num = n; while (num <= m) { bool isPrime = true; for (int i = 2; i <= num / 2; i++) { if (num % i == 0) { isPrime = false; break; } } if (isPrime && num > 1) { cout << num << " "; } num++; } return 0; }
n = int(input("Enter the value of n: ")) m = int(input("Enter the value of m: ")) num = n print(f"Prime numbers between {n} and {m} are: ", end="") while num <= m: is_prime = True for i in range(2, num // 2 + 1): if num % i == 0: is_prime = False break if is_prime and num > 1: print(num, end=" ") num += 1
<?php $n = (int)readline("Enter the value of n: "); $m = (int)readline("Enter the value of m: "); $num = $n; echo "Prime numbers between $n and $m are: "; while ($num <= $m) { $isPrime = true; for ($i = 2; $i <= $num / 2; $i++) { if ($num % $i == 0) { $isPrime = false; break; } } if ($isPrime && $num > 1) { echo "$num "; } $num++; } ?>
import java.util.Scanner; public class PrimeNumbers { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.print("Enter the value of n: "); int n = sc.nextInt(); System.out.print("Enter the value of m: "); int m = sc.nextInt(); int num = n; System.out.print("Prime numbers between " + n + " and " + m + " are: "); while (num <= m) { boolean isPrime = true; for (int i = 2; i <= num / 2; i++) { if (num % i == 0) { isPrime = false; break; } } if (isPrime && num > 1) { System.out.print(num + " "); } num++; } sc.close(); } }
let n = parseInt(prompt("Enter the value of n: ")); let m = parseInt(prompt("Enter the value of m: ")); let num = n; console.log(`Prime numbers between ${n} and ${m} are:`); while (num <= m) { let isPrime = true; for (let i = 2; i <= num / 2; i++) { if (num % i === 0) { isPrime = false; break; } } if (isPrime && num > 1) { console.log(num); } num++; }
using System; class Program { static void Main() { Console.Write("Enter the value of n: "); int n = int.Parse(Console.ReadLine()); Console.Write("Enter the value of m: "); int m = int.Parse(Console.ReadLine()); int num = n; Console.Write("Prime numbers between " + n + " and " + m + " are: "); while (num <= m) { bool isPrime = true; for (int i = 2; i <= num / 2; i++) { if (num % i == 0) { isPrime = false; break; } } if (isPrime && num > 1) { Console.Write(num + " "); } num++; } } }