[seqfan] UPINT reference sought for mod 6 problem
r.rosenthal at web.de
Mon Mar 16 20:10:54 CET 2009
Jim Nastos wrote:
> Rainer Rosenthal wrote:
>>> DW> ... this problem belongs to a class of problems like:
>>> DW> Does every sufficiently large power of 2 include the
>>> DW> digit 0 in base 10?
These remarks by David Wilson were meant as classifying the
problem of Peter Luschny.
> The Google Books copy of UPINT has the section
> "F24: Some Decimal Digit Problems:"
Thank you, Jim, but ...
>> The actual problem, posed by Peter Luschny, was: what can
>> be said about the remainders of floor(2^m/3^k) modulo 6?
>> His problem restated:
>> ================= Conjecture ===================
>> For all m > 26 there exists some k > 0 such that
>> floor(2^m / 3^k) = 3 (mod 6).
>> Could someone please be so kind as to give me a pointer
>> to UPINT (Unsolved Problems in Number Theory)? I have
>> the third edition available at home.
More information about the SeqFan