FilesExpand file tree

 master

/

PowerOfX.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

48 lines (43 loc) · 949 Bytes

 master

/

PowerOfX.java

Top

File metadata and controls

• Code
• Blame

48 lines (43 loc) · 949 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

package MathPrograms;

import java.util.Scanner;

/*

* if x pow(n) then x(2)(n/2)

* if x pow(n) then x(2)(n-1/2)

*

* */

public class PowerOfX {

public static long xPowN(int x, int n) {

int result = 1;

while (n > 0) {

if (n % 2 == 1)

result = result * x;

x = x * x;

n = n / 2;

}

return result;

}

/* To compute power of multiple numbers...! 2 pow(10 pow(9))

*

* int modularExponentiation(int x,int n,int M)

{

int result=1;

while(n>0)

{

if(n % 2 ==1)

result=(result * x)%M;

x=(x*x)%M;

n=n/2;

}

return result;

}*/

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

System.out.print("Enter the value of x: ");

int x = sc.nextInt();

System.out.print("Enter the power of x: ");

int n = sc.nextInt();

long result = xPowN(x, n);

System.out.println(x + " Power " + n + " = " + result);

sc.close();

}

}