Jump to content

Talk:Schoof–Elkies–Atkin algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 14:21, 23 May 2010 (Signing comment by 129.241.66.108 - ""). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Stub‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StubThis article has been rated as Stub-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

There is an error in this article. The improvement over Schoof is not that you work modulo the smaller modular polynomials, but a factor of the division polynomial. This factor is such that its roots are the x-coordinates of the points in the eigenspace C. The modular polynomials have roots the j-invariants of the cyclic subgroups C of E, and are used merely to determine whether or not l is an Elkies prime or not. —Preceding unsigned comment added by 129.241.66.108 (talk) 14:20, 23 May 2010 (UTC)[reply]