login
Smallest number of the form (10^k -1)/9 == 0 (mod prime(n)). with a(1) = a(3) = 0.
3

%I #6 Dec 05 2013 19:55:54

%S 0,111,0,111111,11,111111,1111111111111111,111111111111111111,

%T 1111111111111111111111,1111111111111111111111111111,111111111111111,

%U 111,11111,111111111111111111111,1111111111111111111111111111111111111111111111

%N Smallest number of the form (10^k -1)/9 == 0 (mod prime(n)). with a(1) = a(3) = 0.

%C For every prime p > 5, {10^(p-1) -1}/9 == 0 (mod p), by Fermat's Little theorem.

%D Amarnath Murthy, On the divisors of Smarandache Unary Sequence. Smarandache Notions Journal, Vol. 11, 2000.

%Y Cf. A071126.

%K nonn

%O 1,2

%A _Amarnath Murthy_, Nov 11 2002

%E More terms from _Sascha Kurz_, Jan 04 2003