Computer Algebra
《Computer Algebra》 · 第 129–130 页 · Chapter IV，Section 1「Introduction」
Statement (5) became known as Mordell’s conjecture. In this part of the course, we discuss Faltings’s famous paper which, among other things, proves Mordell’s conjecture. […] If $C$ is a projective nonsingular curve of genus $g\geq2$ over a number field $k$, then $C(k)$ is finite. […] If $g\geq2$, then Faltings’s theorem states that $C(k)$ is finite.