Timeline for sum of digits in different bases
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 13, 2013 at 16:00 | history | edited | Hans |
edited tags
|
|
| Apr 3, 2013 at 22:59 | comment | added | Hans | @Barry Cipra: I will look into your post, later... | |
| Apr 3, 2013 at 22:57 | comment | added | Hans | @Daniel m3: That is in principle what I did for 1000 as well. However, if you have stopped checking at 8 starting from 9, that is wrong, because unless you can prove otherwise, there is no reason to believe the qualified numbers of smaller digit sums do not interleave amongst those of larger digit sums. So you have to check almost all combinations of all sums. | |
| Apr 2, 2013 at 16:09 | comment | added | Barry Cipra | @Hans, I have extracted a specific case of your related questions and posted it separately at mathoverflow.net/questions/126286/… | |
| Apr 2, 2013 at 0:57 | comment | added | Daniel m3 | For 1000: our maximal $n$ must satisfy $(s_10(n)=) s_2(n) \le 9$. There are only 5 numbers with 9 ones in binary --- none of them works. Then check those numbers whose decimal sum is 8 (800, 710, etc.). None of them work until 503, which is the answer in this case. Granted, this is still somewhat brute force... | |
| Apr 1, 2013 at 23:12 | comment | added | Hans | I added a specific bound of 1000. Is there a short cut for this ad hoc example? | |
| Apr 1, 2013 at 23:09 | history | edited | Hans | CC BY-SA 3.0 |
added 126 characters in body; added 58 characters in body
|
| Mar 31, 2013 at 23:10 | comment | added | Barry Cipra | @Mark, unless I'm mistaken, A037308 is precisely the sequence the OP is asking about. (I'm not suggesting it answers the OP's questions, just that it's a helpful starting point.) | |
| Mar 31, 2013 at 3:20 | comment | added | user6976 | @Barry: The question is only remotely related to A037308. | |
| Mar 30, 2013 at 22:36 | comment | added | Barry Cipra | When posting a problem like this, please compute the first few terms of the sequence and check with the OEIS, so that others don't have to. In this case you get oeis.org/A037308 | |
| Mar 30, 2013 at 22:08 | history | edited | Hans | CC BY-SA 3.0 |
Added two more questions.
|
| Mar 30, 2013 at 20:17 | comment | added | András Bátkai | For reference: math.stackexchange.com/questions/338149/… | |
| Mar 30, 2013 at 20:07 | history | asked | Hans | CC BY-SA 3.0 |