Write a recursive mathematical definition for computing 2 lifted to power n for a positive integer n

Question

help me to solve this

Answer 1

Please share your attempt while seeking help. All we want to see is whether you tried or not.

Answer 2

thx a lot Martin Taylor 🖤 you just helped me with the next problem 😂🖤

Answer 3

I think that's lifted and not lefted. Probably a power method is all he looking for.

Answer 4

import java.util.Scanner ;
public class TestMax{
public static void main(String[] args) {
Scanner input = new Scanner (System.in );
System.out.println("Enter a non negative number to be the power of 2" );
int power = input.nextInt ();
System.out.println ("result = " + xMethod (power)) ;
}

public static int xMethod(int power) {

if (power < 0)
return 0 ;
else
return 2*xMethod(power-1);
}
}

Answer 5

that's the last code i tried it.. hope you get what i mean

Answer 6

Avinesh Martin Taylor

Answer 7

it finally worked correctly thank you so much Avinesh I've been working on it for hours 😭

Answer 8

Just return 1 instead of 0.

Answer 9

Habo Osman you're welcome

Answer 10

"Write a recursive mathematical definition...“
I‘m not sure why you all are writing code? That does not seem to be what‘s asked.

a_0 = 1
a_n = 2*a_{n-1} , n>=1