|
%I #50 Mar 03 2019 01:57:24
%S 1,5,37,25,2,185,143,125,12345679,1,1,925,77,715,74,625,653,61728395,
%T 579,5,481,5,4787,4625,4,385,40781893,3575,37969,37,3581,3125,3367,
%U 3265,286,308641975,3,2895,259,25,271,2405,25607,25,24691358,23935,213,23125
%N Least k such that the decimal representation of k*n contains only 1's and 0's.
%C From David Amar (dpamar(AT)gmail.com), Jul 12 2010: (Start)
%C This sequence is well defined.
%C In the n+1 first repunits (see A002275), there are at least 2 numbers that have the same value modulo n (pigeonhole principle).
%C The difference between those two numbers contains only 1's and 0's in decimal representation. (End)
%D Popular Computing (Calabasas, CA), Z-Sequences, Vol. 4 (No. 34, A pr 1976), pages PC36-4 to PC37-6, but there are many errors (cf. A257343, A257344).
%H Robert G. Wilson v, <a href="/A079339/b079339.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1999 from T. D. Noe, terms 2000..9998 from N. J. A. Sloane [based on A004290])
%F a(n) = A004290(n)/n.
%F a(n) < 10^(n+1) / (9n). - _Charles R Greathouse IV_, Jan 09 2012
%e 3*37 = 111 and no integer k < 37 has this property, hence a(3)=37.
%o (PARI) d(n,i)=floor(n/10^(i-1))-10*floor(n/10^i);
%o test(n)=sum(i=1,ceil(log(n)/log(10)),if(d(n,i)*(1-d(n,i)),1,0));
%o a(n)=if(n<0,0,s=1; while(test(n*s)>0,s++); s)
%Y Cf. A004290, A070189, A078241-A078248, A096681-A096688, A257343, A257344, A257345.
%K base,nonn
%O 1,2
%A _Benoit Cloitre_, Feb 13 2003
%E More terms from _Vladeta Jovovic_ and _Matthew Vandermast_, Feb 14 2003
%E Definition simplified by _Franklin T. Adams-Watters_, Jan 09 2012
|
