|
Search: id:A060122
|
|
|
| A060122 |
|
Smallest solution mod p of x^3 = 2 for primes p such that more than one solution exists. |
|
+0
6
|
|
| 4, 20, 57, 32, 62, 68, 52, 152, 120, 52, 53, 72, 13, 14, 10, 54, 61, 94, 9, 339, 29, 23, 25, 114, 159, 131, 469, 206, 178, 892, 628, 162, 544, 709, 647, 799, 49, 57, 709, 218, 1118, 585, 858, 332, 528, 119, 1151, 1024, 152, 798, 42, 235, 71, 535, 733, 257, 228
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Solutions mod p are represented by integers from 0 to p-1. No integer occurs more than twice in this sequence (cf. comment to A060121). There are integers which do occur twice, e.g. 52, 57, 152 (cf. A060914). Moreover, no integer occurs more than twice in A060121, A060122, A060123 and A060124 taken together.
|
|
FORMULA
|
a(n) = first (least) solution mod p of x^3 = 2, where p is the n-th prime such that x^3 = 2 has more than one solution mod p, i.e. p is the n-th term of A014752.
|
|
EXAMPLE
|
a(3) = 57, since 109 is the third term of A014752, 57, 58 and 103 are the solutions mod 109 of x^3 = 2, and 57 is the least one.
|
|
CROSSREFS
|
Cf. A040028, A014752, A059940, A060914, A060121, A060123, A060124.
Sequence in context: A047810 A002492 A127920 this_sequence A066970 A033488 A018211
Adjacent sequences: A060119 A060120 A060121 this_sequence A060123 A060124 A060125
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 02 2001
|
|
|
Search completed in 0.002 seconds
|
