Skip to content

Commit 7cd2fd3

Browse files
curious-vasavicurious-vasavi
committed
Add Day 04 medium level number programs
1 parent 291c66c commit 7cd2fd3

10 files changed

Lines changed: 378 additions & 0 deletions

‎src/number_Programming/medium/day_04/CheckFibonacci.java‎

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class CheckFibonacci
4+
{
5+
public static boolean isFibonacci(int num)
6+
{
7+
if(num ==0 || num == 1)
8+
return true;
9+
int firstNum = 0;
10+
int secondNum = 1;
11+
int sum = 0;
12+
for(int i = 1;i<= num ; i++)
13+
{
14+
sum = firstNum + secondNum;
15+
firstNum = secondNum;
16+
secondNum = sum;
17+
18+
if(sum == num)
19+
return true;
20+
}
21+
return false;
22+
}
23+
public static void display(int num)
24+
{
25+
if(isFibonacci(num))
26+
System.out.println(num + " is a fibonacci number");
27+
else
28+
System.out.println(num + " is not a fibonacci number");
29+
}
30+
31+
public static void main(String[] args) {
32+
Scanner sc = new Scanner(System.in);
33+
System.out.println("Enter a number : ");
34+
int num = sc.nextInt();
35+
display(num);
36+
sc.close();
37+
}
38+
}

‎src/number_Programming/medium/day_04/LargestDigit.java‎

Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
package number_Programming.medium.day_04;
2+
3+
import java.util.Scanner;
4+
5+
public class LargestDigit
6+
{
7+
public static void main(String[] args)
8+
{
9+
Scanner sc = new Scanner(System.in);
10+
System.out.println("Enter a number : ");
11+
int num = sc.nextInt();
12+
largestDigit(num);
13+
sc.close();
14+
15+
}
16+
public static void largestDigit(int num)
17+
{
18+
int large = 0;
19+
while(num > 0)
20+
{
21+
int lastDigit = num % 10;
22+
if(lastDigit > large)
23+
{
24+
large = lastDigit;
25+
}
26+
num = num / 10;
27+
}
28+
System.out.println("The largest digit is : " + large);
29+
}
30+
}

‎src/number_Programming/medium/day_04/NextPrime.java‎

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class NextPrime
4+
{
5+
public static boolean checkPrime(int num)
6+
{
7+
int count = 0;
8+
for(int i = 1 ; i<= num ; i++)
9+
{
10+
if(num % i == 0)
11+
{
12+
count++;
13+
}
14+
}
15+
return count == 2;
16+
}
17+
public static void next(int num)
18+
{
19+
int count = 0;
20+
for(int i = num + 1; ; i++)
21+
{
22+
int next = i;
23+
if(checkPrime(next))
24+
{
25+
System.out.println("The next prime number of " + num + " is " + next);
26+
break;
27+
}
28+
}
29+
}
30+
public static void main(String[] args) {
31+
Scanner sc = new Scanner(System.in);
32+
System.out.println("Enter a number : ");
33+
int num = sc.nextInt();
34+
next(num);
35+
sc.close();
36+
}
37+
38+
}

‎src/number_Programming/medium/day_04/NthFibonacci.java‎

Lines changed: 38 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,38 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class NthFibonacci
4+
{
5+
public static boolean isFibonacci(int num)
6+
{
7+
if(num ==0 || num == 1)
8+
return true;
9+
int firstNum = 0;
10+
int secondNum = 1;
11+
int sum = 0;
12+
for(int i = 1;i<= num ; i++)
13+
{
14+
sum = firstNum + secondNum;
15+
firstNum = secondNum;
16+
secondNum = sum;
17+
18+
if(sum == num)
19+
return true;
20+
}
21+
return false;
22+
}
23+
public static void display(int num)
24+
{
25+
if(isFibonacci(num))
26+
System.out.println(num + " is a fibonacci number");
27+
else
28+
System.out.println(num + " is not a fibonacci number");
29+
}
30+
31+
public static void main(String[] args) {
32+
Scanner sc = new Scanner(System.in);
33+
System.out.println("Enter a number : ");
34+
int num = sc.nextInt();
35+
display(num);
36+
sc.close();
37+
}
38+
}

‎src/number_Programming/medium/day_04/NthPrimeNumber.java‎

Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class NthPrimeNumber
4+
{
5+
public static boolean prime(int n)
6+
{
7+
int count= 0;
8+
for(int i = 1;i<=n;i++)
9+
{
10+
if(n%i==0)
11+
count++;
12+
}
13+
return count == 2;
14+
}
15+
public static void nthPrime(int n)
16+
{
17+
int count = 0;
18+
for(int i = 1;true;i++)
19+
{
20+
int num = i;
21+
if(prime(num))
22+
{
23+
count++;
24+
}
25+
if(count == n)
26+
{
27+
System.out.println("The " + n +"th prime number is " + num);
28+
break;
29+
}
30+
}
31+
}
32+
public static void main(String[] args)
33+
{
34+
Scanner sc = new Scanner(System.in);
35+
System.out.println("Enter nth number : ");
36+
int num = sc.nextInt();
37+
nthPrime(num);
38+
sc.close();
39+
}
40+
}

‎src/number_Programming/medium/day_04/PowerToTheCountOfDigits.java‎

Lines changed: 43 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,43 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class PowerToTheCountOfDigits
4+
{
5+
public static int count(int num)
6+
{
7+
int count = 0;
8+
while(num > 0)
9+
{
10+
num = num / 10;
11+
count++;
12+
}
13+
return count;
14+
}
15+
public static int exponential(int base,int power)
16+
{
17+
int expo = 1;
18+
for(int i = 1;i<=power;i++)
19+
{
20+
expo = expo * base;
21+
}
22+
return expo;
23+
}
24+
public static void exponentialOfEachDigit(int num)
25+
{
26+
int power = count(num);
27+
while(num > 0)
28+
{
29+
int ld = num % 10;
30+
int expo = exponential(ld,power);
31+
System.out.println(ld + " to the power of " + expo );
32+
num = num / 10;
33+
}
34+
}
35+
public static void main(String[] args) {
36+
Scanner sc = new Scanner(System.in);
37+
System.out.println("Enter a number : ");
38+
int num = sc.nextInt();
39+
exponentialOfEachDigit(num);
40+
sc.close();
41+
}
42+
43+
}

‎src/number_Programming/medium/day_04/SmallestDigit.java‎

Lines changed: 27 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class SmallestDigit
4+
{
5+
public static void main(String[] args) {
6+
Scanner sc = new Scanner(System.in);
7+
System.out.println("Enter a number : ");
8+
int num = sc.nextInt();
9+
smallestDigit(num);
10+
sc.close();
11+
}
12+
public static void smallestDigit(int num)
13+
{
14+
int smallest = 9;
15+
while(num > 0)
16+
{
17+
int ld = num % 10;
18+
if(ld<smallest)
19+
{
20+
smallest = ld;
21+
}
22+
num = num / 10;
23+
}
24+
System.out.println("The smallest Digit in the number : " + smallest);
25+
}
26+
27+
}

‎src/number_Programming/medium/day_04/SumOfEvenDigits.java‎

Lines changed: 31 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,31 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class SumOfEvenDigits
4+
{
5+
public static void sumOfEven(int num)
6+
{
7+
int sum = 0;
8+
boolean hasEven = false;
9+
while(num > 0)
10+
{
11+
int ld = num % 10;
12+
if(ld % 2 == 0)
13+
{
14+
sum = sum + ld;
15+
hasEven = true;
16+
}
17+
num = num/10;
18+
}
19+
if(hasEven)
20+
System.out.println("The sum of the even digits is " + sum);
21+
else
22+
System.out.println("No even digits present in the number");
23+
}
24+
public static void main(String[] args) {
25+
Scanner sc = new Scanner(System.in);
26+
System.out.println("Enter a number:");
27+
int num = sc.nextInt();
28+
sumOfEven(num);
29+
sc.close();
30+
}
31+
}

‎src/number_Programming/medium/day_04/SumOfExponentialOfEachDigit.java‎

Lines changed: 46 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,46 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class SumOfExponentialOfEachDigit
4+
{
5+
public static int count(int num)
6+
{
7+
int count = 0;
8+
while(num > 0)
9+
{
10+
num = num / 10;
11+
count++;
12+
}
13+
return count;
14+
}
15+
public static int exponential(int power,int base)
16+
{
17+
int expo = 1;
18+
for(int i = 1;i<=power;i++)
19+
{
20+
expo = expo * base;
21+
}
22+
return expo;
23+
24+
}
25+
public static void sumOfExponential(int num)
26+
{
27+
int power = count(num);
28+
int sum=0;
29+
while(num > 0)
30+
{
31+
int ld = num % 10;
32+
int expo = exponential(power, ld);
33+
sum = sum + expo;
34+
num = num/10;
35+
}
36+
System.out.println("The sum of Exponential is " + sum);
37+
}
38+
public static void main(String[] args)
39+
{
40+
Scanner sc = new Scanner(System.in);
41+
System.out.println("Enter a number : ");
42+
int num = sc.nextInt();
43+
sumOfExponential(num);
44+
sc.close();
45+
}
46+
}

‎src/number_Programming/medium/day_04/SumOfTheCountOfOddDigits.java‎

Lines changed: 47 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,47 @@
1+
package number_Programming.medium.day_04;
2+
import java.util.*;
3+
public class SumOfTheCountOfOddDigits
4+
{
5+
public static int count(int num)
6+
{
7+
int count = 0;
8+
while(num > 0)
9+
{
10+
num = num/10;
11+
count++;
12+
}
13+
return count;
14+
}
15+
public static int exponential(int base,int power)
16+
{
17+
int expo = 1;
18+
for(int i = 1;i<=power;i++)
19+
{
20+
expo = expo * base;
21+
}
22+
return expo;
23+
}
24+
public static void SumOfExpoOfOddDigit(int num)
25+
{
26+
int power = count(num);
27+
int sum = 0;
28+
while(num > 0)
29+
{
30+
int ld = num % 10;
31+
if(ld%2 != 0)
32+
{
33+
int expo = exponential(ld, power);
34+
sum = sum + expo;
35+
}
36+
num = num / 10;
37+
}
38+
System.out.println("The sum Of exponential of odd digits is " + sum);
39+
}
40+
public static void main(String[] args) {
41+
Scanner sc = new Scanner(System.in);
42+
System.out.println("Enter a number : ");
43+
int num = sc.nextInt();
44+
SumOfExpoOfOddDigit(num);
45+
sc.close();
46+
}
47+
}

0 commit comments

Comments
 (0)