Write a method called mult30 that takes a single integer parameter that is great

Question

Write a method called mult30 that takes a single integer parameter that is greater than or equal to 0, and calculates x n by using the following recursive formula: mult30 is to be a recursive method. Note that you cannot use Math.pow in your solution to this recursive method Hint: In a way similar to taking the recursive formula for factorial: O-1 n!n (n-1) and rewriting it as factorial(0-0 factorial(1)-1 factorial(3)-3 factorial(2)-326 factoriall4) 4 factorial 3)-4 6 24 factorial(5) - 5 factoriak4)- 24-120 factorialkn)-n factorialn-1) then writing the following method name, data type, and input parameter as the Java code

Explanation / Answer

mult3(int n) {
    if ( n == 0)
        return 0;
    if ( n == 1)
        return x;
    return x + mult(n-1);
}

I hope this helps you :)

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.