Fourth power
<templatestyles src="Module:Hatnote/styles.css"></templatestyles>
In arithmetic and algebra, the fourth power of a number n is the result of multiplying four instances of n together. So:
- n4 = n × n × n × n
Fourth powers are also formed by multiplying a number by its cube. Furthermore, they are squares of squares.
The sequence of fourth powers of integers (also known as biquadratic numbers or tesseractic numbers) is:
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:
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 (Elkies, Frye) with:
958004 + 2175194 + 4145604 = 4224814.
That the equation x4 + y4 = z4 has no solutions in nonzero integers (a special case of Fermat's Last Theorem), was known, see Fermat's right triangle theorem.
Equations containing a fourth power
Fourth degree equations, which contain a fourth degree (but no higher) polynomial are, by the Abel-Ruffini theorem, the highest degree equations solvable using radicals.
See also
References
<templatestyles src="Asbox/styles.css"></templatestyles>