Hacker News new | past | comments | ask | show | jobs | submit
Aloisius | on: πFS
That seems easy enough to solve. Simply record the index and length in pi of the index and length in pi.
awesome_dude | parent
See also: Recursion
dietr1ch | root | parent
See also: Recursion
philihp | root | parent
[flagged]
amelius | root | parent | next
You can stop the recursion when you've found an index that is smaller than what you wanted to store.