Weekend Challenge Sharpened: Missing Positions in Champernowne's Constant

08102015, 02:54 AM
Post: #15




RE: Weekend Challenge Sharpened: Missing Positions in Champernowne's Constant
The following is weird (and wonderful):
Code: ch min_c max_c i(max_c) Where I break Champernowne's Number into "levels", where ch is the characteristic of the logarithm of the integers at a given level (i.e. integers 1 to 9 at the level with ch = 0; 10 to 99 for ch = 1 etc.) and min_c is the number of the smallest "missing position" at that level, max_c is the largest "missing position" at that level and i(max_c) is the index into Champernowne's Number of max_c. I believe this observation will permit me to eliminate iteration from my solution. But I'm still working on that bit... 

« Next Oldest  Next Newest »

User(s) browsing this thread: 1 Guest(s)