Add Day 02 – Medium level number programs

Author: curious-vasavi

src/number_Programming/medium/day_02/CountDigits.java

@@ -0,0 +1,22 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class CountDigits
+{
+	public static int count(int num)
+	{
+		int count = 0;
+		while(num>0)
+		{
+			num= num/10;
+			count++;
+		}
+		return count;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		System.out.println("The count of digits in the number :" + count(num));
+		sc.close();
+	}
+}

src/number_Programming/medium/day_02/EvenDigits.java

@@ -0,0 +1,26 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+// wap to print even digits in a given number
+public class EvenDigits 
+{
+	public static void even(int num)
+	{
+		System.out.println("The even digits in the given number are : ");
+		while(num>0)
+		{
+			int ld = num % 10;
+			if(ld % 2 == 0)
+			{
+				System.out.println(ld);
+			}
+			num = num / 10;
+		}
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		even(num);
+		sc.close();
+	}
+}

src/number_Programming/medium/day_02/MultiplicationTable.java

@@ -0,0 +1,22 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class MultiplicationTable 
+{
+	public static void multiplication(int num)
+	{
+		for(int i = 1;i<=10;i++)
+		{
+			int res = num * i;
+			System.out.println(num + " X " + i + " = " + res);
+		}
+	}
+	public static void main(String[] args) 
+	{
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number ..");
+		int num = sc.nextInt();
+		System.out.println(num + " Table");
+		multiplication(num);
+		sc.close();
+	}
+}

src/number_Programming/medium/day_02/PrimeOrNot.java

@@ -0,0 +1,32 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class PrimeOrNot
+{
+	public static int checkPrime(int num)
+	{
+		int count = 0;
+		for(int i = 1;i<=num;i++)
+		{
+			if(num % i == 0)
+			{
+				count++;
+			}
+		}
+		return count ;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		int count = checkPrime(num);
+		if(count == 2)
+		{
+			System.out.println(num + " is a prime number");
+		}
+		else
+		{
+			System.out.println(num + " is not a prime number");
+		}
+		sc.close();
+	}
+}

src/number_Programming/medium/day_02/ProductOfEvenOddFactors.java

@@ -0,0 +1,38 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class ProductOfEvenOddFactors 
+{
+	public static void product(int num)
+	{
+		int evenProd = 1;
+		int oddProd = 1;
+		System.out.println("The factors of " + num + " are : ");
+		for(int i = 1;i<=num;i++)
+		{
+			if(num % i == 0)
+			{
+				System.out.println(i+" ");
+				if(i % 2 == 0)
+				{
+					evenProd = evenProd * i;
+				}
+				else
+				{
+					oddProd = oddProd * i;
+				}
+			}
+		}
+		System.out.println("The product of even Factors is : "+evenProd);
+		System.out.println("The product of odd Factors is : " + oddProd);
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		product(num);
+		sc.close();
+//		int result = product(num);
+//		System.out.println("The product of even Products and ");
+		
+	}
+}

src/number_Programming/medium/day_02/ProductOfFactors.java

@@ -0,0 +1,37 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class ProductOfFactors
+{
+	public static void factors(int num)
+	{
+		for(int i = 1;i<=num;i++)
+		{
+			if(num % i== 0)
+			{
+				System.out.println(i+" ");
+			}
+		}
+	}
+	public static int product(int num)
+	{
+		int product = 1;
+		for(int i = 1;i<=num;i++)
+		{
+			if(num % i== 0)
+			{
+				product = product * i;
+			}
+		}
+		return product;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		System.out.println("The factors of the number are : ");
+		factors(num);
+		int result = product(num);
+		System.out.println("The product of the factors is " + result);
+		sc.close();
+	}
+}

src/number_Programming/medium/day_02/ProductOfPrimeNumbersm_n.java

@@ -0,0 +1,48 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class ProductOfPrimeNumbersm_n 
+{
+	public static boolean checkPrime(int num)
+	{
+		if(num<2)
+	        return false;
+		for(int i = 2;i<=num/2;i++)
+// any number greater than num/2 can divide num evenly 
+//			so checking until half saves time and iteration
+//			however the time complexity of the this is O(n).
+//			for larger number we con't use this logic we need to use Math.sqrt() mmethod if
+//			it's without inbuilt methods we can use i * i<=num/2 also .
+//			which gives u O(V^2(n)) complexity
+		{
+			if(num%i==0)
+			{
+				return false;
+			}	
+		}
+		return true;
+	}
+	public static int product(int m , int n)
+	{
+		int product = 1;
+		System.out.println("The pime numbers are:");
+		for(int i = m ;i<=n;i++)
+		{
+			if(checkPrime(i))
+			{
+				System.out.println(i+" ");
+				product = product*i;
+			}
+		}
+		return product;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter lowerbound : ");
+		int m = sc.nextInt();
+		System.out.println("Enter upperbound : ");
+		int n = sc.nextInt();
+		System.out.println("The product of the prime numbers between "+ m + " and " + n + " is " + product(m, n));
+		
+	}
+
+}

src/number_Programming/medium/day_02/SumOfEvenOddFactors.java

@@ -0,0 +1,35 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class SumOfEvenOddFactors 
+{
+	public static void factors(int num)
+	{
+		int evenSum = 0;
+		int oddSum = 0;
+		System.out.println("The factors of " + num + " are : ");
+		for(int i = 1;i<=num;i++)
+		{
+			if(num % i == 0)
+			{
+				System.out.println(i + " ");
+				if(i % 2 == 0)
+				{
+					evenSum += i;
+				}
+				if(i % 2 != 0)
+				{
+					oddSum += i;
+				}
+			}
+		}
+		System.out.println("The sum EvenFactors is : " + evenSum);
+		System.out.println("The sum of OddFactors is : "+ oddSum);
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System .in);
+		System.out.println("Enter a number : ");
+		int num = sc.nextInt();
+		factors(num);
+		sc.close();
+	}
+}

src/number_Programming/medium/day_02/SumOfFactors.java

@@ -0,0 +1,39 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+public class SumOfFactors
+{
+	public static void factor(int num)
+	{
+		System.out.println("The factors are ..");
+		for(int i = 1;i<=num;i++)
+		{
+			if(num %i==0)
+			{
+				System.out.println(i+" ");
+			}
+			System.out.println();
+		}
+	}
+	public static int sum(int num)
+	{
+		int sum = 0;
+		for(int i = 0;i<=num;i++)
+		{
+			if(num % i == 0)
+			{
+				sum = sum + i;
+			}
+		}
+		return sum;
+	}
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter a number..");
+		int num = sc.nextInt();
+		factor(num);
+		int sum = sum(num);
+		System.out.println("The sum of the factors is " + sum);
+		sc.close();
+	}
+
+}

src/number_Programming/medium/day_02/SumOfPrimeNumbersm_n.java

@@ -0,0 +1,43 @@
+package number_Programming.medium.day_02;
+import java.util.*;
+//wap to print the sum of prime numbers form range m to n
+public class SumOfPrimeNumbersm_n
+{
+	public static boolean checkPrime(int num)
+	{
+		if(num<2)
+			return false;
+		for(int i = 2;i<=num/2;i++)
+		{
+			if(num % 2 == 0)
+				return false;
+		}
+		return true;
+	}
+	 public static int sumOfPrime(int m ,int n)
+	 {	
+		 int sum = 0;
+		 System.out.println("The prime numbers are :");
+		for(int i = m;i<=n;i++)
+		{
+			if(checkPrime(i))
+			{
+				System.out.println(i + " ");
+
+				sum = sum + i;
+			}
+		}
+		return sum;
+	 }
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		System.out.println("Enter the upper bound : ");
+		int m = sc.nextInt();
+		System.out.println("Enter the lower bound : ");
+		int n = sc.nextInt();
+		int sum = sumOfPrime(m, n);
+		System.out.println("Sum of the prime numbers present in the range of " +
+		m + " and " + n + " is " + sum);
+		sc.close();	
+	}
+}