login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Revision History for A095978

(Underlined text is an ; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A095978 Number of solutions to y^2=x^3+x (mod p) as p runs through the primes.
(history; published version)
#28 by N. J. A. Sloane at Sat Sep 17 11:52:50 EDT 2016
STATUS

editing

#27 by N. J. A. Sloane at Sat Sep 17 11:52:47 EDT 2016
COMMENTS

They are also number of solutions to y^2 = x^3 - 4*x (mod p) as p runs through the primes. - Seiichi Manyama, Sep 16 2016

STATUS

reviewed

#26 by Joerg Arndt at Fri Sep 16 12:09:14 EDT 2016
STATUS

proposed

#25 by Seiichi Manyama at Fri Sep 16 08:55:09 EDT 2016
STATUS

editing

#24 by Seiichi Manyama at Fri Sep 16 08:54:13 EDT 2016
COMMENTS

STATUS

approved

#23 by Wolfdieter Lang at Fri May 27 13:39:25 EDT 2016
STATUS

editing

#22 by Wolfdieter Lang at Fri May 27 13:39:19 EDT 2016
COMMENTS

The only rational solution of y^2 = x^3 + x is (y, x) = (0, 0). See the Silverman reference, Theorem 44.1 with a proof on pp. 388 - 391. - _Wolfdieter Lang_, Feb 08 2016

STATUS

approved

#21 by Wolfdieter Lang at Fri May 27 12:35:23 EDT 2016
STATUS

editing

#20 by Wolfdieter Lang at Fri May 27 12:35:16 EDT 2016
REFERENCES

J. H. Silverman, A Friendly Introduction to Number Theory, 3rd ed., Pearson Education, Inc, 2006, Theorem 45.1 on p. 399.

STATUS

approved

#19 by Wolfdieter Lang at Fri Apr 15 12:34:40 EDT 2016
STATUS

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 13 09:59 EDT 2024. Contains 375904 sequences. (Running on oeis4.)