Skip to main content

Java program for prime numbers

A prime number is the number which is is  divisible by itself and not by other numbers.

A program to check prime number can be made by using for and while loop combination .

This article contains java program for finding prime number ,write a java program for prime number between 1- 100 ,simple program to find prime factorial of a number in java.

EXAMPLE 1 - program to check whether a number is prime number  or not.
import java.util.*;
public class pr
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("enter number");
int num=sc.nextInt();
int d=0;
for(int i=2;i<=num;i++)
{
if(num%i==0)
d++;
}
if(d==0)
System.out.println("it is a prime number");
else
System.out.println("it is not a prime number");
}
}

Output
enter number
23
it is a prime number


A prime factorial of a number is the products of all the prime numbers less than the number.


EXAMPLE 2 - program to get prime factorial of a number
import java.util.*;
public class primorial
{
public static void main()
{
Scanner sc=new Scanner(System.in);
System.out.println("enter a number");
int n=sc.nextInt();
int sum=1;
primorial m=new primorial();
for(int i=2;i<=n;i++)
{
if(m.checkPrime(i)==true)
{
sum=sum*i;
}
}
System.out.println("prime factorial of "+n+" is: "+sum);
}
boolean checkPrime(int a)
{
int d=0;
for(int i=2;i<a;i++)
{
if(a%i==0)
d++;
}
if(d==0)
return true;
else
return false;
}
}

Output
enter a number
23
prime factorial of 23 is : 111546435
EXAMPLE 3-java program to find prime 
numbers between 1 and 100
  

  import java.util.*;

Public class primecheck

{

    public static void main()

    {

        Scanner sc=new Scanner(System.in);

        System.out.println("prime numbers are:");

        primecheck m=new primecheck();

        for(int i=2;i<=100;i++)

        {

            if(m.checkPrime(i)==true)

            {

                System.out.println(i);

            }

        }

    }

    boolean checkPrime(int a)

    {

        int d=0;

        for(int i=2;i<a;i++)

        {

            if(a%i==0)

            d++;

        }

        if(d==0)

        return true;

        else

        return false;

    }

}

  

Output

  

  Prime number are:
3

5

7

11

13

17

19

23

29

31

37

41

43

47

53

59

61

67

71

73

79

83

89

97
 If you find this helpful please share
















Labels:





























Comments











Post a Comment



















Popular posts from this blog





















How to Learn whole syllabus of subject in 1 day? + some cool last minute tips




























Hi everyone,  In  this article I am going to tell you how to complete the whole syllabus for exam in one day. I will tell you a full one day plan to complete all your syllabus without having any doubt and also prepare for that subject. To follow this, firstly you have to divide the syllabus of your subjects into 3 parts-  The first part is for easy chapters second part is for moderate chapters and third parties for difficult chapters in easy chapters you have to put it at topics for which you can answer all the question.  In moderate you have to put that chapters in which you have very less doubt. In the difficult you have to put that topic whose questions you are not able to answer. HERE IS THE TEMPLATE FOR YOUR PLANNING- PLAN starting in the morning  Prepare a chart of the whole day time table. Begin your day at 8:00 a.m.  In the first three hours revise or learn all the chapters which are easy for you remember after every 50 minutes you have to take 10 minute break .once all the cha




















Post a Comment









Read more




























disarium number in java




























A number is said to be disarium if the sum of its digit powered with their positions is equal to the number itself. EXAMPLE- 135 = (1^1) + (3^2) + (5^3)                             = 1 + 9 + 125                             = 135 A simple java program to check disarium number can be made by firstly calculating the length of the number and then adding digits of the number raised to the power of its position in the number. ALGORITHM - STEP 1 : Start STEP 2 : print "enter a number" STEP 3 : taking input of integer in n STEP 4 : int l= Integer.toString().length() STEP 5 : int no=n STEP 6 : int s=0 STEP 7 : repeat STEP 8 to STEP 11 until (no!=0) STEP 8 : int d=no%10 STEP 9 : s=s+(int)(Math.pow(d,l) STEP 10 :no=no/10 STEP 11 : l-- STEP 12 : if  (s==n) then goto STEP 13 else goto STEP 14 STEP 13 : print "the number is disarium" STEP 14 : print "the number is not disarium" STEP 15 : end JAVA CODE- import java.util.*; public class disarium {     public static void m




















Post a Comment









Read more




























What is magic number in java ?




























A number is said to be magic number if the repetitive sum of digits of number is equal to 1 or a single digit number . If the repetitive sum ends up  as 1 then the number is a magic number, else not. For example- n= 289;.   2+8+9 = 19      19;.      1+9 = 10      10;.      1+0= 0       1 Since the number ends in 1, hence 289 is a magic number. Magic number in java is the java program to check whether a number is magic number or not . For this we do repetitive addition of the digits of the number till the number is a two or more digit number. If after repetitive adding digits of the number ends up to 1 then the loop stops and a message is displayed. For this program we need to extract digits of the number for this we use while loop and add this digit . Code snippet to get digits of the number -         while(n!=0)  {        int d = n%10;         s=s+d;        n=n/10;  }    ALGORITHM - STEP 1: start STEP 2: print "enter a number" STEP 3: taking input of integer in n STEP 4: rep




















Post a Comment









Read more