Java program to print prime numbers in a given range code example
Example 1: 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;
}
}
}
Example 2: 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 3: Java program to print prime numbers upto n
import java.util.Scanner;
public class PrimeNumberUptoN
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int a = 0;
int n = 0;
String strPrime = "";
System.out.println("Please enter the value of n: ");
int number = sc.nextInt();
for(a = 1; a <= number; a++)
{
int counter = 0;
for(n = a; n >= 1; n--)
{
if(a % n == 0)
{
counter = counter + 1;
}
}
if(counter == 2)
{
strPrime = strPrime + a + " ";
}
}
System.out.println("prime numbers upto n are: ");
System.out.println(strPrime);
sc.close();
}
}
Example 4: making list of prime numbers java
Now let’s see print first 10 prime numbers in java.
public class FirstTenPrimeNumbers
{
public static void main(String[] args)
{
int count = 0, number = 0, a = 1, b = 1;
while(number < 10)
{
b = 1;
count = 0;
while(b <= a)
{
if(a%b == 0)
count++;
b++;
}
if(count == 2)
{
System.out.printf("%d ", a);
number++;
}
a++;
}
}
}
Example 5: sum of prime numbers in a digit in java
import java.util.*;
public class PrimeDigit
{
public boolean IsPrime(int i)
{
boolean b=true;
int d=2;
while(d<i/2)
{
if (i%d==0)
{
b=false;
break;
}
d++;
}
return b;
}
public static void main(String []args)
{
Scanner sc=new Scanner(System.in);
System.out.print("Enter A Number : ");
int i=sc.nextInt();
int s=0,r;
PrimeDigit pd=new PrimeDigit();
while(i>0)
{
r=i%10;
if(pd.IsPrime(r))
{
s = s + r;
}
i = i / 10;
}
System.out.print("Sum Of The Prime Digits : " + s );
}
}
Example 6: java program to find prime number between 1 and 100
class PrimeNumbers
{
public static void main (String[] args)
{
int i =0;
int num =0;
String primeNumbers = "";
for (i = 1; i <= 100; i++)
{
int counter=0;
for(num =i; num>=1; num--)
{
if(i%num==0)
{
counter = counter + 1;
}
}
if (counter ==2)
{
primeNumbers = primeNumbers + i + " ";
}
}
System.out.println("Prime numbers from 1 to 100 are :");
System.out.println(primeNumbers);
}
}