You can continue to work in the previous Calculator class for this exercise. For this version, more complicated calculations need to be implemented. There might be different solutions for the same problem. You can look online for some help but think of what was said last WPO regarding learning goals and plagiarism!
Make sure the following elements are present in your class:
- Determine if a number is a prime number in the method
isPrime(int number). - Calculate the Fibonacci number at place N using the method
fibonacciNumber(int N). The Fibonacci number is the sum of the two previous Fibonacci numbers. Assume the indexing of the series starts with 0. - Determine if a number is an Armstrong number for a given power with
armstrongNumbers(int number, int power). For a given power $$X$$ and a number $$ABCD$$, where $$A$$, $$B$$, $$C$$, $$D$$ are digits, a number is an Armstrong number if $$ ABCD = A^X + B^X + C^X + D^X $$. Note that this number need not be four digits! - Calculate the factorial of a number using the method
factorial(ind number) - Reverse the order of all the digits in a number. Make sure the end result is still a number! Do this in the method
numberReversal(int number) - Given two arrays of integers, find the index of the two numbers that give the largest product. Implement this in the method
productMaximiser(int[] a, int[] b). The output should be an array with two integers, each integer is the index of thier respective arrays.
Again no main() method is needed for this exercise!
Adapted from Calculator - CafePress1