Search results
Results from the WOW.Com Content Network
A Cabtaxi number is the smallest positive number that can be expressed as a sum of two integer cubes in n ways, allowing the cubes to be negative or zero as well as positive. The smallest cabtaxi number after Cabtaxi (1) = 0, is Cabtaxi (2) = 91, [5] expressed as: Cabtaxi (3), the smallest Cabtaxi number expressed in 3 different ways, is 4104 ...
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 an integer 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 ...
Cube (algebra) y = x3 for values of 1 ≤ x ≤ 25. 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. The cube is also the number ...
Here the function is and therefore the three real roots are 2, −1 and −4. In algebra, a cubic equation in one variable is an equation of the form in which a is not zero. The solutions of this equation are called roots of the cubic function defined by the left-hand side of the equation. If all of the coefficients a, b, c, and d of the cubic ...
The sum of the reciprocals of the square numbers (the Basel problem) is the transcendental number π 2 / 6 , or ζ(2) where ζ is the Riemann zeta function. The sum of the reciprocals of the cubes of positive integers is called Apéry's constant ζ(3) , and equals approximately 1.2021 .
The sum within each gmonon is a cube, so the sum of the whole table is a sum of cubes. Visual demonstration that the square of a triangular number equals a sum of cubes. In the more recent mathematical literature, Edmonds (1957) provides a proof using summation by parts.
Sum of cubes of divisors, σ3 (n) up to n = 250. In mathematics, and specifically in number theory, a divisor function is an arithmetic function related to the divisors of an integer. When referred to as the divisor function, it counts the number of divisors of an integer (including 1 and the number itself). It appears in a number of remarkable ...
In number theory, Waring's problem asks whether each natural number k has an associated positive integer s such that every natural number is the sum of at most s natural numbers raised to the power k. For example, every natural number is the sum of at most 4 squares, 9 cubes, or 19 fourth powers. Waring's problem was proposed in 1770 by Edward ...