https://oeis.org/A305942 I recently extended this conjectured sequence (the number of decimal expansions of powers of two that contain exactly n digits 0). There would of course be analog sequences for the other nine digits. I wondered if any of these ten sequences might have 0 as a term. In other words, is there an n for which the decimal digit d does not appear in any power of two exactly n times? The digit 7 appears exactly 275923 times for *only eight* powers of two, the smallest number of solutions that I found (for any d, n up to 295000). It would take a gargantuan effort to bring this down to seven or six solutions, so no, I don't think zero is ever going to be a known. Against a backdrop of all counts of the digit 7 in powers of two from 2^9100000 to 2^9240000, here are my eight solutions in graphical form: http://chesswanks.com/num/eight.png
"... is there an n for which the decimal digit d does not appear in any power of two exactly n times?" I can example this now in another (normal) base. In base five, there are no powers of two where the digit 3 appears exactly 20848 times. The number of powers for nearby n is: 20844, 21; 20845, 9; 20846, 14; 20847, 10; 20849, 15; 20850, 12; 20851, 11; 20852, 10. On average there are 11.61 powers with (in my range) as many as 34. The next n for which the digit 3 does not appear exactly n times is greater than 250000. Other no-shows in base five: digit 0: n = 134212, 201042. digit 1: n = 160628, 166885, 180012. digit 2: n = 40634, 91291, 159058. digit 4: n = 75882, 232658.
participants (1)
-
Hans Havermann