Add Day 06 medium level number Programs

Author: curious-vasavi

src/number_Programming/advance/day_06/ArmstrongNumber.java

@@ -0,0 +1,55 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class ArmstrongNumber 
+{
+	public static int count(int num)
+	{
+		int count = 0;
+		while(num>0)
+		{
+			num = num/10;
+			count++;
+		}
+		return count;
+	}
+	public static int exponential(int base,int power)
+	{
+		int expo = 1;
+		for(int i = 1;i<=power;i++)
+		{
+			expo = expo * base;
+		}
+		return expo;
+		
+	}
+	public static int sumOfexponential(int num)
+	{
+		int power = count(num);
+		int sum = 0;
+		while(num>0)
+		{
+			int ld = num%10;
+			int expo = exponential(ld, power);
+			sum = sum + expo;
+			num = num/10;
+		}
+		return sum;
+	}
+	public static void checkArmstrong(int num)
+	{
+		int sum = sumOfexponential(num);
+		if(sum == num)
+			System.out.println(num + " is a Armstrong number ");
+		else
+			System.out.println(num + " is not a Armstrong number");
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		checkArmstrong(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/AutomorphicNumber.java

@@ -0,0 +1,45 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class AutomorphicNumber
+{
+	public static int count(int num)
+	{
+		int count = 0;
+		while(num>0)
+		{
+			num =num/10;
+			count++;
+		}
+		return count;
+	}
+	public static int placeValue(int num)
+	{
+		int count = count(num);
+		int place = 1;
+		for(int i = 1;i<=count;i++)
+		{
+			place = place*10;
+		}
+		return place;
+	}
+	public static void checkAutomorphic(int num)
+	{
+		int place = placeValue(num);
+		int square = num * num;
+		int endDigit = square%place;
+		if(endDigit==num)
+			System.out.println(num + " is a automorphhic number");
+		else
+			System.out.println(num + " is not a automorphic number");
+	}
+	public static void main(String[] args)
+	{
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		checkAutomorphic(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/EvilNumber.java

@@ -0,0 +1,42 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class EvilNumber 
+{
+	public static int numToBinary(int num)
+	{
+		int place = 1;
+		int binary = 0;
+		while(binary >0)
+		{
+			int rem = num%2;
+		    binary = binary + (rem * place);
+			place = place * 10;
+			num = num / 2;
+		}
+		return binary;
+	}
+	public static void evilNumber(int num)
+	{
+		int binary = numToBinary(num);
+		int count = 0;
+		if(binary>0)
+		{
+			int ld = binary%10;
+			if(ld == 1)
+				count++;
+		}
+		if(count%2==0)
+			System.out.println(num + " is a evil number");
+		else
+			System.out.println(num + " is not a evil number");	
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		evilNumber(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/HarshadNumber.java

@@ -0,0 +1,33 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class HarshadNumber 
+{
+	public static int sumOfDigits(int num)
+	{
+		int sum = 0;
+		while(num>0)
+		{
+			int ld = num % 10;
+			sum = sum + ld;
+			num = num/10;
+		}
+		return sum;
+	}
+	public static void checkHarshadNumber(int num)
+	{
+		int sum = sumOfDigits(num);
+		if(num % sum == 0)
+			System.out.println(num + " is a Harshad Number");
+		else
+			System.out.println(num + " is not a Harshad Number");
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		checkHarshadNumber(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/MagicNumber.java

@@ -0,0 +1,37 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class MagicNumber
+{
+	public static int sumOfDigits(int num)
+	{
+		int sum = 0;
+		while(num>0)
+		{
+			int ld = num%10;
+			sum = sum+ld;
+			num = num/10;
+		}
+		return sum;
+	}
+	public static boolean isMagic(int sum)
+	{
+		int result = sum;
+		while(result>9)
+		{
+			result = sumOfDigits(result);
+		}
+		return result ==1;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		if(isMagic(num))
+			System.out.println(num + " is a magic number");
+		else
+			System.out.println(num + " is not a magic number");
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/MegaPrime.java

@@ -0,0 +1,48 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class MegaPrime
+{
+	public static boolean checkPrime(int num)
+	{
+		if(num<2)
+		{
+			return false;
+		}
+		for(int i = 1;i<= num/2;i++)
+		{
+			if(num % i == 0)
+			{
+				return false;
+			}
+		}
+		return true;
+	}
+	public static void checkMegaPrime(int num)
+	{
+		if(!checkPrime(num))
+		{
+			System.out.println(num + " is not a mega prime");
+			return;
+		}
+		int temp = num;
+			while(temp>0)
+			{
+				int ld = temp % 10;
+				if(!checkPrime(ld))
+				{
+					System.err.println(num + " is not a mega prime");
+				}
+				temp = temp/10;
+			}	
+			System.out.println(num + " is a mega prime");
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		checkMegaPrime(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/NeonNumber.java

@@ -0,0 +1,36 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class NeonNumber 
+{
+	public static int squreOfDigits(int num)
+	{
+		int square = num * num;
+		int sum = 0;
+		while(square>0)
+		{
+			int ld = square%10;
+			sum = sum + ld;
+			square = square/10;
+		}
+		return sum;
+	}
+	public static void neonNumber(int num)
+	{
+		int square = squreOfDigits(num);
+		if(square == num) {
+			System.out.println(num + " is a neon number");
+		}
+		else
+			System.out.println(num + " is not a neon number");
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number:");
+		int num = sc.nextInt();
+		neonNumber(num);
+		sc.close();
+	}
+
+}

src/number_Programming/advance/day_06/Palindrome.java

@@ -0,0 +1,36 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class Palindrome 
+{
+	public static int reverse(int num)
+	{
+		int reverse = 0;
+		while(num>0)
+		{
+			int ld = num%10;
+			reverse = reverse * 10 + ld;
+			num = num/10;
+		}
+		return reverse;
+	}
+	public static void palindrome(int num)
+	{
+		if(num == reverse(num))
+		{
+			System.out.println(num + " is a palindrome number");
+		}
+		else
+		{
+			System.out.println(num + " is not a palindrome number");
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		palindrome(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_06/PerfectNumber.java

@@ -0,0 +1,37 @@
+package number_Programming.advance.day_06;
+
+import java.util.Scanner;
+
+public class PerfectNumber 
+{
+	public static int sumOfFactor(int num)
+	{
+		int sum = 0;
+		for(int i = 1;i<=num/2;i++)
+		{
+			if(num%i==0)
+			{
+				sum = sum + i;
+			}
+		}
+		return sum;
+	}
+	public static void perfectNumber(int num)
+	{
+		int sum = sumOfFactor(num);
+		if(sum == num)
+		{
+			System.out.println(num + " is a perfect Number");
+		}
+		else
+			System.out.println(num + " is not a perfect number");
+	}
+	public static void main(String[] args)
+	{
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter the number:");
+		int num = sc.nextInt();
+		perfectNumber(num);
+		sc.close();
+	}
+}