[seqfan] Re: Finite sequences.
andrew.weimholt at gmail.com
Mon Aug 16 02:37:44 CEST 2010
On Sun, Aug 15, 2010 at 4:32 PM, Robert G. Wilson v <rgwv at rgwv.com> wrote:
> Et al,
> Recently a group of sequences, A175691 through A175698, basically titled " a(n) =smallest number such a(n)*n is an anagram of a(n)* k" for k's from 2 to 9 respectfully
> submitted by Claudio L Meller. Does someone have an elegant solution for why these sequences have no solutions beyond 10k.
n >= 10k
a(n)*n >= a(n)*k*10
and a(n)*k*10 has more digits in base 10 than a(n)*k,
so beyond n=10k, a(n)*n and a(n)*k cannot be anagrams of each other.
More information about the SeqFan