OFFSET
1,1
COMMENTS
The trivial case for i=1 is omitted.
PROG
(PARI) /* The first occurrence of 10 digits of i-th root of x contains all digits 0-9. */
rootdigits2(n, m) = { local(f, x, y, a, d, s); for(i=2, m, for(x=2, n, f=[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; s=0; y=(x^(1/i))*10^9; a=Vec(Str(y)); for(d=1, 10, k=eval(a[d]); if(k==0, k=10); f[k]=1; ); for(j=1, 10, s+=f[j]); if(s==10, print1(x", "); break); ) ) }
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Cino Hilliard, May 27 2006
STATUS
approved