Is there a number (that is not 4 or 5 modulo 9) that cannot be expressed as a sum of three cubes?
Put another way :
In the mathematics of sums of powers, it is an open problem to characterize the numbers that can be expressed as a sum of three cubes of integers, allowing both positive and negative cubes in the sum. A necessary condition for n to equal such a sum is that n cannot equal 4 or 5 modulo 9, because the cubes modulo 9 are 0, 1, and −1, and no three of these numbers can sum to 4 or 5 modulo 9. It is unknown whether this necessary condition is sufficient.
Source : Wikipedia
The solutions for most numbers up to 1000 have been found, but 114, 390, 627, 633, 732, 921 and 975 remain. After 1000, there is, to date, no proof one way or the other.
Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)
You are currently viewing an auto-translated version of Wikenigma
Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.
Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.