On 2010-06-21, Peter Webb <webbfamily@DIESPAMDIEoptusnet.com.au> wrote: > No, I only need a finite algorithm which will calculate it to n > decimal places with finite input.
You have previously stated that you can do this with "about three lines of Java code".
Here's your Java method signature: int antidiagonalDigit(BigInteger n).
Here are the first twenty digits of the first twenty members of my list:
If I then give you the first 10^100 list entries to 10^10 digits, would the same code suffice? Would it have to be enlarged? How large would it be if I required any digit up to the 10^100'th?
How large would it have to be if I asked for an algorihm that produces *any* digit on request?
