Sunday August 7, 2011
A "repunit" is a number whose digits are all 1's.
Consider the function R(n). R(n) returns a repunit with n digits.

For instance, R(8) = 11111111 (eight ones).

Using any algorithm and any programming tools you want, generate as many consecutive evaluations of R(n) as possible within 60 seconds.

(The framework for this problem came from Project Euler).

Show solution
Challenge Resources:
©1994-2014   |   Shodor   |   Privacy Policy   |   NSDL   |   XSEDE   |   Blue Waters   |   ACM SIGHPC   |   feedback  |   facebook   |   twitter   |   rss   |   youtube Not Logged In. Login