|
Search: id:A069830
|
|
|
| A069830 |
|
Multiplicative inverse of the n-th prime p(n) modulo p(n+1). |
|
+0
3
|
|
| 2, 2, 3, 8, 6, 4, 9, 17, 24, 15, 6, 10, 21, 35, 44, 49, 30, 11, 53, 36, 13, 62, 74, 12, 25, 51, 80, 54, 28, 9, 98, 114, 69, 134, 75, 26, 27, 125, 144, 149, 90, 19, 96, 49, 99, 123, 130, 170, 114, 58, 199, 120, 25, 214, 219, 224, 135, 46, 70, 141, 205, 285, 233, 156, 79
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Smallest k such that prime(n) divides k*prime(n-1) - 1, n>1.
|
|
LINKS
|
D. Williams, Multiplicative Inverse mod m
|
|
EXAMPLE
|
a(4) = 8 as prime(5) =11 divides 8*7 -1, where 7 = prime(4).
a(9) and a(14) are respectively 24 and 35, for a(9)*p(9)=24*23=(-5)*(-6) [mod 29]=1 [mod p(10)] and a(14)*p(14)=35*43=(-12)*(-4) [mod 47]=1 [mod p(15)].
|
|
PROGRAM
|
(PARI) v=[]; for(n=1, 100, for(m=2, prime(n+1), if(m*prime(n)%prime(n+1) == 1, v=concat(v, m); break))); v
|
|
CROSSREFS
|
Cf. A077005.
Sequence in context: A100551 A070267 A056762 this_sequence A046652 A091681 A076541
Adjacent sequences: A069827 A069828 A069829 this_sequence A069831 A069832 A069833
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lekraj Beedassy (blekraj(AT)yahoo.com), Apr 23 2002
|
|
EXTENSIONS
|
More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), May 03 2002
|
|
|
Search completed in 0.002 seconds
|
