Java程序来计算嵌套的偏旁常量(Java programme to compute the nested radical constant)

 
 使用下面的代码，我能够估计它：1.7579327566180045 
 
public class Sum {
static int count = 0;
static double a = 0;
public static void main(String[] args) {
    int x = 0;
    System.out.println(sum(x));
}

public static double sum(int x){
    count++;
    x++;
    if (count == 11000){
        return a;
    }
    return a = Math.sqrt(x+sum(x));
}
 
 然而，我无法通过递归获得更准确的答案。 递归调用数从11,000增加给我一个StackOverflowError 。 我也查了解如何在这里使用java的BigDecimal ，但是我无法在这里实现它，老实说不确定这是否有帮助。 
 
 
 
 问题 ： - 我怎样才能让这个程序计算更多的小数位数更准确的常量？ 我不确定这是否可以迭代计算或不计算。 我无法计算出iterative定义。 
 
 
 另外，我也研究了Java 8 Streams，但那些对我来说没有多大意义（因为我是编程和Java的新手）并且不确定这是否适用于此。 
 
 谢谢你的帮助！ 

 
Using the code below I was able to estimate it upto: 1.7579327566180045
 
public class Sum {
static int count = 0;
static double a = 0;
public static void main(String[] args) {
    int x = 0;
    System.out.println(sum(x));
}

public static double sum(int x){
    count++;
    x++;
    if (count == 11000){
        return a;
    }
    return a = Math.sqrt(x+sum(x));
}
 
I am however not able to get an answer with more accuracy with the recursion here. Increasing the number of recursive calls from 11,000 gives me a StackOverflowError. I also looked up how I could use the java's BigDecimal here, but I'm unable to implement it here and honestly not sure if that would help.
 
 
 
Question :- how can I make this programme compute the constant to more decimal places and more accurately? I'm not certain if this I can compute it iteratively or not either. I wasn't able to work out an iterative definition.
 
 
In addition, I looked into Java 8 Streams too, but those didn't make much sense to me (since i'm new to programming and Java) and not sure if that is applicable here.
 
Thanks for any help!

原文：https://stackoverflow.com/questions/37084465