Specifically for
coldtortuga
Jan. 1st, 2006 01:56 pmA variation on a previous theme:
| Base | Number | Number in Base 10 |
|---|---|---|
| 2 | 12 | 1 |
| 3 | 23 | 2 |
| 4 | 3124 | 54 |
| 5 | 4135 | 108 |
| 6 | 4126 | 152 |
| 7 | 651427 | 16200 |
| 8 | 76251348 | 2042460 |
| 9 | 82715369 | 4416720 |
| 10 | 986731210 | 9867312 |
| Still churning - these O(nn) algorithms really soak up the CPU time... (I later hit Ctrl-C, so all numbers after this point are from | ||
| 11 | A9876241311 | 2334364200 |
| 12 | B935217612 | 421877610 |
| 13 | CBA9584721313 | 1779700673520 |
no subject
Date: 2006-01-09 07:49 pm (UTC)(I'm just now catching up on lj after 2 weeks at my parents' home in Alaska. They only have internet connectivity via the phone line, e.g., "[ring ring ring] Hey Jen, are you near your mom's computer? Could you look up the World Cup groups and read them off to me, pretty pretty please??")
My code spat out the base-eleven answer in a few minutes (A9876241311 = 233436420010) but it's been cranking for a couple hours now on base-twelve. The numbers are big enough to require Python "long" integers, which are waaaaay slower than native-hardware integers; I probably need a thorough re-writing of my generators to avoid so many multiplications and function-calls.
no subject
Date: 2006-01-09 09:21 pm (UTC)no subject
Date: 2006-01-09 10:44 pm (UTC)no subject
Date: 2006-01-09 10:48 pm (UTC)no subject
Date: 2006-01-10 02:54 pm (UTC)