Arithmetic geometry and elliptic curves
Warm-upHumanOn the point has order , and . What is the order of the point ?
On the point has order , and . What is the order of the point ?
Count the points of over , including the point at infinity. (The non-zero squares mod are .)
For over we found , so . Use , where are the roots of , to find .
Let , so , and . By the Nagell–Lutz theorem, a torsion point has integer coordinates with or . List every integer that is allowed.
In the proof of Hasse's theorem we showed for all integers , and concluded . Which justification of the last step is correct?
Let . For which fields is not finitely generated? (Choose all that apply.)
The lesson's Lean theorem chord_third_point has hypotheses h₁ : y₁ ^ 2 = x₁ ^ 3 + a * x₁ + b, h₂ : y₂ ^ 2 = x₂ ^ 3 + a * x₂ + b, hx : x₁ ≠ x₂ and hℓ : y₂ - y₁ = ℓ * (x₂ - x₁). What would go wrong if we deleted hx?
Write count_points(p, a, b) returning for over ( an odd prime), including the point at infinity. Then use it to check the Hasse bound for every curve over , .
Which of these statements about elliptic curves over are proved theorems (as of this lesson)? Choose all that apply.