HI... my basic problem is
B = (A^n/n!) / (A^1/1!+A^2/2!+A^3/3!---------+A^n/n!)
where B and n is given and i have to find the A factor.(i will use Newton Raphson Farmula to calculate it ) but problem i m facing is if the value of n is greater than java support then it overflows the stack by recursion of function plz help me ......
i dont say all the help but anything u know about this problem
will be enough for me