Name: Ayushi Jain

Reg No.: 19BCE1576

Prof: Dr. Nachiyappan S

1) Program for a palindrome number.

class sample
{
public static void main(String args[])
{
System.out.print("Input a number: ");
int n = 121;
System.out.println(n);
int sum = 0, r;
int temp = n;
while(n>0)
{
r = n % 10;
sum = (sum*10)+r;
n = n/10;
}
if(temp==sum)
System.out.println("It is a Palindrome number.");
else
System.out.println("Not a palindrome");
}
}

OUTPUT:
Terminal:
Eclipse:
2) Check for ArmStrong Number
class sample
{
public static void main(String args[])
{
int c=0,a,temp;
int n=153;
System.out.println(n);
temp=n;
while(n>0)
{
a=n%10;
n=n/10;
c=c+(a*a*a);
}
if(temp==c)
System.out.println("armstrong number");
else
System.out.println("Not armstrong number");
}
}

OUTPUT:
Terminal:

Eclipse:
3) Print Palindrome series
class sample
{
public static void main(String args[])
{
int n1=0,n2=1,n3,i,count=10;
System.out.print(n1+" "+n2);
for(i=2;i<count;++i)
{
n3=n1+n2;
System.out.print(" "+n3);
n1=n2;
n2=n3;
}
}
}

OUTPUT:
Terminal:
Eclipse:

4) Prime Number
class sample
{
public static void main(String args[])
{
int i,m=0,flag=0;
int n=3;
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");
}
}
}
}

OUTPUT:
Terminal:
Eclipse:

5) Factorial of a number
class sample
{
public static void main(String args[])
{
int i,fact=1;
int number=5;
for(i=1;i<=number;i++){
fact=fact*i;
}
System.out.println("Factorial of "+number+" is: "+fact);
}
}

OUTPUT:
Terminal:

Eclipse: