Prime Number In Java Programming Language

Prime number is a number that is greater than 1 and divided by 1 or itself only. In other words, prime numbers can't be divided by other numbers than itself or 1. 

For example 2, 3, 5, 7, 11, 13, 17.... are the prime numbers.

Note: 0 and 1 are not prime numbers. The 2 is the only even prime number because all the other even numbers can be divided by 2.

Prime Number

public class PrimeExample
{    
   public static void main(String args[])
   {    
      int i,m=0,flag=0;      
      int n=3;//it is the number to be checked    
      m=n/2;      
      if(n==0||n==1)
      {  
       	System.out.println(n+" is not prime number");      
      }
      else
      {  
         for(i=2;i<=m;i++)
         {      
             if(n%i==0)
             {      
                   System.out.println(n+" is not prime number");      
           	   flag=1;      
           	   break;      
             }      
         }      
         if(flag==0)
         {
         	System.out.println(n+" is prime number"); 
         }  
      }//end of else  
    }    
}  

Fibonacci Series in Java Programing Language

 In fibonacci series, next number is the sum of previous two numbers for example 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 etc. The first two numbers of fibonacci series are 0 and 1.

Fibonacci Series 

   
class FibonacciExample1
{
  public static void main(String args[])
  {  
      int n1=0,n2=1,n3,i,len=10;  
      System.out.print(n1+" "+n2);//printing 0 and 1  

      for( i=2 ; i < len ; ++i )
      {  
        n3=n1+n2;  
        System.out.print(" "+n3);  
        n1=n2;  
        n2=n3;  
      }  
  }
}

Output : 

0 1 1 2 3 5 8 13 21 34
  

To Find Amstrong Number Using JAVA Programming Language

Armstrong number is a number that is equal to the sum of cubes of its digits. The following program is to check your number is Armstrong or Not in  JAVA Programming Language

Armstrong number 

   
    
import java.util.Scanner;

public class ArmstrongNumber

{

	public static void main(String[] args)

	{

		int originalNumber, remainder, result = 0, n = 0;

		System.out.println("Enter the Number :");

		Scanner s = new Scanner(System.in);

		int number = s.nextInt();

		originalNumber = number;

		for (; originalNumber != 0; originalNumber /= 10, ++n);

		originalNumber = number;

		for (; originalNumber != 0; originalNumber /= 10)

		{

			remainder = originalNumber % 10;

			result += Math.pow(remainder, n);

		}

		if (result == number)

			System.out.println(number + " is an Armstrong number.");

		else

			System.out.println(number + " is not an Armstrong number.");

	}

}