Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
20 views8 pages

Numbers Program

The document contains multiple Java classes that check for various types of numbers, including Pronic, Spy, Niven, Prime Palindrome, Co-Prime, Duck, Armstrong, Perfect, Buzz, and Dudeney numbers. Each class includes a method to perform the respective check and a main method to execute the program. The classes utilize user input and basic mathematical operations to determine the properties of the numbers.

Uploaded by

jreeva26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
20 views8 pages

Numbers Program

The document contains multiple Java classes that check for various types of numbers, including Pronic, Spy, Niven, Prime Palindrome, Co-Prime, Duck, Armstrong, Perfect, Buzz, and Dudeney numbers. Each class includes a method to perform the respective check and a main method to execute the program. The classes utilize user input and basic mathematical operations to determine the properties of the numbers.

Uploaded by

jreeva26
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 8

Q.

1-

/**
* Write a description of class PronicNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class PronicNumber
{
public void pronicCheck()
{
Scanner in = new Scanner(System.in);
System.out.print("Enter the number to check: ");
int num = in.nextInt();

boolean isPronic = false;

for (int i = 1; i <= num - 1; i++)


{
if (i * (i + 1) == num)
{
isPronic = true;
break;
}
}

if (isPronic)
System.out.println(num + " is a pronic number");
else
System.out.println(num + " is not a pronic number");
}

public static void main(String args[])


{
PronicNumber PN=new PronicNumber();
PN.pronicCheck();
}
}

Q.2-

/**
* Write a description of class SpyNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class SpyNumber
{
public void spyNumCheck()
{

Scanner in = new Scanner(System.in);

System.out.print("Enter Number: ");


int num = in.nextInt();

int digit, sum = 0;


int orgNum = num;
int prod = 1;

while (num > 0)


{
digit = num % 10;

sum += digit;
prod *= digit;
num /= 10;
}

if (sum == prod)
System.out.println(orgNum + " is Spy Number");
else
System.out.println(orgNum + " is not Spy Number");

public static void main(String args[])


{
SpyNumber SN=new SpyNumber();
SN.spyNumCheck();
}
}

Q.3-

/**
* Write a description of class NivenNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class NivenNumber
{
public void checkNiven()
{
Scanner in = new Scanner(System.in);
System.out.print("Enter number: ");
int num = in.nextInt();
int orgNum = num;

int digitSum = 0;

while (num != 0) {
int digit = num % 10;
num /= 10;
digitSum += digit;
}

if (digitSum != 0 && orgNum % digitSum == 0)


System.out.println(orgNum + " is a Niven number");
else
System.out.println(orgNum + " is not a Niven number");
}

public static void main(String args[])


{
NivenNumber NN=new NivenNumber();
NN.checkNiven();
}
}

Q.4-

/**
* Write a description of class Q14PrimePalin here.
*
* @author (your name)
* @version (a version number or a date)
*/
public class Q14PrimePalin
{
public boolean isPrime(int n)
{
int c = 0;
for (int i = 1; i <= n; i++)
{
if (n % i == 0)
{
c++;
}
}

boolean prime = c == 2;
return prime;
}

public static boolean isPalindrome(int n)


{
int num = n, revNum = 0;
while (num != 0)
{
int digit = num % 10;
num /= 10;
revNum = revNum * 10 + digit;
}

boolean palin = revNum == n;


return palin;
}

public static void main(String args[])


{
int x = 1, count = 0;
while (count < 100)
{
if (isPrime(x) && isPalindrome(x))
{
count++;
System.out.println(x);
}
x++;
}
}
}

Q.5-

/**
* Write a description of class CoPrime here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class CoPrime
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the two numbers:");
int a=sc.nextInt();
int b=sc.nextInt();
int HCF=1;

for(int i=1;i<=a && i<=b; i++)


{
if(a%i==0 && b%i==0)
HCF=i;
}
if(HCF==1)
System.out.println("Number is coprime");
else
System.out.println("Number is not coprime");
}
}

Q.6-

/**
* Write a description of class DuckNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class DuckNumber
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
String str;
int l;
int f;
System.out.println("Enter a Number:");
str=sc.nextLine();
l=str.length();
char ch;
int c=0;
for(int i=0;i<l;i++)
{
ch=str.charAt(i);

if(str.charAt(0)=='0')
{
f=0;
if(str.charAt(i)=='0'&& str.charAt(i+1)==0)
{
c++;
if(c>=2)
f=0;

//System.out.println("Not a duck number");


//break;
}
System.out.println("Not a duck number");
break;
}
else
{
if(str.charAt(i)!='0')
{
f=1;
System.out.println("It is not a duck number");
break;
}
else
{
System.out.println("It is a duck number");
}

}
}

Q.7-

/**
* Write a description of class ArmstrongNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class ArmstrongNumber
{
public static void main(String[] args)
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number:");
int number =sc.nextInt();
int num, d, sum = 0, n = 0;

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


{

for (num = number; num != 0; num /= 10)


{
d = num % 10;
sum += Math.pow(d, n);
}

}
if(sum == number)
System.out.println(number + " is an Armstrong number.");
else
System.out.println(number + " is not an Armstrong number.");
}
}

Q.8-

/**
* Write a description of class PerfectNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class PerfectNumber
{
static int c=0;
static int sum=0;
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the Number:");
int n=sc.nextInt();
for(int i=1;i<=n/2;i++)
{
if(n%i==0)
c++;
sum+=i;
}
if(sum==n)
{
System.out.println("Perfect Number");
}
else
{
System.out.println(" Not a Perfect Number");
}
}
}

Q.9-

/**
* Write a description of class BuzzNumber here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class BuzzNumber
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
System.out.print("Enter p: ");
int p = in.nextInt();
System.out.print("Enter q: ");
int q = in.nextInt();
if (p < q)
{
System.out.println("Buzz Numbers between " + p + " and " + q);
for (int i = p; i <= q; i++)
{
if (i % 10 == 7 || i % 7 == 0)
System.out.println(i);
}
}
else
{
System.out.println("Invalid Inputs!!!");
System.out.println("p should be less than q");
}

}
}

Q.10-

/**
* Write a description of class Dudeney here.
*
* @author (your name)
* @version (a version number or a date)
*/
import java.util.Scanner;
public class Dudeney
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
System.out.print("Enter the number: ");
int n = in.nextInt();

//Check if n is a perfect cube


int cubeRoot = (int)Math.round(Math.cbrt(n));
if (cubeRoot * cubeRoot * cubeRoot == n)
{
//If n is perfect cube then find
//sum of its digits
int s = 0;
int t = n;
while (t != 0)
{
int d = t % 10;
s += d;
t /= 10;
}

if (s == cubeRoot)
{
System.out.println(n + " is a Dudeney number");
}
else {
System.out.println(n + " is not a Dudeney number");
}
}
else {
System.out.println(n + " is not a Dudeney number");
}
}
}

You might also like