|
| |
|
|
A086937
|
|
Number of distinct zeros of x^2-x-1 mod prime(n).
|
|
6
| |
|
|
0, 0, 1, 0, 2, 0, 0, 2, 0, 2, 2, 0, 2, 0, 0, 0, 2, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 0, 2, 0, 0, 2, 0, 2, 2, 2, 0, 0, 0, 0, 2, 2, 2, 0, 0, 2, 2, 0, 0, 2, 0, 2, 2, 2, 0, 0, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 2, 0, 0, 2, 0, 2, 0, 2, 2, 2, 2, 2, 0, 2, 0, 2, 0, 2, 0, 0, 2, 0, 2, 2, 0, 2, 2, 0, 2, 0, 0, 0, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,5
|
|
|
COMMENTS
| For the prime modulus 5, the polynomial can be factored as (x+2)^2, showing that x=3 is a zero of multiplicity 2. The discriminant of the polynomial is 5. Also note how this sequence is related to the Fibonacci sequence A051830; for n>3, a(n) = 2*A051830(n). - T. D. Noe (noe(AT)sspectra.com), Aug 13 2004
|
|
|
LINKS
| J.-P. Serre, On a theorem of Jordan, Bull. Amer. Math. Soc., 40 (No. 4, 2003), 429-440, see p. 433.
|
|
|
FORMULA
| If p = prime(n), a(n) = A080891(p) + 1.
|
|
|
MATHEMATICA
| Table[p=Prime[n]; cnt=0; Do[If[Mod[x^2-x-1, p]==0, cnt++ ], {x, 0, p-1}]; cnt, {n, 105}] (from T. D. Noe)
|
|
|
CROSSREFS
| Cf. A086965, A086966, A086967.
Sequence in context: A118508 A029305 A110036 * A095759 A046113 A143068
Adjacent sequences: A086934 A086935 A086936 * A086938 A086939 A086940
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Sep 23 2003
|
|
|
EXTENSIONS
| Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Sep 24 2003
|
| |
|
|
