A concise proof of the 8 case of Sylvester's conjecture
Hongbo Yin
Source abstract
The 150 years old Sylvester's conjecture asserts that every prime is the sum of two rational cubes. Recently, a proof of this old problem is obtained by the work of mine for the case 4,7 \cite{Yin} and the work of Burungale-Tian for the case 8 \cite{BT}. Burungale-Tian's paper essentially uses the results of paper \cite{Yin}, but does not make full use of the power. Their proof for the case is complicated and hard to follow. In this paper we give a much simpler and direct proof by deep mining my result in \cite{Yin} combining with the ideas of my previous work on case 8 in \cite{Yin8}. In particular, we use the ordinary trace and the Kronecker congruence of modular functions, but do not use the Gross-Zagier formula, -division boundary and Fermat isogeny as in \cite{BT}.This concise proof provides a perfect end to this old concise conjecture.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.