Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002314
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002314 Minimal integer square root of -1 modulo p(n), where p(n) = n-th prime of form 4k+1.
(Formerly M1314 N0503)
+0
2
2, 5, 4, 12, 6, 9, 23, 11, 27, 34, 22, 10, 33, 15, 37, 44, 28, 80, 19, 81, 14, 107, 89, 64, 16, 82, 60, 53, 138, 25, 114, 148, 136, 42, 104, 115, 63, 20, 143, 29, 179, 67, 109, 48, 208, 235, 52, 118, 86, 24, 77, 125, 35, 194, 154, 149, 106, 58, 26, 135, 96, 353, 87, 39 (list; graph; listen)
OFFSET

1,1

COMMENT

In other words, if p is the n-th prime == 1 mod 4, a(n) is the smallest positive integer k such that k^2 + 1 == 0 mod p.

The 4th roots of unity mod p, where p = n-th prime == 1 mod 4, are +1, -1, a(n) and p-a(n).

Related to Stormer numbers.

Comment from Igor Shparlinski, Mar 12 2007 (writing to the Number Theory List): Results about the distribution of roots (for arbitrary quadratic polynomials) are given by W. Duke, J. B. Friedlander and H. Iwaniec, and A. Toth.

Comment from Emmanuel Kowalski, Mar 12 2007 (writing to the Number Theory List): It is known (Duke, Friedlander, Iwaniec, Annals of Math. 141 (1995)) that the fractional part of a(n)/p(n) is equidistributed in [0,1/2] for p(n)<X and X going to infinity. So a positive proportion of p have a between xp and yp for 0<x<y<1/2, but equidistribution in smaller sets is not known.

REFERENCES

W. Duke, J. B. Friedlander and H. Iwaniec, Equidistribution of roots of a quadratic congruence to prime moduli, Annals of Math, 141 (1995), 423-441.

J. Todd, A problem on arc tangent relations, Amer. Math. Monthly, 56 (1949), 517-528.

A. Toth, Roots of quadratic congruences, Intern. Math. Research Notices, 2000 (2000), 719-739.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

MAPLE

f:=proc(n) local i, j, k; for i from 1 to (n-1)/2 do if i^2 +1 mod n = 0 then RETURN(i); fi od: -1; end;

t1:=[]; M:=40; for n from 1 to M do q:=ithprime(n); if q mod 4 = 1 then t1:=[op(t1), f(q)]; fi; od: t1;

CROSSREFS

Cf. A002313, A005528, A047818.

Sequence in context: A072403 A010078 A074639 this_sequence A094471 A126356 A121274

Adjacent sequences: A002311 A002312 A002313 this_sequence A002315 A002316 A002317

KEYWORD

nonn

AUTHOR

njas

EXTENSIONS

Better description from Tony Davie (ad(AT)dcs.st-and.ac.uk), Feb 07 2001

More terms from Jud McCranie (j.mccranie(AT)comcast.net), Mar 18, 2001.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research