Sixth power

Last updated
64 (2 ) and 729 (3 ) cubelets arranged as cubes (2 and 3 , respectively) and as squares (2 and 3 , respectively) Sixth power example.svg
64 (2 ) and 729 (3 ) cubelets arranged as cubes (2 and 3 , respectively) and as squares (2 and 3 , respectively)

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

Contents

n6 = n × n × n × n × n × n.

Sixth powers can be formed by multiplying a number by its fifth power, multiplying the square of a number by its fourth power, by cubing a square, or by squaring a cube.

The sequence of sixth powers of integers is:

0, 1, 64, 729, 4096, 15625, 46656, 117649, 262144, 531441, 1000000, 1771561, 2985984, 4826809, 7529536, 11390625, 16777216, 24137569, 34012224, 47045881, 64000000, 85766121, 113379904, 148035889, 191102976, 244140625, 308915776, 387420489, 481890304, ... (sequence A001014 in the OEIS )

They include the significant decimal numbers 106 (a million), 1006 (a short-scale trillion and long-scale billion), 10006 (a Quintillion and a long-scale trillion) and so on.

Squares and cubes

The sixth powers of integers can be characterized as the numbers that are simultaneously squares and cubes. [1] In this way, they are analogous to two other classes of figurate numbers: the square triangular numbers, which are simultaneously square and triangular, and the solutions to the cannonball problem, which are simultaneously square and square-pyramidal.

Because of their connection to squares and cubes, sixth powers play an important role in the study of the Mordell curves, which are elliptic curves of the form

When is divisible by a sixth power, this equation can be reduced by dividing by that power to give a simpler equation of the same form. A well-known result in number theory, proven by Rudolf Fueter and Louis J. Mordell, states that, when is an integer that is not divisible by a sixth power (other than the exceptional cases and ), this equation either has no rational solutions with both and nonzero or infinitely many of them. [2]

In the archaic notation of Robert Recorde, the sixth power of a number was called the "zenzicube", meaning the square of a cube. Similarly, the notation for sixth powers used in 12th century Indian mathematics by Bhāskara II also called them either the square of a cube or the cube of a square. [3]

Sums

There are numerous known examples of sixth powers that can be expressed as the sum of seven other sixth powers, but no examples are yet known of a sixth power expressible as the sum of just six sixth powers. [4] This makes it unique among the powers with exponent k = 1, 2, ... , 8, the others of which can each be expressed as the sum of k other k-th powers, and some of which (in violation of Euler's sum of powers conjecture) can be expressed as a sum of even fewer k-th powers.

In connection with Waring's problem, every sufficiently large integer can be represented as a sum of at most 24 sixth powers of integers. [5]

There are infinitely many different nontrivial solutions to the Diophantine equation [6]

It has not been proven whether the equation

has a nontrivial solution, [7] but the Lander, Parkin, and Selfridge conjecture would imply that it does not.

Other properties

See also

Related Research Articles

<span class="mw-page-title-main">Diophantine equation</span> Polynomial equation whose integer solutions are sought

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.

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:

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 + 2xyz2 − yz + 1.

Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge to provide a general algorithm which, for any given Diophantine equation, can decide whether the equation has a solution with all unknowns taking integer values.

<span class="mw-page-title-main">Algebraic number theory</span> Branch of number theory

Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and function fields. These properties, such as whether a ring admits unique factorization, the behavior of ideals, and the Galois groups of fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations.

In recreational mathematics, a repdigit or sometimes monodigit is a natural number composed of repeated instances of the same digit in a positional number system. The word is a portmanteau of repeated and digit. Examples are 11, 666, 4444, and 999999. All repdigits are palindromic numbers and are multiples of repunits. Other well-known repdigits include the repunit primes and in particular the Mersenne primes.

In mathematics, a proof by infinite descent, also known as Fermat's method of descent, is a particular kind of proof by contradiction used to show that a statement cannot possibly hold for any number, by showing that if the statement were to hold for a number, then the same would be true for a smaller number, leading to an infinite descent and ultimately a contradiction. It is a method which relies on the well-ordering principle, and is often used to show that a given equation, such as a Diophantine equation, has no solutions.

<span class="mw-page-title-main">Cube (algebra)</span> Number raised to the third power

In arithmetic and algebra, the cube of a number n is its third power, that is, the result of multiplying three instances of n together. The cube of a number or any other mathematical expression is denoted by a superscript 3, for example 23 = 8 or (x + 1)3.

<span class="mw-page-title-main">Powerful number</span> Numbers whose prime factors all divide the number more than once

A powerful number is a positive integer m such that for every prime number p dividing m, p2 also divides m. Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a2b3, where a and b are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful.

In mathematics, Helmut Hasse's local–global principle, also known as the Hasse principle, is the idea that one can find an integer solution to an equation by using the Chinese remainder theorem to piece together solutions modulo powers of each different prime number. This is handled by examining the equation in the completions of the rational numbers: the real numbers and the p-adic numbers. A more formal version of the Hasse principle states that certain types of equations have a rational solution if and only if they have a solution in the real numbers and in the p-adic numbers for each prime p.

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

<span class="mw-page-title-main">Klaus Roth</span> British mathematician

Klaus Friedrich Roth was a German-born British mathematician who won the Fields Medal for proving Roth's theorem on the Diophantine approximation of algebraic numbers. He was also a winner of the De Morgan Medal and the Sylvester Medal, and a Fellow of the Royal Society.

The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer that is 2 or more, there exist positive integers , , and for which

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

<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 fifth power or sursolid of a number n is the result of multiplying five instances of n together:

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

<span class="mw-page-title-main">Sums of three cubes</span> Problem in number theory

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 to equal such a sum is that 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.

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

References

  1. ↑ Dowden, Richard (April 30, 1825), "(untitled)", Mechanics' Magazine and Journal of Science, Arts, and Manufactures, Knight and Lacey, vol. 4, no. 88, p. 54
  2. ↑ Ireland, Kenneth F.; Rosen, Michael I. (1982), A classical introduction to modern number theory, Graduate Texts in Mathematics, vol. 84, Springer-Verlag, New York-Berlin, p. 289, ISBN   0-387-90625-8, MR   0661047 .
  3. ↑ Cajori, Florian (2013), A History of Mathematical Notations, Dover Books on Mathematics, Courier Corporation, p. 80, ISBN   9780486161167
  4. ↑ Quoted in Meyrignac, Jean-Charles (14 February 2001). "Computing Minimal Equal Sums Of Like Powers: Best Known Solutions" . Retrieved 17 July 2017.
  5. ↑ Vaughan, R. C.; Wooley, T. D. (1994), "Further improvements in Waring's problem. II. Sixth powers", Duke Mathematical Journal, 76 (3): 683–710, doi:10.1215/S0012-7094-94-07626-6, MR   1309326
  6. ↑ Brudno, Simcha (1976), "Triples of sixth powers with equal sums", Mathematics of Computation, 30 (135): 646–648, doi: 10.1090/s0025-5718-1976-0406923-6 , MR   0406923
  7. ↑ Bremner, Andrew; Guy, Richard K. (1988), "Unsolved Problems: A Dozen Difficult Diophantine Dilemmas", American Mathematical Monthly, 95 (1): 31–36, doi:10.2307/2323442, JSTOR   2323442, MR   1541235
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.