Timeline for Find a multiple of a given number whose decimal representation looks like binary
Current License: CC BY-SA 3.0
24 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot | Commonmark migration | |
| Oct 23, 2015 at 14:36 | comment | added | Peter Taylor | I have a vague memory of seeing it called the number-theoretic logarithm to base b somewhere, but I can't find a reference. | |
| Oct 23, 2015 at 14:35 | comment | added | aditsu quit because SE is EVIL | @PeterTaylor is it just a weird name you gave to an ad-hoc function? | |
| Oct 23, 2015 at 14:34 | comment | added | Peter Taylor | Read the first half of that sentence again | |
| Oct 23, 2015 at 14:33 | comment | added | aditsu quit because SE is EVIL | @PeterTaylor what's ntlog? | |
| Oct 23, 2015 at 12:51 | comment | added | Peter Taylor | You can get a speed-up of about 30% with some basic number theory. If ntlog(b, x) gives the greatest a such that x % (b**a) == 0 then start k at 10**max(ntlog(2,n), ntlog(5,n)). | |
| Oct 17, 2015 at 22:57 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | added faster version |
| Oct 17, 2015 at 22:36 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | added explanation |
| Oct 17, 2015 at 15:59 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | added 71 characters in body |
| Oct 17, 2015 at 15:31 | comment | added | Rnet | @aditsu challenge accepted!, well almost :) [72 = ~0.007 s, 99 = ~0.45s] codegolf.stackexchange.com/a/61076/46177 | |
| Oct 17, 2015 at 6:46 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | clarified |
| Oct 17, 2015 at 2:40 | comment | added | user193661 | Timings for solving 99: aditsu: 0.001 seconds; xnor: 5+ hours and it still didn't complete. | |
| Oct 17, 2015 at 1:53 | comment | added | edc65 | 72, 99 and some more in ~370 millisec codegolf.stackexchange.com/a/61051/21348 | |
| Oct 16, 2015 at 17:55 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | golfed |
| Oct 16, 2015 at 17:31 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | golfed |
| Oct 16, 2015 at 17:21 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | golfed |
| Oct 16, 2015 at 16:45 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | golfed |
| Oct 16, 2015 at 16:30 | comment | added | Addison Crump | Or not. That actually seriously reduces it. Thanks! | |
| Oct 16, 2015 at 16:28 | comment | added | Addison Crump | Hmm. It's an extra byte, but... worth it. Thanks! | |
| Oct 16, 2015 at 16:28 | comment | added | aditsu quit because SE is EVIL | @VTCAKAVSMoACE why don't you use Long? | |
| Oct 16, 2015 at 16:27 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | golfed |
| Oct 16, 2015 at 16:25 | comment | added | Addison Crump | My answer doesn't get either. xD "Dangit, Java, curse thy choice of Integer.MAX_VALUE over using BigInteger by default!" - Every Java Programmer Ever | |
| Oct 16, 2015 at 16:24 | history | edited | aditsu quit because SE is EVIL | CC BY-SA 3.0 | golfed |
| Oct 16, 2015 at 14:26 | history | answered | aditsu quit because SE is EVIL | CC BY-SA 3.0 |