Divine Lunacy

While I do lack 7/3 of a life, I have enough of a life to know that trying to find a formula to solve this one is not worth it (although, In my combinatorial studies next year I will… [<–written next year]), so I just used another brute force program….

Consider a function for which f(n) returns the number of ones required to count from 1 to n. f(13)=6, notice that f(1)=1. Find the Next largest number that satisfies f(n)=n.

The program is comprised of a loop that iterates until it finds something, then it exits.

199981
Query took 7.47828507423 seconds.

The php source can be found here.

This entry was posted on Monday, October 25th, 2004 at 1853:21 and is filed under dev/tech, Mathematical. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.