login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172372 Least number k such that the n-th prime not dividing 10 (A004139(n)) divides the repunit (10^k-1)/9. 0

%I #40 Jun 16 2023 03:16:28

%S 3,6,2,6,16,18,22,28,15,3,5,21,46,13,58,60,33,35,8,13,41,44,96,4,34,

%T 53,108,112,42,130,8,46,148,75,78,81,166,43,178,180,95,192,98,99,30,

%U 222,113,228,232,7,30,50,256,262,268,5,69,28,141,146,153,155,312,79,110

%N Least number k such that the n-th prime not dividing 10 (A004139(n)) divides the repunit (10^k-1)/9.

%C If p is an odd prime different from 5, then p divides an infinite number of terms of the sequence of repunits {1, 11, 111, 1111, ... }. The proof is elementary: let p be such a prime. If p = 3, then 3 divides (10^3-1)/9 = 111. Otherwise, take k = (10^p - 1)/9; by the Fermat theorem, 10^(p-1) == 1 (mod p), so p divides (10^(p-1)-1); since p is relatively prime to 9, it divides k. Trivially, if p divides any k digit repunit, it divides the k*m digit repunit as well.

%C Essentially the same as A002371. - _T. D. Noe_, Apr 11 2012

%D David Wells, The Factors of the Repunits 11 through R_40, The Penguin Dictionary of Curious and Interesting Numbers, p. 219 Penguin 1986.

%D David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, 1997.

%D David Wells, Curious and Interesting Numbers (Revised), Penguin Books, page 114.

%H Project Euler, <a href="https://projecteuler.net/problem=129">Problem 129: Repunit divisibility</a>

%H S. S. Wagstaff, Jr., <a href="http://homes.cerias.purdue.edu/~ssw/cun/index.html">The Cunningham Project</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Repunit.html">Repunit</a>.

%e 3 divides 111, but not 1 or 11, so a(1) = 3.

%e 7 divides 111111 but not 1, 11, 111, 1111, or 11111, so a(2) = 6.

%o (PARI) a(n) = {k=1; p = if(n>1, prime(n+2), 3); while((10^k-1)/9 % p, k++); k;} \\ _Michel Marcus_, May 25 2014

%Y Cf. A002275 (repunits), A002371 (period of decimal expansion of 1/prime(n)), A004139 (odd primes excluding 5), A095250 (11111111... (n times) mod n).

%K nonn

%O 1,1

%A _Michel Lagneau_, Feb 01 2010

%E Corrected and edited by _Michel Lagneau_, Apr 25 2010

%E Term 6 between terms 44 and 96 doesn't belong to the sequence. The same for term 43 between terms 43 and 178. Corrected and edited by _Krzysztof Wojtas_, May 25 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)