NUMBER

PROGRAMS
Question
CHECK WHETHER THE GIVEN NUMBER IS ARMSTRONG NUMBER OR NOT.
(A POSITIVE NUMBER IS CALLED ARMSTRONG NUMBER IF SUM OF ITS OWN DIGITS EACH
RAISED TO THE POWER OF THE NUMBER OF DIGITS IS EQUAL TO NUMBER)

ENTER A NUMBER
8208
8^4+2^4+0^4+8^4=4096+16+0+4096
8208 IS AN ARMSTRONG NUMBER

ENTER A NUMBER
153
1^3+5^3+3^3=1+125+27=153
153 IS AN ARMSTRONG NUMBER
Answer

import java.util.Scanner;
public class Armstrong
{
public static void main(String[] args)
{
int c=0,r,temp=0,num=0,noOfDigits=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number");
num = sc.nextInt();
temp=num;
while(temp>0)
{
noOfDigits++;
temp=temp/10;
}
temp=num;
while(temp>0)
{
r=temp%10;
temp=temp/10;
c=c+(int)(Math.pow(r,noOfDigits));
}
if(num==c)
{
System.out.println(num+" is an armstrong number");
}
else
{
System.out.println(num+" is Not armstrong number");
}
}
}
Question
CHECK WHETHER THE GIVEN NUMBER IS ARMSTRONG NUMBER OR NOT IN A GIVEN RANGE.
A POSITIVE NUMBER IS CALLED ARMSTRONG NUMBER IF SUM OF ITS OWN DIGITS EACH RAISED
TO THE POWER OF THE NUMBER OF DIGITS IS EQUAL TO NUMBER

ENTER THE LOWER RANGE

1
ENTER THE UPPER RANGE
500
AMSTRONG NUMBERS:
1
2
3
4
5
6
7
8
9
153
370
371
407
Answer

import java.util.Scanner;
public class ArmstrongInRange
{
public static void main(String[] args)
{
int c=0,r,temp=0,noOfDigits=0,lowerRange=0,upperRange=0,i=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.println("Amstrong Numbers:");

for(i=lowerRange;i<=upperRange;i++)
{
c=0;
temp=i;
noOfDigits=Integer.toString(i).length();
while(temp>0)
{
r=temp%10;
temp=temp/10;
c=c+(int)(Math.pow(r,noOfDigits));
}
if(i==c)
{
System.out.println(i+" ");
}

}
}
}
Question
PRINT AVERAGE OF N NUMBERS.
Answer

import java.util.Scanner;
public class AverageOfNNUmbers
{
public static void main(String[] args)
{
int n, count = 1;
double x, average, sum = 0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the value of n");
n = sc.nextInt();
while (count <= n)
{
System.out.println("Enter the "+count+" number?");
x = sc.nextInt();
sum += x;
count=count+1;
}
average = sum/n;
System.out.println("The Average is"+averageF);
}
}
Question
PROGRAM TO CALCULATE THE AREA OF THE RECTANGLE.

ENTER A LENGTH
12
ENTER A BREADTH
15
AREA OF RECTANGLE=180.0
Answer

import java.util.Scanner;
public class areaOfrectangle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a length");
double len=sc.nextDouble();
System.out.println("Enter a breadth");
double breadth=sc.nextDouble();
/*Formula of area of rectangle =length of rectangle *breadth of rectangle*/
double area=len*breadth;
System.out.println("Area of rectangle="+area);
}
}
Question
PROGRAM TO CALCULATE THE SURFACE AREA OF THE SPHERE.
Answer

import java.util.Scanner;
public class surfaceAreaOfSphere
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter radius of circle");
double r=sc.nextDouble();
double pi=22/7;
/*Formula of surface area of sphere =4*pi* (radius of sphere)^2)*/
double area=4*pi*r*r;
System.out.println("surface Area of sphere="+area);
}
}
Question
CALCULATE THE AREA OF CIRCLE.

AREA OF CIRCLE=Π*RADIUS OF CIRCLE*RADIUS OF CIRCLE

Π=3.1415926535897.... TAKING PI UPTO 2 DECIMAL PLACES
RADIUS OF CIRCLE=10CM
THEN,
AREA OF CIRCLE==3.14*10*10=314SQ CM

ENTER THE RADIUS OF CIRCLE

12
AREA OF CIRCLE=452.15999999999997
Answer

import java.util.Scanner;
public class areaOfCircle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the radius of circle");
double r=sc.nextDouble();
//pi=3.1415926535897.... taking pi upto 2 decimal places
double pi=3.14;
/*Formula of area of circle =pi*r*r */
double area=pi*r*r;
System.out.println("Area of circle="+area);
}
}
Question
CHECK WHETHER THE NUMBER IS EVEN OR ODD NUMBER.

EXAMPLE 1:
ENTER AN INTEGER NUMBER:
12
ENTERED NUMBER IS EVEN
EXAMPLE 2:
ENTER AN INTEGER NUMBER:
13
ENTERED NUMBER IS ODD
Answer

import java.util.Scanner;
public class EvenOdd
{
public static void main(String args[])
{
int num;
System.out.println("Enter an Integer number:");

/*The input provided by user is stored in num*/

Scanner input = new Scanner(System.in);
num = input.nextInt();

/* If number is divisible by 2 then it's an even number else odd number */

if ( num % 2 == 0 )
System.out.println("Entered number is even");
else
System.out.println("Entered number is odd");
}
}
Question
PROGRAM TO FIND THE AREA OF THE PARALLELOGRAM.
Answer

import java.util.Scanner;
public class areaOfParellogram
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the base of Parellogram");
double base=sc.nextDouble();
System.out.println("Enter the height of Parellogram");
double height=sc.nextDouble();
/*area of Parellogram=base of Parellogram*height of Parellogram*/
double area=base*height;
System.out.println("Area of the Parellogram="+area);
}
}
Question
PROGRAM TO FIND THE AREA OF A REGULAR PENTAGON.
Answer

import java.util.Scanner;
public class areaOfRegularPentagon
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the apothem length of regular pentagon");
double a=sc.nextDouble();
System.out.println("Enter the length of one side of regular pentagon");
double s=sc.nextDouble();
/*area of regular pentagon=(5*length of one side of regular pentagon*apothem
length)/2*/
double area=(float)(5.0/2.0)*s*a;
System.out.println("Area of the pentagon="+area);
}
}
Question
PROGRAM TO CALCULATE THE AREA OF THE SQUARE.

LETS ASSUME, LENGTH OF ONE SIDE OF SQUARE IS 10.THEN,

AREA OF SQUARE=LENGTH OF ONE SIDE OF SQUARE*LENGTH OF ONE SIDE OF SQUARE
AREA OF SQUARE=10*10=100

ENTER LENGTH OF SQUARE

12
AREA OF SQUARE=144.0
Answer

import java.util.Scanner;
public class areaOfSquare
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter length of square");
double len=sc.nextDouble();

/*Formula of area of square =length of square ^ 2 or(length of square * length of

square )*/
double area=len*len;
System.out.println("Area of square="+area);
}
}
Question
CALCULATE THE AREA OF TRIANGLE.

AREA OF TRIANGLE =1/2X BASE X HEIGHT

OUTPUT:
ENTER BASE OF TRIANGLE
12
ENTER HEIGHT OF TRIANGLE
10
AREA OF TRIANGLE=60.0
Answer

import java.util.Scanner;
public class areaOfTriangle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter base of triangle");
double base=sc.nextDouble();
System.out.println("Enter height of triangle");
double height=sc.nextDouble();
/*Formula of area of triangle =(1/2)*base of triangle *height of triangle*/
double area=0.5*base*height;
System.out.println("Area of triangle="+area);
}
}
Question
CALCULATE THE VOLUME OF CONE.
Answer

import java.util.Scanner;
public class volumeOfCone
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter radius of sphere");
double radius=sc.nextDouble();
System.out.println("Enter height of sphere");
double height=sc.nextDouble();
double pie=22/7;
double volume=pie*(radius*radius)*height/3;
System.out.println("Volume of the cone="+volume);
}
}
Question
PROGRAM TO CONVERT CELSIUS TO FAHRENHEIT
Answer

import java.util.Scanner;
public class celsiusToFahrenheit
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter Celsius value");
double celsius=sc.nextDouble();
/* fahrenheit = ((celsius*9)/5)+32 */
double f=((celsius*9)/5)+32;
System.out.println("fahrenheit value="+f);
}
}
Question
CHECK WHETHER THE NUMBER IS BOUNCY NUMBER OR NOT USING ONLY MAIN METHOD.
BOUNCY NUMBER IS ONE IN WHICH A NON-NEGATIVE INTEGER IS NEITHER AN INCREASING
NUMBER NOR A DECREASING NUMBER.
AN INCREASING NUMBER IS A NON-NEGATIVE INTEGER IN WHICH THE DIGITS FROM LEFT TO
RIGHT ARE ARRANGED IN SUCH A WAY THAT NO DIGIT ON THE LEFT IS GREATER THAN THE
DIGIT TO ITS RIGHT. FOR EXAMPLE, 1223
A DECREASING NUMBER IS A NON-NEGATIVE INTEGER IN WHICH THE DIGITS FROM LEFT TO
RIGHT ARE ARRANGED IN SUCH A WAY THAT NO DIGIT ON THE LEFT IS SMALLER THAN THE
DIGIT TO ITS RIGHT. FOR EXAMPLE , 3221

ENTER THE NUMBER

1231
1231 IS A BOUNCY NUMBER
HERE 1231 IS NEITHER INCREASING NUMBER NOR DECREASING NUMBER SO IT IS A BOUNCY
NUMBER.
Answer

import java.util.Scanner;
public class BouncyNumber
{
public static void main()
{
int num=0,temp=0,last=0,digit=0;
boolean isIncreasing=true,isDecreasing=true;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
num=sc.nextInt();
//Checking of number being negative is not required
//as it will not enter in while loop if number is negative integer
temp=num;

last=temp%10;
//This while loop is to check if the number is increasing number
while(temp>0)
{
temp=temp/10;
digit=temp%10;
if(last0)
{
isIncreasing=false;
break;
}
last=digit;
}

temp=num;
last=temp%10;
//This while loop is to check if the number is decreasing number
while(temp>0)
{
 temp=temp/10;
digit=temp%10;
if(last>digit && temp>0)
{
isDecreasing=false;
break;
}
last=digit;
}
if(isDecreasing==false && isIncreasing==false)
{
System.out.println(num+" is a Bouncy Number");
}
else
{
System.out.println(num+" is not a Bouncy Number");
}
}
}
Question
PROGRAM TO CHECK WHETHER A GIVEN NUMBER IS A KAPREKAR NUMBER.
(A KAPREKAR NUMBER IS A NUMBER WHOSE SQUARE WHEN DIVIDED INTO TWO PARTS AND
SUCH THAT SUM OF PARTS IS EQUAL TO THE ORIGINAL NUMBER AND NONE OF THE PARTS HAS
VALUE 0.)

ENTER A NUMBER: 45
45 IS A KAPREKAR NUMBER
45*45 = 2025 AND 20 + 25 IS 45

ENTER A NUMBER: 10
10 IS NOT A KAPREKAR NUMBER
10*10 = 100. IT IS NOT A KAPREKAR NUMBER EVEN IF
SUM OF 100 + 0 IS 100 BECAUSE NONE OF THE PARTS SHOULD HAVE VALUE 0.
Answer

import java.util.Scanner;
public class kaprekarNumber
{
public static void main()
{

int num=0,len=0,sum=0,firstPart=0,secondPart=0;
String sq="";
Scanner sc=new Scanner(System.in);
System.out.print("ENTER A NUMBER:");
num=sc.nextInt();
if(num<=3)
{
if(num==1)
{
System.out.println(num+" IS A KAPERKAR NUMBER");
}
else
{
System.out.println(num+" IS NOT A KAPREKAR NUMBER");
}
}
else
{
sq=Integer.toString((num*num));
len=sq.length();

firstPart=Integer.parseInt(sq.substring(0,(len/2)));
secondPart=Integer.parseInt(sq.substring((len/2),len));
sum=firstPart+secondPart;

if(sum==num &&(firstPart!=0)&&(secondPart!=0))
{
System.out.println(num+" IS A KAPERKAR NUMBER");

}
 }
else
{
System.out.println(num+" IS NOT A KAPREKAR NUMBER");
}
}

}
}
Question
CHECK WHETHER A NUMBER IS KAPREKAR NUMBER WITHOUT USING STRING.
(A KAPREKAR NUMBER IS A NUMBER WHOSE SQUARE WHEN DIVIDED INTO TWO PARTS AND
SUCH THAT SUM OF PARTS IS EQUAL TO THE ORIGINAL NUMBER AND NONE OF THE PARTS HAS
VALUE 0.)

ENTER A NUMBER: 45
45 IS A KAPREKAR NUMBER
45*45 = 2025 AND 20 + 25 IS 45

ENTER A NUMBER:99
99 IS A KAPREKAR NUMBER
Answer

import java.util.Scanner;
public class kaprekarNumber
{
public static void main()
{
int num=0;
long count=0,sq=0,sum=0,firstPart=0,secondPart=0,temp=0;
Scanner sc=new Scanner(System.in);
System.out.print("ENTER A NUMBER:");
num=sc.nextInt();
if(num>0)
{
count=0;
sq=num*num;
temp=sq;
while(temp>0)
{
count++;
temp=temp/10;
}
temp=sq;
firstPart=temp% (long)Math.pow(10,count-count/2);
secondPart=temp/(long)Math.pow(10,count-count/2);
sum=firstPart+secondPart;
if((sum==num &&(firstPart!=0)&&(secondPart!=0))||num==1)
{
System.out.print(num+" is a kaprekar number");
}
else
{
System.out.print(num+" is not a kaprekar number");
}
}
}
}
Question
CHECK WHETHER A NUMBER IS KEITH NUMBER.
A NUMBER IS CALLED KEITH NUMBER IF IT APPEARS IN A SPECIAL SEQUENCE (DEFINED BELOW)
GENERATED USING ITS DIGITS. THE SPECIAL SEQUENCE HAS FIRST N TERMS AS DIGITS OF
NUMBER AND OTHER TERMS ARE RECURSIVELY EVALUATED AS SUM OF PREVIOUS N TERMS

ENTER A NUMBER:
197
197 IS A KEITH NUMBER

197 HAS 3 DIGITS, SO N = 3

THE NUMBER IS KEITH BECAUSE IT APPEARS IN THE SPECIAL
SEQUENCE THAT HAS FIRST THREE TERMS AS 1, 9, 7 AND
REMAINING TERMS EVALUATED USING SUM OF PREVIOUS 3 TERMS.
1, 9, 7, 17, 33, 57, 107, 197, .....
Answer

import java.util.Scanner;

public class keithNumber

{
public static void main()
{
int digits[];
int num=0,count=0,i=0,temp=0,sum=0;
Scanner sc=new Scanner(System.in);
System.out.println("ENTER THE NUMBER");
num=sc.nextInt();
temp=num;
while(temp>0)
{
count++;
temp=temp/10;
}
digits=new int[count];
System.out.println(count);
temp=num;
while(temp>0)
{
digits[count-1]=temp%10;
temp/=10;
count--;
}

while(sum< num)
{
sum=0;
for(i=0;i< digits.length;i++)
{
sum=sum+digits[i];

}
 for(i=0;i< digits.length-1;i++)
{
digits[i]=digits[i+1];
}
digits[digits.length-1]=sum;

if(sum==num)
{
System.out.println(num+" is keith number");
}
else
{
System.out.println(num+" is not a keith number");
}
}
}
Question
CHECK WHETHER A NUMBER IS PRIME ADAM NUMBER OR NOT.
(PRIME ADAM NUMBER IS A PRIME NUMBER WHOSE SQUARE OF THE NUMBER AND THE SQUARE
OF THE REVERSED NUMBER SHOULD BE REVERSE TO EACH OTHER)

ENTER THE NUMBER:

13
13 IS A PRIME NUMBER
SQUARE OF 13 IS :169
REVERSE OF 13 IS :31
SQUARE OF REVERSE OF NUMBER(31) IS :961
REVERSE OF 961 IS :169
SQUARE OF NUMBER IS EQUAL TO REVERSE OF SQUARE OF REVERSED NUMBER THEREFORE,
13 IS AN ADAM NUMBER

ENTER THE NUMBER:

19
19 IS A PRIME NUMBER
SQUARE OF 19 IS :361
REVERSE OF 19 IS :91
SQUARE OF REVERSE OF NUMBER(91) IS :8281
REVERSE OF 8281 IS :1828
SQUARE OF NUMBER IS NOT EQUAL TO REVERSE OF SQUARE OF REVERSED NUMBER THEREFORE,
19 IS NOT AN ADAM NUMBER
Answer

import java.util.Scanner;
public class PrimeAdamNumber
{
public static void main()
{
int temp=0,rem=0,i=0;
boolean isPrime=true;
int num,squareOfNum=0,reverseOfNum=0,squareOfReverseOfNum=0;
int reverseOfSquaredReverseNumber=0;
//num variable will store the number which we will take from user
//squareOfNum variable will store the square of variable num
//reverseOfNum variable will store the reverse of the number
//squareOfReverseOfNum will store square of reverseOfNum variable
// and reverseOfSquaredReverseNumber will store the reverse of variable
squareOfReverseOfNum

Scanner sc=new Scanner(System.in);

System.out.println("Enter the number:");
num=sc.nextInt();
temp=num;
if(num<=1)
{
System.out.println(num+" IS NOT A PRIME NUMBER,THEREFORE IT IS NOT PRIME ADAM
NUMBER");
}
else
{
//Checking if given number is Prime number or not
for(i=2;i< num;i++)
{
if(num%i==0)
{
System.out.println("GIVEN NUMBER IS NOT A PRIME NUMBER,THEREFORE IT IS
NOT PRIME ADAM NUMBER");
isPrime=false;
break;
 }
}
if(isPrime==true)
{
temp=num;
//Finding the reverse of number
while(temp>0)
{
rem=temp%10;
reverseOfNum=reverseOfNum*10+rem;
temp=temp/10;
}
squareOfNum=num*num;
squareOfReverseOfNum=reverseOfNum*reverseOfNum;
temp=squareOfReverseOfNum;
//Finding the reverse of square of reversed number
while(temp>0)
{
rem=temp%10;
reverseOfSquaredReverseNumber=reverseOfSquaredReverseNumber*10+rem;
temp=temp/10;
}

if(reverseOfSquaredReverseNumber==squareOfNum)
{
//the first six lines in this if condition can be removed
//it is only for making it easier to understand
System.out.println(num+" IS A PRIME NUMBER");
System.out.println("SQUARE OF "+num+" IS :"+squareOfNum);
System.out.println("REVERSE OF "+num+" IS :"+reverseOfNum);
System.out.println("SQUARE OF REVERSE OF NUMBER("+reverseOfNum+") IS
:"+squareOfReverseOfNum);
System.out.println("REVERSE OF "+squareOfReverseOfNum+" IS
:"+reverseOfSquaredReverseNumber);
System.out.println("SQUARE OF NUMBER IS EQUAL TO REVERSE OF SQUARE OF
REVERSED NUMBER THEREFORE,");
 System.out.println(num+" IS AN ADAM NUMBER");
}
else
{
//the first six lines in this else condition can be removed
//it is only for making it easier to understand
System.out.println(num+" IS A PRIME NUMBER");
System.out.println("SQUARE OF "+num+" IS :"+squareOfNum);
System.out.println("REVERSE OF "+num+" IS :"+reverseOfNum);
System.out.println("SQUARE OF REVERSE OF NUMBER("+reverseOfNum+") IS
:"+squareOfReverseOfNum);
System.out.println("REVERSE OF "+squareOfReverseOfNum+" IS
:"+reverseOfSquaredReverseNumber);
System.out.println("SQUARE OF NUMBER IS NOT EQUAL TO REVERSE OF SQUARE
OF REVERSED NUMBER THEREFORE,");
System.out.println(num+" IS NOT AN ADAM NUMBER");
}
}

}
}
}
 }
}
if(isPrime==true)
{
temp=num;
//Finding the reverse of number
while(temp>0)
{
rem=temp%10;
reverseOfNum=reverseOfNum*10+rem;
temp=temp/10;
}
squareOfNum=num*num;
squareOfReverseOfNum=reverseOfNum*reverseOfNum;
temp=squareOfReverseOfNum;
//Finding the reverse of square of reversed number
while(temp>0)
{
rem=temp%10;
reverseOfSquaredReverseNumber=reverseOfSquaredReverseNumber*10+rem;
temp=temp/10;
}

if(reverseOfSquaredReverseNumber==squareOfNum)
{
//the first six lines in this if condition can be removed
//it is only for making it easier to understand
System.out.println(num+" IS A PRIME NUMBER");
System.out.println("SQUARE OF "+num+" IS :"+squareOfNum);
System.out.println("REVERSE OF "+num+" IS :"+reverseOfNum);
System.out.println("SQUARE OF REVERSE OF NUMBER("+reverseOfNum+") IS
:"+squareOfReverseOfNum);
System.out.println("REVERSE OF "+squareOfReverseOfNum+" IS
:"+reverseOfSquaredReverseNumber);
System.out.println("SQUARE OF NUMBER IS EQUAL TO REVERSE OF SQUARE OF
REVERSED NUMBER THEREFORE,");
Question
PROGRAM TO CHECK WHETHER A GIVEN NUMBER IS A SMITH NUMBER ONLY USING MAIN
METHOD.
(A SMITH NUMBER IS A COMPOSITE NUMBER WHOSE SUM OF DIGITS IS EQUAL TO THE SUM OF
DIGITS IN ITS PRIME FACTORIZATION)

ENTER A NUMBER:4
4 IS A SMITH NUMBER
PRIME FACTORIZATION = 2, 2 AND 2 + 2 = 4
THEREFORE, 4 IS A SMITH NUMBER

ENTER A NUMBER:666
666 IS A SMITH NUMBER
PRIME FACTORIZATION = 2, 3, 3, 37 AND
2 + 3 + 3 + (3 + 7) = 6 + 6 + 6 = 18
THEREFORE, 666 IS A SMITH NUMBER
Answer

import java.util.Scanner;
public class SmithNumber
{

public static void main()

{
int sumd=0,sump=0,n=0,i=0,j=0,temp=0,temp1=0,flag=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter a number");
n=sc.nextInt();
temp=n;
while(temp>0)
{
sumd=sumd+(temp%10);
temp=temp/10;
}
temp=n;
for(i=2;i<=n/2;i++)
{
while(temp%i==0)
{

flag=0;
//checking whether number is prime number or not
for(j=2;j< i;j++)
{

if(i%j==0)
{
flag=1;
break;
}
}
 //if number is prime then only it is added to sump
if(flag==0)
{
temp1=i;
//Extracting digits if i >9 and then adding extracted digits to sump
while(temp1>0)
{
sump=sump+(temp1%10);
temp1=temp1/10;
}
temp=temp/i;

}
}

if(sumd==sump && n>0)

{
System.out.println(n+" IS A SMITH NUMBER");
}
else
{
System.out.println(n+" IS NOT A SMITH NUMBER");
}
}
}
Question
CHECK WHETHER TWO NUMBERS ARE TWIN PRIME NUMBERS OR NOT

(TWIN PRIMES ARE THE PRIME NUMBERS WITH A DIFFERENCE OF 2.)

EXAMPLE: (3 AND 5),(5 AND 7),(11 AND 13) ETC

ENTER THE FIRST NUMBER:5

ENTER THE SECOND NUMBER:7
5 AND 7 ARE TWIN PRIME NUMBER
Answer

import java.util.Scanner;
public class TwinPrime
{
public static boolean isPrime(int num)
{
int i=0;
if(num>1)
{
for(i=2;i< num;i++)
{
if(num%i==0)
{
return false;
}
}
return true;
}
else
{
return false;
}
}

public static void main()

{
int firstNumber=0,secondNumber=0,difference=0;
boolean isFirstNumberPrime=false,isSecondNumberPrime=false;
Scanner sc=new Scanner(System.in);
System.out.println("ENTER FIRST NUMBER:");
firstNumber=sc.nextInt();
System.out.println("ENTER SECOND NUMBER:");
secondNumber=sc.nextInt();
isFirstNumberPrime=isPrime(firstNumber);
isSecondNumberPrime=isPrime(secondNumber);
 difference=Math.abs(firstNumber-secondNumber);
// checking if the difference between two numbers is equal to 2
// else both the number is not twin prime numbers
if(difference==2)
{
if(isFirstNumberPrime==false || isSecondNumberPrime==false)
{
System.out.println(firstNumber+" AND "+secondNumber+" ARE NOT TWIN PRIME
NUMBERS");

}
else
{
System.out.println(firstNumber+" AND "+secondNumber+" ARE TWIN PRIME
NUMBERS");
}
}
else
{
System.out.println(firstNumber+" AND "+secondNumber+" ARE NOT TWIN PRIME
NUMBERS");
}
}
}
Question
CHECK WHETHER THE GIVEN NUMBER IS TWISTED PRIME USING RECURSION.
(A NUMBER IS CALLED A TWISTED PRIME NUMBER IF IT IS A PRIME NUMBER AND THE REVERSE
OF THIS NUMBER IS ALSO A PRIME NUMBER.)

FOR EXAMPLE,LET'S SAY 13 IS THE GIVEN NUMBER THEN AS 13 IS PRIME NUMBER AND REVERSE
OF 13 IS 31 WHICH IS ALSO PRIME NUMBER THEREFORE,
13 IS A TWISTED PRIME NUMBER
Answer

import java.util.Scanner;
public class twistedPrimeUsingRecursion
{
public static boolean isPrime(int n,int i)
{
if(n<=1)
{
return false;
}
else if(n==i)
{
return true;
}
else if(n%i==0)
{
return false;
}
else
{
return isPrime(n,i+1);
}
}

public static int reverseOfNumber(int n,int reverse)

{
if(n==0)
{
return reverse;
}
else
{
reverse=reverse*10+(n%10);
return reverseOfNumber(n/10,reverse);
}
}
 public static void main(String[] args)
{
int number=0,reversedNumber=0;

Scanner sc=new Scanner(System.in);

System.out.println("ENTER A NUMBER:");
number=sc.nextInt();
if(number<0)
{
System.out.println(number+" IS NOT A TWISTED PRIME NUMBER");
}
else
{
if(isPrime(number,2)==true)
{
reversedNumber=reverseOfNumber(number,0);
if(isPrime(reversedNumber,2)==true)
{
System.out.println(number+" IS A TWISTED PRIME NUMBER");
}
else
{
System.out.println(number+" IS NOT A TWISTED PRIME NUMBER");
}
}
else
{
System.out.println(number+" IS NOT A TWISTED PRIME NUMBER");
}
}

}
}
Question
PROGRAM TO CHECK WHETHER A GIVEN NUMBER IS A SMITH NUMBER.
(A SMITH NUMBER IS A COMPOSITE NUMBER WHOSE SUM OF DIGITS IS EQUAL TO THE SUM OF
DIGITS IN ITS PRIME FACTORIZATION)

ENTER A NUMBER:4
4 IS A SMITH NUMBER
PRIME FACTORIZATION = 2, 2 AND 2 + 2 = 4
THEREFORE, 4 IS A SMITH NUMBER

ENTER A NUMBER:666
666 IS A SMITH NUMBER
PRIME FACTORIZATION = 2, 3, 3, 37 AND
2 + 3 + 3 + (3 + 7) = 6 + 6 + 6 = 18
THEREFORE, 666 IS A SMITH NUMBER
Answer

import java.util.Scanner;
public class SmithNumber
{
public static boolean isPrime(int number)
{
int j=0;
for(j=2;j<=(number/2);j++)
{

if(number%j==0)
{
return false;
}
}
return true;

public static void main()

{
int sumd=0,sump=0,n=0,i=0,temp=0,temp1=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter a number");
n=sc.nextInt();
temp=n;
while(temp>0)
{
sumd=sumd+(temp%10);
temp=temp/10;
}
temp=n;
for(i=2;i<=n/2;i++)
{
 while(temp%i==0)
{
if(i<4)
{
sump=sump+i;
temp=temp/i;

}
else
{
if(isPrime(i)==true)
{
temp1=i;
while(temp1>0)
{
sump=sump+(temp1%10);
temp1=temp1/10;
}
temp=temp/i;

}
}
}
if(sumd==sump)
{
System.out.println(n+" IS A SMITH NUMBER");
}
else
{
System.out.println(n+" IS NOT A SMITH NUMBER");
}
}
}
Question
PROGRAM TO DETERMINE WHETHER A GIVEN NUMBER IS A DISARIUM NUMBER.
(A NUMBER IS SAID TO BE THE DISARIUM NUMBER WHEN THE SUM OF ITS DIGIT RAISED TO THE
POWER OF THEIR RESPECTIVE POSITIONS IS EQUAL TO THE NUMBER ITSELF.)
11 + 72 + 53 = 1 + 49 + 125 = 175

ENTER A NUMBER
135
135 IS A DISARIUM NUMBER
Answer

import java.util.Scanner;
public class DisariumNumber
{
public static void main(String[] args)
{
int num = 0, sum = 0, rem = 0, temp=0,len=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number");
num=sc.nextInt();
temp = num;
// To find the length of the number
while(temp>0)
{
len= len + 1;
temp= temp/10;
}

/*Makes a copy of the original number num*/

temp = num;

/*Calculates the sum of digits powered with their respective position */

while(temp > 0)
{
rem = temp%10;
sum = sum + (int)Math.pow(rem,len);
temp = temp/10;
len--;
}

/*Checks whether the sum is equal to the number itself */

if(sum == num)
{
System.out.println(num + " is a disarium number");
}
\ else
{
System.out.println(num + " is not a disarium number");
}
}
}
Question
PROGRAM TO DETERMINE WHETHER A GIVEN NUMBER IS A DISARIUM NUMBER IN A GIVEN
RANGE.
(A NUMBER IS SAID TO BE THE DISARIUM NUMBER WHEN THE SUM OF ITS DIGIT RAISED TO THE
POWER OF THEIR RESPECTIVE POSITIONS IS EQUAL TO THE NUMBER ITSELF.)

ENTER THE LOWER RANGE

1
ENTER THE UPPER RANGE
500
DISARIUM NUMBERS:1 2 3 4 5 6 7 8 9 89 135 175
Answer

import java.util.Scanner;
public class disariumNumberInRange
{
public static void main(String[] args)
{
int sum = 0, rem = 0, temp=0,i=0,upperRange=0,lowerRange=0,len=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.print("Disarium Numbers:");
for(i=lowerRange;i<=upperRange;i++)
{
temp=i;
while(temp>0)
{
len=len+1;
temp=temp/10;
}
sum=0;
/*Makes a copy of the original number num*/
temp = i;

/*Calculates the sum of digits powered with their respective position */

while(temp > 0)
{
rem = temp%10;
sum = sum + (int)Math.pow(rem,len);
temp = temp/10;
len--;
}
 /*Checks whether the sum is equal to the number itself */
if(sum == i)
{
System.out.print(i + " ");
}
}
}
}
Question
PROGRAM TO CHECK WHETHER A GIVEN NUMBER IS A EMIRP NUMBER.
(AN EMIRP NUMBER (PRIME SPELT BACKWARDS) IS A PRIME NUMBER THAT RESULTS IN A
DIFFERENT PRIME WHEN ITS DIGITS ARE REVERSED.)

EXAMPLE 1:
ENTER A NUMBER:
113
113 IS AN EMIRP NUMBER
HERE 113 IS A PRIME NUMBER
REVERSE OF 113 IS 311 WHICH IS ALSO PRIME.
AS BOTH THE GIVEN NUMBER AND REVERSE OF NUMBER IS PRIME THEREFORE,13 IS AN EMIRP
NUMBER.

EXAMPLE 2:
ENTER A NUMBER:
19
19 IS NOT AN EMIRP NUMBER
HERE 19 IS A PRIME NUMBER
REVERSE OF 19 IS 91 WHICH IS MOT A PRIME AS 91 IS DIVISIBLE BY 13.
AS ONLY GIVEN NUMBER IS PRIME BUT NOT REVERSE OF NUMBER THEREFORE,19 IS NOT AN
EMIRP NUMBER.
Answer

import java.util.Scanner;

public class emirpNumber

{
//Function isPrime(int n) checks if number is Prime
//If it is true then return true elese return false
public static boolean isPrime(int n)
{
int i=0;
if(n>1)
{
for(i=2;i< n;i++)
{
if(n%i==0)
{
return false;

}
}
return true;
}
else
{
return false;
}

}
//Function reverse(int n) returns reverse of a number
public static int reverse(int n)
{
int temp=0,rev=0,rem=0;
temp=n;
while(temp>0)
{
rem=temp%10;
rev=rev*10+rem;
 temp=temp/10;
}
return rev;
}
public static void main()
{
int reverseNum=0,num=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number:");
num=sc.nextInt();
reverseNum=reverse(num);
if(isPrime(num)==true && isPrime(reverseNum)==true)
{
System.out.println(num+" is an Emirp number");
}
else
{
System.out.println(num+" is not an Emirp number");

}
}
}
Question
PRINT ALL THE BOUNCY NUMBERS IN A GIVEN RANGE.
A BOUNCY NUMBER IS ONE IN WHICH A NON-NEGATIVE INTEGER IS NEITHER AN INCREASING
NUMBER NOR A DECREASING NUMBER.
AN INCREASING NUMBER IS A NON-NEGATIVE INTEGER IN WHICH THE DIGITS FROM LEFT TO
RIGHT ARE ARRANGED IN SUCH A WAY THAT NO DIGIT ON THE LEFT IS GREATER THAN THE
DIGIT TO ITS RIGHT. FOR EXAMPLE, 1223
A DECREASING NUMBER IS A NON-NEGATIVE INTEGER IN WHICH THE DIGITS FROM LEFT TO
RIGHT ARE ARRANGED IN SUCH A WAY THAT NO DIGIT ON THE LEFT IS SMALLER THAN THE
DIGIT TO ITS RIGHT. FOR EXAMPLE , 3221

ENTER LOWER RANGE

100
ENTER UPPER RANGE
120
BOUNCY NUMBERS BETWEEN 100 AND 120:
101 102 103 104 105 106 107 108 109 1
Answer

import java.util.Scanner;
public class BouncyNumberInRange
{
public static void main()
{
int temp=0,last=0,digit=0,lowerRange=0,upperRange=0,i=0;
boolean isIncreasing=true,isDecreasing=true;
Scanner sc=new Scanner(System.in);
System.out.println("Enter Lower Range");
lowerRange=sc.nextInt();
System.out.println("Enter Upper Range");
upperRange=sc.nextInt();
System.out.println("Bouncy Numbers between "+lowerRange+" and "+upperRange+":");
for(i=lowerRange;i<=upperRange;i++)
{
//Checking of number being negative is not required
//as it will not enter in while loop if number is negative integer
temp=i;
//This while loop is to check if the number is increasing number
last=temp%10;
while(temp>0)
{
temp=temp/10;
digit=temp%10;
if(last0)
{
isIncreasing=false;
break;
}
last=digit;
}

//This while loop is to check if the number is decreasing number

temp=i;
last=temp%10;
 while(temp>0)
{

temp=temp/10;
digit=temp%10;
if(last>digit && temp>0)
{
isDecreasing=false;
break;
}
last=digit;
}
if(isDecreasing==false && isIncreasing==false)
{
System.out.print(i+" ");
}
isIncreasing=true;
isDecreasing=true;
}

}
}
Question
EXTRACT DIGITS FROM NUMBER.

ENTER THE NUMBER

123456
EXTRACTED DIGITS FROM NUMBER:
6 5 4 3 2 1

ENTER THE NUMBER

2312
EXTRACTED DIGITS FROM NUMBER:
2 1 3 2
Answer

import java.util.*;
public class DigitsExtraction
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number");
int num=sc.nextInt();
System.out.println("Extracted digits from number:");
while(num!=0)//Loop to extract digits.
{
int r=num%10;
System.out.print(r+" ");
num=num/10;
}

}
Question
PROGRAM TO PRINT FIBONACCI SERIES

ENTER THE NUMBER OF TERM :

10
FIBONACCI SERIES :
0 1 1 2 3 5 8 13 21 34
Answer

import java.util.Scanner;
public class fibonacciSeries
{
public static void main(String[] args)
{

int n=0,i=0,a=0,b=1,c=0;
Scanner sc = new Scanner(System.in);

System.out.println("Enter size of series");

n = sc.nextInt();

System.out.print(a+" "+b);
for(i=2;i< n;i++)
{
c=a+b;
System.out.print(" "+c);
a=b;
b=c;
}

}
}
Question
PRINT THE FIRST TEN PRIME NUMBERS.
(PRIME NUMBERS ARE THE NATURAL NUMBERS THAT CAN BE DIVIDED BY THEMSELF OR BY 1
WITHOUT ANY REMAINDER.)
Answer

public class firstTenPrimeNumbers

{
public static void main(String[] args)
{
int i=0,j=0,count=1;
boolean flag=false;
System.out.println("First ten prime numbers:");
while(count<=10)
{
flag=true;
i=i+1;
if(i>1)
{
for(j=2;j<=i/2;j++)
{
if(i%j==0)
{
flag=false;
break;
}

}
if(flag==true)
{
System.out.print(i+" ");
count=count+1;
}
}
}
}
}
Question
CHECK WHETHER A NUMBER IS HAPPY NUMBER
A NUMBER IS CALLED HAPPY IF IT LEADS TO 1 AFTER A SEQUENCE OF STEPS WHEREIN EACH
STEP NUMBER IS REPLACED BY THE SUM OF SQUARES OF ITS DIGIT THAT IS IF WE START WITH
HAPPY NUMBER AND KEEP REPLACING IT WITH DIGITS SQUARE SUM, WE REACH 1.

INPUT: N = 19
OUTPUT: TRUE
19 IS HAPPY NUMBER,
1^2 + 9^2 = 82
8^2 + 2^2 = 68
6^2 + 8^2 = 100
1^2 + 0^2 + 0^2 = 1
AS WE REACHED TO 1, 19 IS A HAPPY NUMBER.

EXAMPLE 2:
ENTER A NON-ZERO POSITIVE NUMBER:13
IT IS A HAPPY NUMBER
Answer

import java.util.*;
public class HappyNumber
{

/* calculate the sum of squares of each digits*/

public static int SumOfSquareOfDigits (int number)
{
int rem = 0, sum = 0;
while(number > 0)
{
rem = number %10;
sum = sum+(rem*rem);
number = number/10;
}
return sum;
}
public static void main(String[] args)
{
/* Take number from user*/
int result = 0;
boolean flag=true;
Scanner sc = new Scanner (System.in);
System.out.print("Enter a non-zero Positive Number:");
int num = sc.nextInt();
if(num <= 0)
{
System.out.println("Number is not a happy number");
}
else
{
result=num;
while(flag==true)
{
result = SumOfSquareOfDigits(result);
 if(result==1)
{
System.out.println (num+" is a Happy Number");
flag=false;
}
else if(result==4)
{
System.out.println (num+" is not a Happy Number");
flag=false;
}

}
}
}
Question
PROGRAM TO DETERMINE WHETHER A GIVEN NUMBER IS A HARSHAD NUMBER.
(A NUMBER IS SAID TO BE THE HARSHAD NUMBER IF IT IS DIVISIBLE BY THE SUM OF ITS DIGIT.)
Answer

import java.util.Scanner;
public class HarshadNumber
{
public static void main(String[] args)
{
int num = 0;
int rem = 0, sum = 0, temp=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter a number");
num=sc.nextInt();

/*Make a copy of num and store it in variable temp*/

temp = num;

/*Calculates sum of digits*/

while(temp> 0)
{
rem = temp%10;
sum = sum + rem;
temp = temp/10;
}

//Checks whether number is divisible by sum of digits

if(num%sum == 0)
System.out.println(num + " is a harshad number");
else
System.out.println(num + " is not a harshad number");
}
}
Question
HARSHAD NUMBER IN A GIVEN RANGE.
(A NUMBER IS SAID TO BE THE HARSHAD NUMBER IF IT IS DIVISIBLE BY THE SUM OF ITS DIGIT.)
Answer

import java.util.Scanner;
public class HarshadNumberInGivenRange
{
public static void main(String[] args)
{

int temp,lowerRange=0,upperRange=0,rem = 0, sum = 0,i=0,num=0;

Scanner sc = new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.println("Harshad Numbers:");
for(i=lowerRange;i<=upperRange;i++)
{
sum=0;
if(i>0)
{
/*Make a copy of i and store it in variable temp*/
temp = i;

/*Calculates sum of digits*/

while(temp> 0)
{
rem = temp%10;
sum = sum + rem;
temp = temp/10;
}

//Checks whether number is divisible by sum of digits

if(num%sum == 0)
{
System.out.println(i+ " ");
}
}
}
 }
}
Question
PROGRAM TO PRINT KEITH NUMBERS BETWEEN LOWER AND UPPER RANGE.
A NUMBER IS CALLED KEITH NUMBER IF IT APPEARS IN A SPECIAL SEQUENCE (DEFINED BELOW)
GENERATED USING ITS DIGITS. THE SPECIAL SEQUENCE HAS FIRST N TERMS AS DIGITS OF THE
NUMBER AND OTHER TERMS ARE RECURSIVELY EVALUATED AS SUM OF PREVIOUS N TERMS

ENTER THE LOWER RANGE

25
ENTER THE UPPER RANGE
300
31 50 53 57 89 117 122 125 197 210 237 278

197 HAS 3 DIGITS, SO N = 3

THE NUMBER IS KEITH BECAUSE IT APPEARS IN THE SPECIAL
SEQUENCE THAT HAS FIRST THREE TERMS AS 1, 9, 7 AND
REMAINING TERMS EVALUATED USING SUM OF PREVIOUS 3 TERMS.
1, 9, 7, 17, 33, 57, 107, 197, .....
Answer

import java.util.Scanner;

public class keithNumberInGivenRange

{
public static void main()
{
int digits[];
int lowerRange=0,upperRange=0,count=0,i=0,temp=0,sum=0,j=0;
Scanner sc=new Scanner(System.in);
System.out.println("ENTER THE Lower Range");
lowerRange=sc.nextInt();
System.out.println("ENTER THE Upper Range");
upperRange=sc.nextInt();
for(i=lowerRange;i<=upperRange;i++)
{

temp=i;
while(temp>0)
{
count++;
temp=temp/10;
}
digits=new int[count];

temp=i;
while(temp>0)
{
digits[count-1]=temp%10;
temp/=10;
count--;
}

while(sum< i)
{
sum=0;
 for(j=0;j< digits.length;j++)
{
sum=sum+digits[j];

}
for(j=0;j< digits.length-1;j++)
{
digits[j]=digits[j+1];

}
digits[digits.length-1]=sum;

if(sum==i)
{
System.out.print(i+" ");
}

}
}
Question
CHECK WHETHER A NUMBER IS A NEON NUMBER
A NEON NUMBER IS A NUMBER WHERE THE SUM OF DIGITS OF THE SQUARE OF THE NUMBER IS
EQUAL TO THE NUMBER. FOR EXAMPLE, IF THE INPUT NUMBER IS 9, ITS SQUARE IS 9*9 = 81
AND THE SUM OF THE DIGITS IS 9. I.E. 9 IS A NEON NUMBER.

ENTER A NUMBER:
9
9 IS A NEON NUMBER.

EXAMPLE 2:
ENTER A NUMBER:
303
303 IS NOT A NEON NUMBER.
Answer

import java.util.*;
public class NeonNumber
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number to check neon number or not");
int num=sc.nextInt();
int squaredNumber=num*num;
int sum=0;
while(squaredNumber!=0)//Loop to find the sum of digits.
{
int a=squaredNumber%10;
sum=sum+a;
squaredNumber=squaredNumber/10;
}
if(sum==num)
{
System.out.println(num+" is a Neon Number.");
}
else
{
System.out.println(num+" is not a Neon Number.");
}
}

}
Question
NEON NUMBER BETWEEN GIVEN RANGE.
A NEON NUMBER IS A NUMBER WHERE THE SUM OF DIGITS OF THE SQUARE OF THE NUMBER IS
EQUAL TO THE NUMBER. FOR EXAMPLE, IF THE INPUT NUMBER IS 9, ITS SQUARE IS 9*9 = 81
AND THE SUM OF THE DIGITS IS 9. I.E. 9 IS A NEON NUMBER.
NOTE:-0,1,9 ARE THE ONLY NEON NUMBERS

ENTER THE LOWER RANGE

0
ENTER THE UPPER RANGE
5000
NEON NUMBERS:0 1 9
Answer

import java.util.*;
public class NeonNumber
{
public static void main(String args[])
{
int upperRange=0,lowerRange=0,sum=0,squaredNumber=0,r=0,i=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.print("Neon Numbers:");
for(i=lowerRange;i<=upperRange;i++)
{
squaredNumber=i*i;
sum=0;
while(squaredNumber!=0)//Loop to find the sum of digits.
{
r=squaredNumber%10;
sum=sum+r;
squaredNumber=squaredNumber/10;
}

if(sum==i)
{
System.out.print(i+" ");
}

}
}

}
Question
FIND ALL THE NON-PRIME NUMBERS BETWEEN A GIVEN RANGE.

ENTER THE LOWER RANGE

1
ENTER THE UPPER RANGE
50
NON PRIME NUMBERS:
4 6 8 9 10 12 14 15 16 18 20 21 22 24 25 26 27 28 30 32 33 34 35 36 38 39 40
42 44 45 46 48 49 50
Answer

import java.util.*;
public class nonPrimeNumberInRange
{
public static void main(String args[])
{
int upperRange=0,lowerRange=0,i=0,j=0,flag=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.println("Non Prime Numbers:");
for(i=lowerRange;i< upperRange;i++)
{

if(i<=1)
{
System.out.print(i+" ");
}
else
{
flag=0;

for(j=2;j< i;j++)
{
/*Checking if i is divisible by j.*/
if(i%j==0)
{

flag=1;
break;
}
}
 if(flag==1)
{
System.out.print(i+" ");
}
}

}
}
Question
CHECK WHETHER A NUMBER IS PALINDROME OR NOT.
(A PALINDROME NUMBER IS A NUMBER THAT REMAINS THE SAME WHEN ITS DIGITS ARE
REVERSED)

ENTER A NUMBER
101
101 IS A PALINDROME.

ENTER A NUMBER
1321
1321 IS NOT A PALINDROME.
Answer

import java.util.Scanner;

public class Palindrome

{

public static void main(String[] args)

{

int num =0,reversedInteger = 0, remainder, temp=0;

/*The input provided by user is stored in num*/

Scanner sc = new Scanner(System.in);
System.out.println("ENTER A NUMBER");
num = sc.nextInt();
temp= num;

// reversed integer is stored in variable

while( temp > 0 )
{
remainder = temp % 10;
reversedInteger = reversedInteger * 10 + remainder;
temp /= 10;
}

/* palindrome if num and reversedInteger are equal*/

if (num == reversedInteger)
{
System.out.println(num + " is a palindrome.");
}
else
{
System.out.println(num + " is not a palindrome.");
}
}
}
Question
PRINT PALINDROME NUMBERS IN GIVEN RANGE.
(A PALINDROME NUMBER IS A NUMBER THAT REMAINS THE SAME WHEN ITS DIGITS ARE
REVERSED.)

ENTER THE LOWER RANGE

1
ENTER THE UPPER RANGE
100
PRIME NUMBERS:
1
2
3
4
5
6
7
8
9
11
22
33
44
55
66
77
88
99
Answer

import java.util.Scanner;

public class PalindromeInRange

{

public static void main(String[] args)

{
Scanner sc=new Scanner(System.in);
int upperRange=0,lowerRange=0,reversedInteger = 0, remainder, temp=0,i=0;

System.out.println("Enter the lower range");

lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.println("Palindrome Numbers:");
for(i=lowerRange;i<=upperRange;i++)
{
reversedInteger=0;
if(i>0)
{
temp= i;

// reversed integer is stored in variable

while( temp != 0 )
{
remainder = temp % 10;
reversedInteger = reversedInteger * 10 + remainder;
temp =temp/10;
}

/* palindrome if num and reversedInteger are equal*/

if (i == reversedInteger)
{
System.out.println(i + " ");
 }
}
}
}
Question
PROGRAM TO CALCULATE THE PERIMETER OF THE CIRCLE.
Answer

import java.util.Scanner;
public class perimeterOfCircle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter radius of circle");
double r=sc.nextDouble();
double pi=22/7;
/*Formula of perimeter of circle =2*pi*radius of circle */
double perimeter=2*pi*r;
System.out.println("perimeter of circle="+perimeter);
}
}
Question
PROGRAM TO CALCULATE THE PERIMETER OF THE RECTANGLE.
Answer

import java.util.Scanner;
public class perimeterOfrectangle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a length");
double len=sc.nextDouble();
System.out.println("Enter a breadth");
double breadth=sc.nextDouble();
/*Formula of perimeter of rectangle =2*(length of rectangle +breadth of rectangle)*/
double perimeter=2*(len+breadth);
System.out.println("perimeter of rectangle="+perimeter);
}
}
Question
PROGRAM TO CALCULATE THE PERIMETER OF THE RECTANGLE.
Answer

import java.util.Scanner;
public class perimeterOfrectangle
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a length");
double len=sc.nextDouble();
System.out.println("Enter a breadth");
double breadth=sc.nextDouble();
/*Formula of perimeter of rectangle =2*(length of rectangle +breadth of rectangle)*/
double perimeter=2*(len+breadth);
System.out.println("perimeter of rectangle="+perimeter);
}
}
Question
PROGRAM TO CALCULATE THE PERIMETER OF THE SQUARE.
Answer

import java.util.Scanner;
public class perimeterOfSquare
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter a length of square");
double a=sc.nextDouble();

/*Formula of perimeter of square =4*(length of square)*/

double perimeter=4*a;
System.out.println("perimeter of square="+perimeter);
}
}
Question
WRITE A PROGRAM TO CALCULATE THE POWER OF A NUMBER.

ENTER THE NUMBER

2
ENTER THE EXPONENT
3
2^3=8
Answer

import java.util.*;
public class powerOfNumber
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number ");
int num=sc.nextInt();
System.out.println("Enter the Exponent");
int exp=sc.nextInt();

int power=(int)Math.pow(num,exp);
System.out.println(num+"^"+exp+"="+power);

}
Question
CHECKING WHETHER THE NUMBER GIVEN IS A PRIME NUMBER OR NOT.

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.
Answer

import java.util.Scanner;
public class PrimeExample
{
public static void main(String args[])
{
int i,flag=0,num=0;
System.out.println("Enter an Integer number:");

/*The input provided by user is stored in num*/

Scanner input = new Scanner(System.in);
num = input.nextInt();
/*negative number and 1 are not prime number*/
if(num< 2)
{
System.out.println(num+" is not prime number");
}
else
{
for(i=2;i< num;i++)
{
/*Checking if number is divisible by i.*/
if(num%i==0)
{
System.out.println(num+" is not prime number");
flag=1;
break;
}
}
if(flag==0)
{
System.out.println(num+" is prime number");
}
}
}
}
Question
FIND ALL THE PRIME NUMBERS BETWEEN A GIVEN RANGE.

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.

ENTER THE LOWER RANGE

1
ENTER THE UPPER RANGE
100
PRIME NUMBERS:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97
Answer

import java.util.*;
public class PrimeNumberInRange
{
public static void main(String args[])
{
int upperRange=0,lowerRange=0,i=0,j=0,flag=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.println("Prime Numbers:");
for(i=lowerRange;i< upperRange;i++)
{
/*prime numbers start from 2.Therfore, check the number only if number is greater than 1*/
if(i>1)
{
flag=0;

for(j=2;j< i;j++)
{
/*Checking if i is divisible by j.*/
if(i%j==0)
{

flag=1;
break;
}
}
if(flag==0)
{
System.out.print(i+" ");
}
}
}

}
}
Question
PRINT KAPREKAR NUMBER IN GIVEN RANGE.
(A KAPREKAR NUMBER IS A NUMBER WHOSE SQUARE WHEN DIVIDED INTO TWO PARTS AND
SUCH THAT THE SUM OF PARTS IS EQUAL TO THE ORIGINAL NUMBER AND NONE OF THE PARTS
HAS VALUE 0.)

ENTER A NUMBER: 45
45 IS A KAPREKAR NUMBER
45*45 = 2025 AND 20 + 25 IS 45

ENTER A NUMBER: 10
10 IS NOT A KAPREKAR NUMBER
10*10 = 100. IT IS NOT A KAPREKAR NUMBER EVEN IF
SUM OF 100 + 0 IS 100 BECAUSE NONE OF THE PARTS SHOULD HAVE VALUE 0.
Answer

import java.util.Scanner;
public class kaprekarNumberInGivenRange
{
public static void main()
{

int len=0,sum=0,firstPart=0,secondPart=0,i=0,lowerRange=0,upperRange=0;
String sq="";
Scanner sc=new Scanner(System.in);
System.out.print("ENTER A LOWER RANGE:");
lowerRange=sc.nextInt();
System.out.print("ENTER A UPPER RANGE:");
upperRange=sc.nextInt();

System.out.println("KAPREKAR NUMBERS:");
for(i=lowerRange;i<=upperRange;i++)
{
if(i<=3)
{
if(i==1)
{
System.out.print(i+" ");
}
}
else
{
sq=Integer.toString((i*i));
len=sq.length();
firstPart=Integer.parseInt(sq.substring(0,(len/2)));
secondPart=Integer.parseInt(sq.substring((len/2),len));
sum=firstPart+secondPart;

if(sum==i &&(firstPart!=0)&&(secondPart!=0))
{
System.out.print(i+" ");

}
 }

}
}
Question
PRINT KAPREKAR NUMBER IN GIVEN RANGE WITHOUT USING STRING AND THE PRINT SUM OF
ALL KAPREKAR NUMBERS IN THE RANGE.
(A KAPREKAR NUMBER IS A NUMBER WHOSE SQUARE WHEN DIVIDED INTO TWO PARTS AND
SUCH THAT THE SUM OF PARTS IS EQUAL TO THE ORIGINAL NUMBER AND NONE OF THE PARTS
HAS VALUE 0.)

ENTER A NUMBER: 45
45 IS A KAPREKAR NUMBER
45*45 = 2025 AND 20 + 25 IS 45

ENTER A LOWER RANGE:1

ENTER A UPPER RANGE:1000
KAPREKAR NUMBERS:
1 9 45 55 99 297 703 999
SUM OF ALL KAPREKAR NUMBER IN RANGE:2208
Answer

import java.util.Scanner;
public class kaprekarNumberInGivenRangeAndSum
{
public static void main()
{

int i=0,lowerRange=0,upperRange=0;
long count=0,sq=0,sum=0,firstPart=0,secondPart=0,temp=0,sumOfKaprekarNumber=0;

Scanner sc=new Scanner(System.in);

System.out.print("ENTER A LOWER RANGE:");
lowerRange=sc.nextInt();
System.out.print("ENTER A UPPER RANGE:");
upperRange=sc.nextInt();

System.out.println("KAPREKAR NUMBERS:");
for(i=lowerRange;i<=upperRange;i++)
{
if(i>0)
{

count=0;

sq=i*i;
temp=sq;
while(temp>0)
{
count++;
temp=temp/10;
}
temp=sq;

firstPart=temp% (long)Math.pow(10,count-count/2);
secondPart=temp/(long)Math.pow(10,count-count/2);
sum=firstPart+secondPart;
 if((sum==i &&(firstPart!=0)&&(secondPart!=0))||i==1)
{
System.out.print(i+" ");
sumOfKaprekarNumber=sumOfKaprekarNumber+i;
}

}
}
System.out.println();
System.out.println("sum of all kaprekar number in range:"+sumOfKaprekarNumber);
}
}
Question
PRINT KAPREKAR NUMBER IN GIVEN RANGE WITHOUT USING STRING.
(A KAPREKAR NUMBER IS A NUMBER WHOSE SQUARE WHEN DIVIDED INTO TWO PARTS AND
SUCH THAT THE SUM OF PARTS IS EQUAL TO THE ORIGINAL NUMBER AND NONE OF THE PARTS
HAS VALUE 0.)

ENTER A NUMBER: 45
45 IS A KAPREKAR NUMBER
45*45 = 2025 AND 20 + 25 IS 45

ENTER A LOWER RANGE:1

ENTER A UPPER RANGE:1000
KAPREKAR NUMBERS:
1 9 45 55 99 297 703 999
Answer

import java.util.Scanner;
public class kaprekarNumberInGivenRange
{
public static void main()
{

int i=0,lowerRange=0,upperRange=0;
long count=0,sq=0,sum=0,firstPart=0,secondPart=0,temp=0;

Scanner sc=new Scanner(System.in);

System.out.print("ENTER A LOWER RANGE:");
lowerRange=sc.nextInt();
System.out.print("ENTER A UPPER RANGE:");
upperRange=sc.nextInt();

System.out.println("KAPREKAR NUMBERS:");
for(i=lowerRange;i<=upperRange;i++)
{
if(i>0)
{

count=0;

sq=i*i;
temp=sq;
while(temp>0)
{
count++;
temp=temp/10;
}
temp=sq;

firstPart=temp% (long)Math.pow(10,count-count/2);
secondPart=temp/(long)Math.pow(10,count-count/2);
sum=firstPart+secondPart;
 if((sum==i &&(firstPart!=0)&&(secondPart!=0))||i==1)
{
System.out.print(i+" ");

}
}

}
}
Question
PRINT TWIN PRIME NUMBERS IN GIVEN RANGE

(TWIN PRIMES ARE THE PRIME NUMBERS WITH A DIFFERENCE OF 2.)

EXAMPLE: (3 AND 5),(5 AND 7),(11 AND 13) ETC

ENTER THE LOWER VALUE:-10

ENTER THE UPPER VALUE:90
TWIN PRIME NUMBERS BETWEEN -10 AND 90 :
(3,5)
(5,7)
( 11 , 13 )
( 17 , 19 )
( 29 , 31 )
( 41 , 43 )
( 59 , 61 )
( 71 , 73 )
Answer

import java.util.Scanner;
public class TwinPrimeInGivenRange
{
public static boolean isPrime(int num)
{
int i=0;
if(num>1)
{
for(i=2;i< num;i++)
{
if(num%i==0)
{
return false;
}
}
return true;
}
else
{
return false;
}
}

public static void main()

{
int lowerRange=0,upperRange=0,difference=0,i=0,firstNumber=0,secondNumber=0;
boolean isFirstNumberPrime=false,isSecondNumberPrime=false;
Scanner sc=new Scanner(System.in);
System.out.println("ENTER LOWER VALUE:");
lowerRange=sc.nextInt();
System.out.println("ENTER UPPER VALUE:");
upperRange=sc.nextInt();
System.out.println("Twin Prime numbers between "+lowerRange+" and "+upperRange+":");
 for(i=lowerRange;i<=upperRange-2;i++)
{
firstNumber=i;
secondNumber=i+2;
isFirstNumberPrime=isPrime(firstNumber);
isSecondNumberPrime=isPrime(secondNumber);

if(isFirstNumberPrime==true)
{
if(isSecondNumberPrime==true)
{
System.out.println("("+firstNumber+","+secondNumber+")");
}
}

}
}
Question
PROGRAM TO CONVERT BINARY TO DECIMAL

ENTER BINARY NUMBER:1001

THE DECIMAL VALUE OF BINARY 1001 IS 9
Answer

import java.util.Scanner;
public class BinaryToDecimal
{
public static void main()
{
int count=0;
Scanner sc=new Scanner(System.in);
long decimal=0,binary=0,temp=0;
count=0;
System.out.print("ENTER BINARY NUMBER:");
binary=sc.nextInt();
temp=binary;
while(temp>0)
{
decimal=decimal+(temp%10)*((long)Math.pow(2,count));

count++;
temp=temp/10;
}
System.out.println("THE DECIMAL VALUE OF BINARY "+binary+" IS "+decimal);
}
}
Question
PROGRAM TO CONVERT BINARY TO OCTAL

ENTER BINARY NUMBER:11110

THE OCTAL VALUE OF BINARY 11110 IS 36
Answer

import java.util.Scanner;
public class BinaryToOctal
{
public static void main()
{
int count=0;
Scanner sc=new Scanner(System.in);
long binary=0,octal=0,decimal=0,temp=0;
count=0;
System.out.print("ENTER BINARY NUMBER:");
binary=sc.nextInt();
temp=binary;
while(temp>0)
{
decimal=decimal+(temp%10)*((long)Math.pow(2,count));

count++;
temp=temp/10;
}
temp=decimal;
count=0;
while(temp>0)
{
octal=octal+(temp%8)*(long)Math.pow(10,count);

count++;
temp=temp/8;
}
System.out.println("THE OCTAL VALUE OF BINARY "+binary+" IS "+octal);
}
}
Question
PROGRAM TO CONVERT DECIMAL TO BINARY

ENTER DECIMAL NUMBER:1234

THE BINARY VALUE OF DECIMAL 1234 IS 10011010010
Answer

import java.util.Scanner;
public class DecimalToBinary
{
public static void main()
{
int count=0;
Scanner sc=new Scanner(System.in);
long binary=0,decimal=0,temp=0;

System.out.print("ENTER DECIMAL NUMBER:");

decimal=sc.nextInt();

temp=decimal;
count=0;
while(temp>0)
{
binary=binary+(temp%2)*((long)Math.pow(10,count));
count++;
temp=temp/2;
}
System.out.println("THE BINARY VALUE OF DECIMAL "+decimal+" IS "+binary);
}
}
Question
PROGRAM TO CONVERT DECIMAL TO OCTAL

ENTER DECIMAL NUMBER:25

THE OCTAL VALUE OF DECIMAL 25 IS 31
Answer

import java.util.Scanner;
public class DecimalToOctal
{
public static void main()
{
int count=0;
Scanner sc=new Scanner(System.in);
long decimal=0,octal=0,temp=0;
count=0;
System.out.print("ENTER DECIMAL NUMBER:");
decimal=sc.nextInt();

temp=decimal;
count=0;
while(temp>0)
{
octal=octal+(temp%8)*(long)Math.pow(10,count);

count++;
temp=temp/8;
}
System.out.println("THE OCTAL VALUE OF DECIMAL "+decimal+" IS "+octal);
}
}
Question
PROGRAM TO CONVERT OCTAL TO DECIMAL

ENTER OCTAL NUMBER:172

THE DECIMAL VALUE OF OCTAL 172 IS 122
Answer

import java.util.Scanner;
public class OctalToDecimal
{
public static void main()
{
int count=0;
Scanner sc=new Scanner(System.in);
long octal=0,decimal=0,temp=0;
boolean valid=true;
System.out.print("ENTER OCTAL NUMBER:");
octal=sc.nextInt();

temp=octal;
count=0;
while(temp>0)
{
if(temp%10>7)
{
System.out.println("Invalid Octal Number");
valid=false;
break;
}
temp=temp/10;
}
if(valid==true)
{
temp=octal;
while(temp>0)
{
decimal=decimal+(temp%10)*((long)Math.pow(8,count));
count++;
temp=temp/10;
}
System.out.println("THE DECIMAL VALUE OF OCTAL "+octal+" IS "+decimal);
}
}
}
Question
PROGRAM TO PRINT ALL PRIME TRIPLETS IN A GIVEN RANGE

ENTER LOWER RANGE

1
ENTER UPPER RANGE
20
PRIME TRIPLET BETWEEN 1 AND 20
(5,7,11)
(7,11,13)
(11,13,17)
(13,17,19)
(17,19,23)
Answer

import java.util.Scanner;
public class PrimeTripletInGivenRange
{
public static boolean isPrime(int num)
{

int j=0,count=0;
boolean flag=true;
if(num>1)
{
for(j=1;j<=num;j++)
{
/*Checking if number is divisible by j.*/
if(num%j==0)
{
count++;
}
}
if(count==2)
{
return true;
}
else
{
return false;
}
}
else
{
return false;
}
}
 public static void main()
{
int lowerRange=0,upperRange=0,i=0;
Scanner sc=new Scanner(System.in);
System.out.println("ENTER LOWER RANGE");
lowerRange=sc.nextInt();
System.out.println("ENTER UPPER RANGE");
upperRange=sc.nextInt();
System.out.println("PRIME TRIPLET BETWEEN "+lowerRange+" and "+upperRange);

for(i=lowerRange;i<=upperRange;i++)
{
if(i>4)
{
if(isPrime(i)==true&&isPrime(i+2)==true && isPrime(i+6)==true)
{
System.out.println("("+i+","+(i+2)+","+(i+6)+")");
}
if(isPrime(i)==true&&isPrime(i+4)==true && isPrime(i+6)==true)
{
System.out.println("("+i+","+(i+4)+","+(i+6)+")");

}
}
}
}
}
Question
FIND WHETHER THE GIVEN NUMBER IS A PRONIC NUMBER.
(THE PRONIC NUMBER CAN BE DEFINED AS THE NUMBER WHICH IS A PRODUCT OF TWO
CONSECUTIVE NUMBERS. )
Answer

import java.util.Scanner;
public class PronicNumbers
{
public static void main(String[] args)
{
int num=0, i=0;
boolean flag=false;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number");
num=sc.nextInt();
for(i=0;i<=num;i++)
{
if((i*(i+1))==num)
{
flag=true;
break;
}
}
if(flag==true)
{
System.out.print(num + " is a pronic number ");
}
else
{
System.out.print(num + " is not a pronic number ");
}

}
}
Question
FIND ALL PRONIC NUMBERS IN A GIVEN RANGE.
(THE PRONIC NUMBER CAN BE DEFINED AS THE NUMBER WHICH IS A PRODUCT OF TWO
CONSECUTIVE NUMBERS. )
Answer

import java.util.Scanner;
public class PronicNumbersInGivenRange
{
/*isPronicNumber() will determine whether a given number is pronic number or not*/
public static boolean isPronicNumber(int num)
{

boolean flag = false;

for(int j = 1; j <= num; j++)

{
/* Checks for pronic number by multiplying consecutive numbers */
if((j*(j+1)) == num)
{
flag = true;
break;
}
}
return flag;
}

public static void main(String[] args)

{
int lowerRange=0,upperRange=0,i=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
//Displays pronic numbers between lowerRange and upperRange
System.out.println("Pronic numbers between "+lowerRange+" and "+upperRange);
for(i = lowerRange; i <=upperRange; i++)
{
if(isPronicNumber(i))
{
System.out.print(i + " ");
}
 }
}
}
Question
PRINT REVERSE OF A NUMBER.
Answer

import java.util.Scanner;
public class reverseOfNUmber
{
public static void main()
{
int num =0,reversedInteger = 0, remainder, temp=0;
Scanner sc = new Scanner(System.in);
System.out.println("ENTER A NUMBER");
num = sc.nextInt();
temp= num;
/* reversed integer is stored in variable */
while( temp != 0 )
{
remainder = temp % 10;
reversedInteger = reversedInteger * 10 + remainder;
temp /= 10;
}

System.out.println(reversedInteger);
}
}
Question
PROGRAM TO PRINT SMITH NUMBER IN A GIVEN RANGE.
(A SMITH NUMBER IS A COMPOSITE NUMBER WHOSE SUM OF DIGITS IS EQUAL TO THE SUM OF
DIGITS IN ITS PRIME FACTORIZATION)

ENTER A LOWER RANGE:

1
ENTER UPPER RANGE:50
SMITH NUMBERS:
4 22 27

ENTER A LOWER RANGE:1

ENTER UPPER RANGE:500
SMITH NUMBERS:
4 22 27 58 85 94 121 166 202 265 274 319 346 355 378 382 391 438 454 483
Answer

import java.util.Scanner;
public class SmithNumberInGivenRange
{
public static boolean isPrime(int number)
{
int k=0;
for(k=2;k<=(number/2);k++)
{

if(number%k==0)
{
return false;
}
}
return true;

public static void main()

{
int sumd=0,sump=0,i=0,temp=0,temp1=0,lowerRange=0,upperRange=0,j=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter a lower Range:");
lowerRange=sc.nextInt();
System.out.print("Enter Upper Range:");
upperRange=sc.nextInt();
System.out.println("Smith Numbers:");
for(i=lowerRange;i<=upperRange;i++)
{
temp=i;
sumd=0;
sump=0;
while(temp>0)
{
sumd=sumd+(temp%10);
temp=temp/10;
}
 temp=i;
for(j=2;j<=i/2;j++)
{
while(temp%j==0)
{
if(j<4)
{
sump=sump+j;
temp=temp/j;

}
else
{
if(isPrime(j)==true)
{
temp1=j;
while(temp1>0)
{
sump=sump+(temp1%10);
temp1=temp1/10;
}
temp=temp/j;

}
}
}
if(sumd==sump)
{
System.out.print(i+" ");
}

}
}
}
Question
PRINT SMITH NUMBER IN GIVEN RANGE ONLY USING MAIN METHOD.
(A SMITH NUMBER IS A COMPOSITE NUMBER WHOSE SUM OF DIGITS IS EQUAL TO THE SUM OF
DIGITS IN ITS PRIME FACTORIZATION)

ENTER LOWER RANGE:1

ENTER UPPER RANGE:100
SMITH NUMBERS BETWEEN 1 AND 100:
4 22 27 58 85 94
Answer

import java.util.Scanner;
public class SmithNumberInGivenRange
{

public static void main()

{
int upperRange=0,lowerRange=0;
int sumd=0,sump=0,i=0,j=0,k=0,temp=0,temp1=0,flag=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter Lower Range:");
lowerRange=sc.nextInt();
System.out.print("Enter Upper Range:");
upperRange=sc.nextInt();
System.out.println("Smith numbers between "+lowerRange+" and "+upperRange+":");
for(i=lowerRange;i<=upperRange;i++)
{
temp=i;
while(temp>0)
{
sumd=sumd+(temp%10);
temp=temp/10;
}
temp=i;
for(j=2;j< i;j++)
{
while(temp%j==0)
{

flag=0;
//checking whether number is prime number or not
for(k=2;k< j;k++)
{
 if(j%k==0)
{
flag=1;
break;
}
}
//if number is prime then only it is added to sump
if(flag==0)
{
temp1=j;
//Extracting digits if i >9 and then adding extracted digits to sump
while(temp1>0)
{
sump=sump+(temp1%10);
temp1=temp1/10;
}
temp=temp/j;

}
}

if(sumd==sump && i>0)

{
System.out.print(i+" ");
}
sumd=0;
sump=0;
}

}
}
Question
WRITE A PROGRAM TO SUBTRACT TWO NUMBERS.

ENTER THE VALUE OF 1ST NUMBER

10
ENTER THE VALUE OF 2ND NUMBER
20
10-20=-10
Answer

import java.util.Scanner;
public class SubtractTwoNumbers
{
public static void main()
{
Scanner sc=new Scanner(System.in);
int a =0,b=0;
System.out.println("Enter the value of 1st number");
a=sc.nextInt();
System.out.println("Enter the value of 2nd number");
b=sc.nextInt();
// subtracting A and B
int sub = a-b;
// Print the subtract of a and b
System.out.println(a+"-"+b+"="+sub);
}
}
Question
WRITE A PROGRAM TO ADD TWO NUMBERS.

ENTER THE VALUE OF 1ST NUMBER

10
ENTER THE VALUE OF 2ND NUMBER
30
40

EXAMPLE 2:
ENTER THE VALUE OF 1ST NUMBER
30
ENTER THE VALUE OF 2ND NUMBER
-10
20
Answer

import java.util.Scanner;
public class AddTwoNumbers
{
public static void main()
{
Scanner sc=new Scanner(System.in);
int a =0,b=0;
System.out.println("Enter the value of 1st number");
a=sc.nextInt();
System.out.println("Enter the value of 2nd number");
b=sc.nextInt();
// Adding A and B
int sum = a+b;
// Print the sum of a +b
System.out.println(sum);
}
}
Question
PROGRAM TO SWAP TWO NUMBERS.
Answer

import java.util.Scanner;
public class Swap_With
{
public static void main(String[] args)
{
int a, b, temp;// a and b are to swap
Scanner sc = new Scanner(System.in);
System.out.println("Enter the value of a and b");
a = sc.nextInt();
b = sc.nextInt();
System.out.println("before swapping numbers: Value of a: "+a +" Value of b: "+ b);
/*swapping */
temp = a;
a = b;
b = temp;
System.out.println("After swapping: Value of a: "+a +" Value of b: "+ b);
System.out.println( );
}
}
Question
CHECK WHETHER THE GIVEN NUMBER IS TWISTED PRIME.
(A NUMBER IS CALLED A TWISTED PRIME NUMBER IF IT IS A PRIME NUMBER AND THE REVERSE
OF THIS NUMBER IS ALSO A PRIME NUMBER.)
Answer

import java.util.Scanner;
public class TwistedPrime
{
/* reverseOfNumber() reverses a number */
public static int reverseOfNumber(int num)
{
int temp=0,reversedInteger=0,remainder=0;
temp=num;
while( temp > 0 )
{
remainder = temp % 10;
reversedInteger = reversedInteger * 10 + remainder;
temp /= 10;
}
return reversedInteger;
}
/* isPrime() checks whether a number is prime number or not */
public static boolean isPrime(int num)
{
boolean flag = true;

if(num>1)
{
for (int j = 2; j <= num / 2; j++)
{
if ((num % j) == 0)
{
flag = false;
break;
}
}
}
else
{
flag=false;
}
return flag;
 }
public static void main(String[] args)
{

int number=0,reversedNumber=0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter a number?");
number = sc.nextInt();
if (isPrime(number)==true)
{
reversedNumber=reverseOfNumber(number);
if(isPrime(reversedNumber)==true)
{
System.out.println(number+" is a Twisted Prime");
}
else
{
System.out.println(number+" is Not a Twisted Prime");
}
}
else
{
System.out.println(number+" is Not a Twisted Prime");
}
}
}
Question
PRINT ALL THE TWISTED PRIME NUMBERS IN A GIVEN RANGE.
(A NUMBER IS CALLED A TWISTED PRIME NUMBER IF IT IS A PRIME NUMBER AND THE REVERSE
OF THIS NUMBER IS ALSO A PRIME NUMBER.)
Answer

import java.util.Scanner;
class TwistedPrimeInGivenRange
{
/* reverseOfNumber() reverses a number */
public static int reverseOfNumber(int num)
{
int temp=0,rem=0,reversedInteger=0,remainder=0;
temp=num;
while( temp > 0 )
{
remainder = temp % 10;
reversedInteger = reversedInteger * 10 + remainder;
temp /= 10;
}
return reversedInteger;
}
/* isPrime() checks whether a number is prime number or not */
public static boolean isPrime(int num)
{
boolean flag = true;
if(num>1)
{
for (int j = 2; j <= num / 2; j++)
{
if ((num % j) == 0)
{
flag = false;
break;
}
}
}

return flag;
}
 public static void main(String[] args)
{

int lowerRange=0,upperRange=0,i=0,reversedNumber=0;

Scanner sc=new Scanner(System.in);

System.out.println("Enter the lower range");
lowerRange=sc.nextInt();
System.out.println("Enter the Upper range");
upperRange=sc.nextInt();
System.out.print("Twisted Prime Numbers:");
for(i=lowerRange;i<=upperRange;i++)
{
if (isPrime(i)==true)
{
reversedNumber=reverseOfNumber(i);
if(isPrime(reversedNumber)==true)
{
System.out.println(i+" ");
}
}

}
}
}
Question
WRITE A PROGRAM IN JAVA TO INPUT A NUMBER AND CHECK WHETHER IT IS A UNIQUE NUMBER
OR NOT.
( A UNIQUE NUMBER IS A POSITIVE INTEGER (WITHOUT LEADING ZEROS) WITH NO DUPLICATE
DIGITS. FOR EXAMPLE 7, 135, 214 , 5243 ARE ALL UNIQUE NUMBERS WHEREAS 33, 3121, 200
ARE NOT.)

ENTER A NUMBER :
12345
IT IS AN UNIQUE NUMBER
Answer

import java.util.*;

public class UniqueNumber

public static void main(String args[] )

Scanner sc=new Scanner(System.in);

System.out.println("Enter a number :");
int n=sc.nextInt();
int flag=0,i,temp=0,count=0,r=0;

for(i=0;i<=9;i++)
{
temp=n;
count=0;
while(temp>0)
{
r=temp%10;
if(r==i) /* if any digits are repeated, then it is not a UniqueNumber*/

{
count=count+1;
}
temp=temp/10;
}
if(count>1)
{
System.out.println(" It is not an UniqueNumber");
flag=1;
break;
}
 }

if(flag ==0)
{
System.out.println("It is an Unique Number");
}
}
}
Question
WRITE A PROGRAM IN JAVA TO INPUT A NUMBER AND CHECK WHETHER IT IS A UNIQUE NUMBER
OR NOT IN A GIVEN RANGE.
( A UNIQUE NUMBER IS A POSITIVE INTEGER (WITHOUT LEADING ZEROS) WITH NO DUPLICATE
DIGITS. FOR EXAMPLE 7, 135, 214 , 5243 ARE ALL UNIQUE NUMBERS WHEREAS 33, 3121, 200
ARE NOT.)

ENTER LOWER LOWER :

1000
ENTER UPPER VALUE :
1100
UNIQUE NUMBERS BETWEEN 1000 AND 1100
1023 1024 1025 1026 1027 1028 1029 1032 1034 1035 1036 1037 1038 1039 1042
1043 1045 1046 1047 1048 1049 1052 1053 1054 1056 1057 1058 1059 1062 1063
1064 1065 1067 1068 1069 1072 1073 1074 1075 1076 1078 1079 1082 1083 1084
1085 1086 1087 1089 1092 1093 1094 1095 1096 1097 1098
Answer

import java.util.*;

public class UniqueNumberInRange

public static void main(String args[] )

{
int lowerRange=0,UpperRange=0;
Scanner sc=new Scanner(System.in);
System.out.println("Enter Lower lower :");
lowerRange=sc.nextInt();
System.out.println("Enter Upper value :");
UpperRange=sc.nextInt();
int flag=0,i, j,temp=0,count=0,r=0;
System.out.println("Unique numbers between "+lowerRange+" and "+UpperRange);
for(i=lowerRange;i<=UpperRange;i++)
{
flag=0;
for(j=0;j<=9;j++)
{
temp=i;
count=0;
while(temp>0)
{
r=temp%10;
if(r==j) /* if any digits are repeated, then it is not a UniqueNumber*/

{
count=count+1;
}
temp=temp/10;
}
 if(count>1)
{

flag=1;
break;
}

if(flag ==0)
{
System.out.print(i+" ");
}

}
}
}
Question
CALCULATE THE VOLUME OF CUBE.
Answer

import java.util.Scanner;
public class volumeOfCube
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter length of one side of cube");
double a=sc.nextDouble();
/* volume of cube=a*a*a */
double volume=a*a*a;
System.out.println("Volume of the cube="+volume);
}
}
Question
CALCULATE THE VOLUME OF A CYLINDER.
Answer

import java.util.Scanner;
public class volumeOfCylinder
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter radius of cylinder");
double radius=sc.nextDouble();
System.out.println("Enter height of cylinder");
double height=sc.nextDouble();
double pi=22/7;

double volume=pi*(radius*radius)*height;
System.out.println("Volume of the cylinder="+volume);
}
}
Question
FIND THE VOLUME OF A SPHERE

VOLUME OF SPHERE=4/3 X 𝝿 X RADIUS OF SPHERE X RADIUS OF SPHERE

ENTER RADIUS OF SPHERE
3
3.142857142857143
VOLUME OF THE SPHERE=28.285714285714285
Answer

import java.util.Scanner;
public class volumeOfSphere
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter radius of Sphere");
double r=sc.nextDouble();
double pi=(double)(22/7);
/*volume of Sphere= 4/3*pi*radius of sphere^2 */
double volume=4/3*pi*(r*r);
System.out.println("Volume of the Sphere="+volume);
}
}
Question
CHECK WHETHER A NUMBER IS A PRIME PALINDROME NUMBER.
A PRIME PALINDROME INTEGER IS A POSITIVE INTEGER (WITHOUT LEADING ZEROES) WHICH IS
PRIME AS WELL AS A PALINDROME.

ENTER THE NUMBER

101
101 IS A PRIME PALINDROME NUMBER
Answer

import java.util.Scanner;
public class PrimePalindromeNumber
{
public static void main(String args[])
{
long num=0,temp=0,i=0,reverse=0;
int flag=0;
boolean isPrime=false,isPalindrome=false;
Scanner sc=new Scanner(System.in);
System.out.println("ENTER THE NUMBER");
num=sc.nextLong();
temp=num;

if(temp<2)
{
isPrime=false;
}
else
{
/*for loop runs till "n/2" because number is divisible perfected till half the number*/
for(i=2;i<=temp/2;i++)
{
/*Checking if number is divisible by i.*/
if(temp%i==0)
{
isPrime=false;
flag=1;
break;
}
}
if(flag==0)
{
isPrime=true;
}
}
 temp=num;
reverse=0;
while(temp>0)
{
reverse=reverse*10+temp%10;
temp=temp/10;
}
if(reverse==num)
{
isPalindrome=true;
}
else
{
isPalindrome=false;
}

if(isPrime==true && isPalindrome==true)

{
System.out.println(num+" IS PRIME PALINDROME NUMBER");
}
else
{
System.out.println(num+" IS NOT PRIME PALINDROME NUMBER");
}
}