- n4 = n × n × n × n
The last two digits of a fourth power of an integer can be easily shown (for instance, by computing the squares of possible last two digits of square numbers) to be restricted to only twelve possibilities:
- 00, 01, 16, 21, 25, 36, 41, 56, 61, 76, 81, 96
Every positive integer can be expressed as the sum of at most 19 fourth powers; every sufficiently large integer can be expressed as the sum of at most 16 fourth powers (see Waring's problem).
Euler conjectured a fourth power cannot be written as the sum of 3 smaller fourth powers, but 200 years later this was disproven with:
958004 + 2175194 + 4145604 = 4224814.
Equations containing a fourth power
|This algebra-related article is a stub. You can help Wikipedia by expanding it.|