A special positive number whose sum of cubes of its individual digit is equal to that number is called an Armstrong Number. Example #1,The number 153 is an Armstrong number. It can be checked as follow:(1)3 + (5)3 + (3)3 => 1 + 125 + 27 => 153 Example #2,The number 371 is also an …
How to check whether a number is an Armstrong number or not in java? Read More »
The Perfect Number is a special type of positive number. When the number is equal to the sum of its positive divisors excluding the number, it is called a Perfect Number. For example, 28 is the perfect number because when we sum the divisors of 28, it will result in the same number. The divisors of 28 …
How to check whether a number is a perfect number or not in java? Read More »
A Prime number is a number that is divisible by only 1 and itself. A prime number can’t be divided by zero, because numbers divided by zero are undefined. The smallest prime number is 2, which is also the only even prime. Let’s see the logic to check whether a number is a prime number …
How to check whether a number is a prime number or not in java? Read More »
The multiplication of all positive integers which are less than or equal to the given positive number is called the factorial of that given integer number. Example #1, The factorial of the number 5 can be calculated as follow: 1 * 2 * 3 * 4 * 5 = 120 Example #2, The factorial of …
How to calculate the factorial of a given number in java? Read More »
Fibonacci series is a special type of series in which the next number is the sum of the previous two numbers. For example, 1 1 2 3 5 8 13 21…. up to a given number. Solution #1 : Using Recursion FibonacciSeriesWithRecursion.java OUTPUT: Enter number up to which Fibonacci series to print:120 1 1 2 …
How to print a Fibonacci series up to a given number in Java? Read More »