You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
55 lines
1.3 KiB
Java
55 lines
1.3 KiB
Java
/*
|
|
This is a Java Program to Implement Nth Root Algorithm. This program is used to calculate n th root of a number x.
|
|
*/
|
|
|
|
/**
|
|
** Java Program to implement Nth Root Algorithm
|
|
**/
|
|
|
|
import java.util.Scanner;
|
|
|
|
/** Class NthRoot **/
|
|
public class NthRoot
|
|
{
|
|
public double nthroot(int n, double x)
|
|
{
|
|
return nthroot(n, x, .0001);
|
|
}
|
|
public double nthroot(int n, double x, double p)
|
|
{
|
|
if(x < 0)
|
|
{
|
|
System.err.println("Negative!");
|
|
return -1;
|
|
}
|
|
if(x == 0)
|
|
return 0;
|
|
double x1 = x;
|
|
double x2 = x / n;
|
|
while (Math.abs(x1 - x2) > p)
|
|
{
|
|
x1 = x2;
|
|
x2 = ((n - 1.0) * x2 + x / Math.pow(x2, n - 1.0)) / n;
|
|
}
|
|
return x2;
|
|
}
|
|
/** Main **/
|
|
public static void main(String[] args)
|
|
{
|
|
Scanner scan = new Scanner(System.in);
|
|
System.out.println("Nth Root Algorithm Test\n");
|
|
System.out.println("Enter n and x");
|
|
int n = scan.nextInt();
|
|
double x = scan.nextInt();
|
|
NthRoot nr = new NthRoot();
|
|
double root = nr.nthroot(n, x);
|
|
System.out.println("\nRoot = "+ root);
|
|
}
|
|
}
|
|
|
|
/*
|
|
Enter n and x
|
|
2
|
|
3
|
|
|
|
Root = 1.7320508100147274 |