Category: Special numbers
-
How to find nth terms in the fibonacci series using Multithreads and BigInteger datatype
This is the third solution to find the ‘nth terms’ in the fibonacci series using BigInteger data type. This program uses the Multithreads concept to find the more than one ‘nth terms’ in the fibonacci series in parallel to save the time.
-
How to find nTh number of Fibonacci series
This is the second solution to find the nTh number of the Fibonacci series using recursion approach.
-
How to find nTh number of Fibonacci series
This is the first solution to find the nTh number of the Fibonacci series.
-
How to check whether a number is Disarium or not
This is the second solution to check the number for Disarium. This solution contains the core logic to evaluate the sum of powers of all digits in descending order of the length of number. The Disarium number is say for a given number 351, evaluate the powers from the left side as power (3 *…
-
How to check whether a number is Armstrong number or not
This is the second solution to check the number for Armstrong. This solution contains the core logic to extract each digit from the given number, in parallel it will compute the sum of the cubes of each digit. The Armstrong number is say for a given number 153, evaluate the powers of cubes from any…
-
How to check whether a number is Armstrong number or not
This is the first solution to check the number for Armstrong. This solution uses String class, and a couple of Character functions to evaluate the sum of the cubes of each digit in a given number. The Armstrong number is say for a given number 153, evaluate the powers of cubes from any side as…
-
How to check whether a number is Disarium or not
This is the first solution to check the number for Disarium. This solution uses String class, and a couple of Character functions to evaluate the sum of powers. The Disarium number is say for a given number 351, evaluate the powers from the left side as power (3 * 1) + power (5 * 2)…
