login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A068383
Numbers k such that k divides 11^k - 1.
9
1, 2, 4, 5, 6, 8, 10, 12, 16, 18, 20, 24, 25, 30, 32, 36, 40, 42, 48, 50, 54, 60, 64, 72, 80, 84, 90, 96, 100, 108, 114, 120, 125, 126, 128, 144, 150, 156, 160, 162, 168, 180, 192, 200, 210, 216, 222, 228, 240, 244, 250, 252, 256, 270, 272, 288, 294, 300, 312, 320
OFFSET
1,2
COMMENTS
For all k, 2^k, 10^k, 2 * 3^k and 10 * 3^k are in the sequence.
LINKS
EXAMPLE
11^5 - 1 = 161050, which is divisible by 5, so 5 is in the sequence.
11^6 - 1 = 1771560, which is divisible by 6, so 6 is in the sequence.
11^7 = 19487171 = 4 modulo 7, so 7 is not in the sequence.
MATHEMATICA
Join[{1}, Select[Range[500], PowerMod[11, #, #] == 1 &]] (* Robert Price, Apr 04 2020 *)
PROG
(PARI) isok(n) = Mod(11, n)^n == Mod(1, n); \\ Michel Marcus, May 06 2016
(Scala) def powerMod(a: Int, b: Int, m: Int): Int = b match { case 1 => a % m; case n => a * powerMod(a, n - 1, m) % m }
List(1) ++: (2 to 500).filter(k => powerMod(11, k, k) == 1) // Alonso del Arte, Apr 04 2020
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Mar 05 2002
STATUS
approved