[VA] SRC#003- New Year 2019 Special

[Carsen]

Hello all,

After just silently reading these challenges for awhile, I have decided that I'll take a stab at this problem using UserRPL on my 50g. First, I store the array in a global variable named 'M'. Then I execute the the following code.

Code:


SPOILERS!!!













<< -3. SF -105. SF 0. 'R1' STO 0. 'N' STO 0. 0.
DO DROP 'R1' STO 1. 'N' STO+ M N ^ DUP { 1. 3. } GET SWAP { 2. 3. } GET / 'R2' STO
UNTIL R2 R1 == LASTARG ROT
END
>>

It took my 50g 239.15 seconds to complete, getting a result of 12.6389823195. I believe that this is correct.

However, I don't have an answer to the more important question of "What do you think this procedure is actually computing?"