Write a program in Java to print all prime numbers between n and m. code example
Example 1: Java program to print prime numbers from 2 to n
import java.util.Scanner;
public class PrimeNumberFrom2Ton
{
public static void main(String[] args)
{
int loop, max;
System.out.print("Please enter highest (maximum) number: ");
Scanner sc = new Scanner(System.in);
max = sc.nextInt();
for(loop = 2; loop < max; ++loop)
{
if(findPrime(loop))
{
System.out.println(loop);
}
}
sc.close();
}
public static boolean findPrime(int number)
{
int a;
boolean boolPrime = true;
for(a = 2; a < number / 2; a++)
{
if(number%a == 0)
{
boolPrime = false;
break;
}
}
return boolPrime;
}
}
Example 2: Java program to print prime numbers in a given range
public class PrimeNumberRangeDemo
{
public static void main(String[] args)
{
int lowerRange = 10, higherRange = 50;
while(lowerRange < higherRange)
{
boolean flag = false;
for(int a = 2; a <= lowerRange / 2; ++a)
{
if(lowerRange % a == 0)
{
flag = true;
break;
}
}
if(!flag && lowerRange != 0 && lowerRange != 1)
System.out.print(lowerRange + " ");
++lowerRange;
}
}
}