Last Updated:2025/11/28

The cannonball problem asks whether the sum of the first N square numbers can itself be a perfect square, and this challenge has intrigued generations of number theorists.

See correct answer

The cannonball problem asks whether the sum of the first N square numbers can itself be a perfect square, and this challenge has intrigued generations of number theorists.

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)
Source Sentence

ディオファントス方程式 Σ_{n=1}^N n^2 = M^2 の解として、最初の N 個の平方数の総和が完全平方になるかを証明するという挑戦は、何世代にもわたる整数論者を魅了してきた。

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★