Fifth power (algebra)

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

In arithmetic and algebra, the fifth power of a number n is the result of multiplying five instances of n together:

n5 = n × n × n × n × n.

Fifth powers are also formed by multiplying a number by its fourth power, or the square of a number by its cube.

The sequence of fifth powers of integers is:

0, 1, 32, 243, 1024, 3125, 7776, 16807, 32768, 59049, 100000, 161051, 248832, 371293, 537824, 759375, 1048576, 1419857, 1889568, 2476099, 3200000, 4084101, 5153632, 6436343, 7962624, 9765625, ... (sequence A000584 in the OEIS)


The last digit of the fifth power of an integer n, with 10 as the base, is the last digit of n.

By the Abel–Ruffini theorem, there is no general algebraic formula (formula expressed in terms of radical expressions) for the solution of polynomial equations containing a fifth power of the unknown as their highest power. This is the lowest power for which this is true. See quintic equation, sextic equation, and septic equation.

Along with the fourth power, the fifth power is one of two powers k that can be expressed as the sum of k − 1 other k-th powers, providing counterexamples to Euler's sum of powers conjecture. Specifically,

275 + 845 + 1105 + 1335 = 1445 (Lander & Parkin, 1966)[1]

See also[edit]


  1. ^ Lander, L. J.; Parkin, T. R. (1966). "Counterexample to Euler's conjecture on sums of like powers". Bull. Amer. Math. Soc. 72 (6): 1079. doi:10.1090/S0002-9904-1966-11654-3.