Jump to content

Talk:Schoof–Elkies–Atkin algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 04:30, 9 February 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Stub" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Schoof–Elkies–Atkin_algorithm&oldid=1205218090"