Fifth power (algebra)

Last updated

In arithmetic and algebra, the fifth power or sursolid [1] of a number n is the result of multiplying five instances of n together:

Contents

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 )

Properties

For any integer n, the last decimal digit of n5 is the same as the last (decimal) digit of n. I.E:

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) [2]

See also

Footnotes

  1. "Webster's 1913".
  2. 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 .

Related Research Articles

<span class="mw-page-title-main">Conjecture</span> Proposition in mathematics that is unproven

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis or Fermat's Last Theorem, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

Euler's conjecture is a disproved conjecture in mathematics related to Fermat's Last Theorem. It was proposed by Leonhard Euler in 1769. It states that for all integers n and k greater than 1, if the sum of n many kth powers of positive integers is itself a kth power, then n is greater than or equal to k:

<span class="mw-page-title-main">Number</span> Used to count, measure, and label

A number is a mathematical object used to count, measure, and label. The original examples are the natural numbers 1, 2, 3, 4, and so forth. Numbers can be represented in language with number words. More universally, individual numbers can be represented by symbols, called numerals; for example, "5" is a numeral that represents the number five. As only a relatively small number of symbols can be memorized, basic numerals are commonly organized in a numeral system, which is an organized way to represent any number. The most common numeral system is the Hindu–Arabic numeral system, which allows for the representation of any number using a combination of ten fundamental numeric symbols, called digits. In addition to their use in counting and measuring, numerals are often used for labels, for ordering, and for codes. In common usage, a numeral is not clearly distinguished from the number that it represents.

In mathematics, a polynomial is an expression consisting of indeterminates and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate x is x2 − 4x + 7. An example with three indeterminates is x3 + 2xyz2yz + 1.

In mathematics, a transcendental number is a number that is not algebraic—that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are π and e.

<span class="mw-page-title-main">Goldbach's conjecture</span> Conjecture that every even integer > 2 is the sum of two primes

Goldbach's conjecture is one of the oldest and best-known unsolved problems in number theory and all of mathematics. It states that every even natural number greater than 2 is the sum of two prime numbers.

A counterexample is any exception to a generalization. In logic a counterexample disproves the generalization, and does so rigorously in the fields of mathematics and philosophy. For example, the fact that "John Smith is not a lazy student" is a counterexample to the generalization “students are lazy”, and both a counterexample to, and disproof of, the universal quantification “all students are lazy.”

In arithmetic and algebra, the fourth power of a number n is the result of multiplying four instances of n together. So:

The Beal conjecture is the following conjecture in number theory:

In mathematics, a proof of impossibility is a proof that demonstrates that a particular problem cannot be solved as described in the claim, or that a particular set of problems cannot be solved in general. Such a case is also known as a negative proof, proof of an impossibility theorem, or negative result. Proofs of impossibility often put to rest decades or centuries of work attempting to find a solution. Proving that something is impossible is usually much harder than the opposite task, as it is often necessary to develop a theory. Impossibility theorems are usually expressible as negative existential propositions or universal propositions in logic.

In mathematics and statistics, sums of powers occur in a number of contexts:

The Jacobi–Madden equation is the Diophantine equation

<span class="mw-page-title-main">Irrational number</span> Number that is not a ratio of integers

In mathematics, the irrational numbers are all the real numbers that are not rational numbers. That is, irrational numbers cannot be expressed as the ratio of two integers. When the ratio of lengths of two line segments is an irrational number, the line segments are also described as being incommensurable, meaning that they share no "measure" in common, that is, there is no length, no matter how short, that could be used to express the lengths of both of the two given segments as integer multiples of itself.

The Lander, Parkin, and Selfridge conjecture concerns the integer solutions of equations which contain sums of like powers. The equations are generalisations of those considered in Fermat's Last Theorem. The conjecture is that if the sum of some k-th powers equals the sum of some other k-th powers, then the total number of terms in both sums combined must be at least k.

In arithmetic and algebra the sixth power of a number n is the result of multiplying six instances of n together. So:

In arithmetic and algebra the seventh power of a number n is the result of multiplying seven instances of n together. So:

In mathematics, specifically additive number theory, Romanov's theorem is a mathematical theorem proved by Nikolai Pavlovich Romanov. It states that given a fixed base b, the set of numbers that are the sum of a prime and a positive integer power of b has a positive lower asymptotic density.

References