Add Day 08 advance level number programs

Author: curious-vasavi

src/number_Programming/advance/day_08/CollatzSequence.java

@@ -0,0 +1,27 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+public class CollatzSequence
+{
+	public static void collatzSequence(int n)
+	{
+		while(n != 1)
+		{
+			System.out.print(n + " ");
+			if(n % 2 == 0)
+				n = n/2;
+			else
+				n = 3*n+1;
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int n = sc.nextInt();
+		System.out.print("Collatz Sequence : " );
+		collatzSequence(n);
+		System.out.print(1);
+		sc.close();
+	}
+
+}

src/number_Programming/advance/day_08/FactorialSeriesNthTerm.java

@@ -0,0 +1,24 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class FactorialSeriesNthTerm 
+{
+	public static int factorial(int n)
+	{
+		int fact = 1;
+		for(int i = 1; i<=n;i++)
+		{
+			fact = fact*i;
+			System.out.print(fact + " ");
+		}
+		return fact;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter nth value : ");
+		int num = sc.nextInt();
+		factorial(num);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_08/HCFOfThreeNumbers.java

@@ -0,0 +1,38 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class HCFOfThreeNumbers
+{
+	public static int hcf(int n1,int n2,int n3)
+	{
+		int range = 0;
+		if(n1<=n2 && n1<=n3)
+			range = n1;
+		else if(n2<n3)
+			range = n2;
+		else
+			range = n3;
+		int hcf = 0;
+		for(int i = 1;i<=range;i++)
+		{
+			if(n1 % i == 0 && n2 % i == 0 && n3 % i ==0)
+			{
+				hcf = i;
+			}
+		}
+		System.out.println("The highest common factor of " + n1 + ", " + n2 + " and " + n3 + " is " + hcf);
+		return hcf;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter n1 value : ");
+		int n1 = sc.nextInt();
+		System.out.println("Enter n2 value : ");
+		int n2 =sc.nextInt();
+		System.out.println("Enter n3 value : ");
+		int n3 = sc.nextInt();
+		hcf(n1, n2, n3);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_08/LucasSeries.java

@@ -0,0 +1,30 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class LucasSeries 
+{
+
+	public static void lucas(int n)
+	{
+		int a = 2;
+		int b = 1;
+		int c = 0;
+		System.out.println("First " +n + "terms in lucas series");
+		for(int i = 1;i<=n;i++)
+		{
+			System.out.println(a);
+			c = a+b;
+			a=b;
+			b=c;
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter n value : ");
+		int n = sc.nextInt();
+		lucas(n);
+		sc.close();
+	}
+
+}

src/number_Programming/advance/day_08/NThMegaPrimeNumber.java

@@ -0,0 +1,60 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class NThMegaPrimeNumber 
+{
+	public static boolean checkPrime(int num)
+	{
+		if(num<2)
+			return false;
+		int count = 0;
+		for(int i = 1;i<=num;i++)
+		{
+			if(num%i==0)
+			count++;
+		}
+		return count == 2;
+	}
+	public static boolean megaPrime(int num)
+	{
+		if(!checkPrime(num))
+		{
+			return false;
+		}
+		
+			while(num>0)
+			{
+				int ld = num % 10;
+				if(!checkPrime(ld))
+				{
+					return false;
+				}
+				num = num/10;
+			}
+		return true;
+	}
+	public static void nthMegaPrime(int n)
+	{
+		int count = 0;
+		for(int i = 2; ;i++)
+		{
+			if(megaPrime(i))
+			{
+				count++;
+			}
+			if(count == n)
+			{
+				System.out.println("The "+ n +"th MegaPrime number is " + i);
+				break;
+			}
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter nth value : ");
+		int n = sc.nextInt();
+		nthMegaPrime(n);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_08/NthAutomorphicNumber.java

@@ -0,0 +1,57 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class NthAutomorphicNumber
+{
+	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 place = 1;
+		int digit = count(num);
+		for(int i = 1;i<=digit;i++)
+		{
+			place = place*10;
+		}
+		return place;
+	}
+	public static boolean checkAutomorphicNumber(int num)
+	{
+		int place = placeValue(num);
+		int square = num * num;
+		int endDigit=square%place;
+		return endDigit == num;
+	}
+	public static void nthAutomorphicNumber(int n)
+	{
+		int count = 0;
+		for(int i = 1; ; i++)
+		{
+			if(checkAutomorphicNumber(i))
+			{
+				count++;
+			}
+			if(count == n)
+			{
+				System.out.println("The " +n+"th Automorphic number is " + i);
+				break;
+			}
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+        System.out.println("Enter nth value : ");
+        int n = sc.nextInt();
+        nthAutomorphicNumber(n);
+        sc.close();
+	}
+}

src/number_Programming/advance/day_08/NthEvilNumber.java

@@ -0,0 +1,59 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class NthEvilNumber 
+{
+	public static int numToBinary(int num)
+	{
+		int binary = 0;
+		int place = 1;
+		while(num>0)
+		{
+			int rem = num%2;
+			binary = binary+(rem*place);
+			place = place * 10;
+			num = num /2;
+		}
+		return binary;
+	}
+	public static boolean isEvil(int num)
+	{
+		int binary = numToBinary(num);
+		int count = 0;
+		while(binary>0)
+		{
+			int ld = binary % 10;
+			if(ld == 1)
+			{
+				count++;
+			}
+			binary = binary/10;
+		}
+		return count % 2 == 0 ;
+	}
+	public static void nthEvilNumber(int n)
+	{
+		int count = 0;
+		for(int i = 1; ;i++)
+		{
+			if(isEvil(i))
+			{
+				count++;
+			}
+			if(count == n)
+			{
+				System.out.println("The " + n +"th Evil number is " + i);
+				break;
+			}
+		}
+	}
+	public static void main(String[] args) 
+	{
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter nth value : ");
+		int n = sc.nextInt();
+		nthEvilNumber(n);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_08/NthHarshadNumber.java

@@ -0,0 +1,42 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class NthHarshadNumber
+{
+	public static boolean sum(int num)
+	{
+		int temp = num;
+		int sum = 0;
+		while(num>0)
+		{
+			int ld = num%10;
+			sum = sum+ld;
+			num = num/10;
+		}
+		return temp % sum == 0;
+	}
+	public static void nthHarshadNumber(int n)
+	{
+		int count = 0;
+		for(int i = 1; ; i++)
+		{
+			if(sum(i))
+			{
+				count++;
+			}
+			if(count == n)
+			{
+				System.out.println("The " +  n + "th Harshad number is " + i);
+				break;
+			}
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter nth value : ");
+		int n = sc.nextInt();
+		nthHarshadNumber(n);
+		sc.close();
+	}
+}

src/number_Programming/advance/day_08/NthMagicNumber.java

@@ -0,0 +1,51 @@
+package number_Programming.advance.day_08;
+
+import java.util.Scanner;
+
+public class NthMagicNumber 
+{
+	public static int sumOfNumber(int num) 
+	{
+		int sum = 0;
+		while(num>0)
+		{
+			int ld = num % 10;
+			sum = sum + ld;
+			num = num/10;
+		}
+		return sum;
+	}
+	public static boolean magicNumber(int num)
+	{
+		int result = num;
+		while(result > 9)
+		{
+			result = sumOfNumber(result);
+		}
+		return result == 1;
+	}
+	public static void nthMagicNumber(int n)
+	{
+		int count = 0;
+		for(int i = 1;;i++)
+		{
+			if(magicNumber(i))
+			{
+				count++;
+			}
+			if(count == n)
+			{
+				System.out.println("The " + n + "th Magic Number is " + i);
+				break;
+			}
+		}
+	}
+	public static void main(String[] args) 
+	{
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter nth value: ");
+		int num = sc.nextInt();
+		nthMagicNumber(num);
+		sc.close();
+	}
+}