Can you use something like this?
Math.pow(n, 1/root);
eg.
Math.pow(25, 1/2) == 5
More Related Contents:
- Calculate distance between two latitude-longitude points? (Haversine formula)
- Unique (non-repeating) random numbers in O(1)?
- How to determine if a point is in a 2D triangle? [closed]
- How do I calculate a point on a circle’s circumference?
- Algorithm to find Largest prime factor of a number
- Fast permutation -> number -> permutation mapping algorithms
- Algorithm to detect intersection of two rectangles?
- How to make rounded percentages add up to 100%
- Writing your own square root function
- Sort points in clockwise order?
- How do you calculate the average of a set of circular data? [closed]
- Finding out nth fibonacci number for very large ‘n’
- Algorithm for finding similar images
- Why does this simple shuffle algorithm produce biased results?
- Computing set intersection in linear time?
- Floating Point Divider Hardware Implementation Details
- Unsupervised clustering with unknown number of clusters
- Two Rectangles intersection
- Circle-circle intersection points
- How to find the smallest number with just 0 and 1 which is divided by a given number?
- How to calculate the index (lexicographical order) when the combination is given
- How do I find a factorial? [closed]
- Calculating the position of points in a circle
- Strategies for simplifying math expressions
- How to express tetration function, for complex numbers
- What is the method for converting radians to degrees?
- An inverse Fibonacci algorithm?
- How to check if an integer is a power of 3?
- “Rounding” colour values to the nearest of a small set of colours
- Location of highest density on a sphere