Given two number x and n, find n-th root of x.

**Examples:**

Input : 5 2 Output : 2.2360679768025875 Input : x = 5, n = 3 Output : 1.70997594668

In order to calculate nth root of a number, we can use the following procedure.

- If x lies in the range
**[0, 1)**then we set the lower limit**low = x**and upper limit**high = 1**, because for this range of numbers the nth root is always greater than the given number and can never exceed 1.

eg- - Otherwise, we take
**low = 1**and**high = x**. - Declare a variable named
**epsilon**and initialize it for accuracy you need.

Say epsilon=0.01, then we can guarantee that our guess for nth root of the given number will be

correct up to 2 decimal places. - Declare a variable guess and initialize it to
**guess=(low+high)/2.** - Run a loop such that:
- if the
**absolute error**of our**guess**is more than**epsilon**then do:- if
**guess**, then^{n}> x**high=x** - else
**low=x** - Making a new better
**guess**i.e.,**guess=(low+high)/2.**

- if
- If the
**absolute error**of our**guess**is less than epsilon then exit the loop.

- if the

** Absolute Error:** Absolute Error can be calculated as

**abs(guess**

^{n}-x)## C++

`// C++ Program to find ` `// n-th real root of x ` `#include<bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `void` `findNthRoot(` `double` `x, ` `int` `n) ` `{ ` ` ` `// Initialize boundary values ` `double` `low, high; ` `if` `(x >= 0 and x <= 1) ` `{ ` ` ` `low = x; ` ` ` `high = 1; ` `} ` `else` `{ ` ` ` `low = 1; ` ` ` `high = x; ` `} ` ` ` `// used for taking approximations ` `// of the answer ` `double` `epsilon = 0.00000001; ` ` ` `// Do binary search ` `double` `guess = (low + high) / 2; ` `while` `(` `abs` `((` `pow` `(guess, n)) - x) >= epsilon) ` `{ ` ` ` `if` `(` `pow` `(guess, n) > x) ` ` ` `{ ` ` ` `high = guess ; ` ` ` `} ` ` ` `else` ` ` `{ ` ` ` `low = guess ; ` ` ` `} ` ` ` `guess = (low + high) / 2; ` `} ` ` ` `cout << fixed << setprecision(16) ` ` ` `<< guess; ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `double` `x = 5; ` ` ` `int` `n = 2; ` ` ` `findNthRoot(x, n) ; ` `} ` ` ` `// This code is contributed ` `// by Subhadeep ` |

*chevron_right*

*filter_none*

## Java

`// Java Program to find n-th real root of x ` `class` `GFG ` `{ ` `static` `void` `findNthRoot(` `double` `x, ` `int` `n) ` `{ ` ` ` `// Initialize boundary values ` `double` `low, high; ` `if` `(x >= ` `0` `&& x <= ` `1` `) ` `{ ` ` ` `low = x; ` ` ` `high = ` `1` `; ` `} ` `else` `{ ` ` ` `low = ` `1` `; ` ` ` `high = x; ` `} ` ` ` `// used for taking approximations ` `// of the answer ` `double` `epsilon = ` `0.00000001` `; ` ` ` `// Do binary search ` `double` `guess = (low + high) / ` `2` `; ` `while` `(Math.abs((Math.pow(guess, n)) - x) >= epsilon) ` `{ ` ` ` `if` `(Math.pow(guess, n) > x) ` ` ` `{ ` ` ` `high = guess ; ` ` ` `} ` ` ` `else` ` ` `{ ` ` ` `low = guess ; ` ` ` `} ` ` ` `guess = (low + high) / ` `2` `; ` `} ` ` ` `System.out.println(guess); ` `} ` ` ` `// Driver code ` `public` `static` `void` `main(String[] args) ` `{ ` ` ` `double` `x = ` `5` `; ` ` ` `int` `n = ` `2` `; ` ` ` `findNthRoot(x, n) ; ` `} ` `} ` ` ` `// This code is contributed ` `// by mits ` |

*chevron_right*

*filter_none*

## Python3

`# Python Program to find n-th real root ` `# of x ` ` ` `def` `findNthRoot(x, n): ` ` ` ` ` `# Initialize boundary values ` ` ` `x ` `=` `float` `(x) ` ` ` `n ` `=` `int` `(n) ` ` ` `if` `(x >` `=` `0` `and` `x <` `=` `1` `): ` ` ` `low ` `=` `x ` ` ` `high ` `=` `1` ` ` `else` `: ` ` ` `low ` `=` `1` ` ` `high ` `=` `x ` ` ` ` ` `# used for taking approximations ` ` ` `# of the answer ` ` ` `epsilon ` `=` `0.00000001` ` ` ` ` `# Do binary search ` ` ` `guess ` `=` `(low ` `+` `high) ` `/` `2` ` ` `while` `abs` `(guess ` `*` `*` `n ` `-` `x) >` `=` `epsilon: ` ` ` `if` `guess ` `*` `*` `n > x: ` ` ` `high ` `=` `guess ` ` ` `else` `: ` ` ` `low ` `=` `guess ` ` ` `guess ` `=` `( low ` `+` `high ) ` `/` `2` ` ` `print` `(guess) ` ` ` ` ` `# Driver code ` `x ` `=` `5` `n ` `=` `2` `findNthRoot(x, n) ` |

*chevron_right*

*filter_none*

## C#

`// C# Program to find n-th real root of x ` ` ` `using` `System; ` ` ` `public` `class` `GFG{ ` `static` `void` `findNthRoot(` `double` `x, ` `int` `n) ` `{ ` ` ` `// Initialize boundary values ` `double` `low, high; ` `if` `(x >= 0 && x <= 1) ` `{ ` ` ` `low = x; ` ` ` `high = 1; ` `} ` `else` `{ ` ` ` `low = 1; ` ` ` `high = x; ` `} ` ` ` `// used for taking approximations ` `// of the answer ` `double` `epsilon = 0.00000001; ` ` ` `// Do binary search ` `double` `guess = (low + high) / 2; ` `while` `(Math.Abs((Math.Pow(guess, n)) - x) >= epsilon) ` `{ ` ` ` `if` `(Math.Pow(guess, n) > x) ` ` ` `{ ` ` ` `high = guess ; ` ` ` `} ` ` ` `else` ` ` `{ ` ` ` `low = guess ; ` ` ` `} ` ` ` `guess = (low + high) / 2; ` `} ` ` ` `Console.WriteLine(guess); ` `} ` ` ` `// Driver code ` ` ` `static` `public` `void` `Main (){ ` ` ` `double` `x = 5; ` ` ` `int` `n = 2; ` ` ` `findNthRoot(x, n) ; ` `} ` `} ` ` ` `// This code is contributed by akt_mit ` |

*chevron_right*

*filter_none*

**Output:**

2.2360679768025875

# Explanation of first example with epsilon = 0.01

Since taking too small value of epsilon as taken in our program might not be feasible for

explanation because it will increase the number of steps drastically so for the sake of

simplicity we are taking epsilon = 0.01 The above procedure will work as follows: Say we have to calculate the then x = 5, low = 1, high = 5. Taking epsilon = 0.01First Guess:guess = (1 + 5) / 2 = 3 Absolute error = |3^{2}- 5| = 4 > epsilon guess^{2}= 9 > 5(x) then high = guess --> high = 3Second Guess:guess = (1 + 3) / 2 = 2 Absolute error = |2^{2}- 5| = 1 > epsilon guess^{2}= 4 > 5(x) then low = guess --> low = 2Third Guess:guess = (2 + 3) / 2 = 2.5 Absolute error = |2.5^{2}- 5| = 1.25 > epsilon guess^{2}= 6.25 > 5(x) then high = guess --> high = 2.5 and proceeding so on we will get the correct up to 2 decimal places i.e., = 2.23600456 We will ignore the digits after 2 decimal places since they may or may not be correct.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Floor value Kth root of a number using Recursive Binary Search
- Find square root of number upto given precision using binary search
- Meta Binary Search | One-Sided Binary Search
- Converting a Real Number (between 0 and 1) to Binary String
- Linear Search vs Binary Search
- Interpolation search vs Binary search
- Print path from root to all nodes in a Complete Binary Tree
- Count of root to leaf paths in a Binary Tree that form an AP
- Binary Search
- Binary Search in PHP
- Binary Search a String
- The Ubiquitous Binary Search | Set 1
- Uniform Binary Search
- Binary Search using pthread
- Binary Search In JavaScript
- Binary Search in Java
- Variants of Binary Search
- Randomized Binary Search Algorithm
- A Problem in Many Binary Search Implementations
- Complexity Analysis of Binary Search

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.