Search results
Results from the WOW.Com Content Network
In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers. A positive integer which is not polite is called impolite. [1] [2] The impolite numbers are exactly the powers of two, and the polite numbers are the natural numbers that are not powers of two.
Euler's sum of powers conjecture § k = 3, relating to cubes that can be written as a sum of three positive cubes; Plato's number, an ancient text possibly discussing the equation 3 3 + 4 3 + 5 3 = 6 3; Taxicab number, the smallest integer that can be expressed as a sum of two positive integer cubes in n distinct ways
The difference between the cubes of consecutive integers can be expressed as follows: ... with no known 3-cube sum, 42, ... number is the sum of three positive ...
A taxicab number is the smallest integer that can be expressed as a sum of two positive third powers in n distinct ways. The Riemann zeta function is the sum of reciprocals of the positive integers each raised to the power s, where s is a complex number whose real part is greater than 1.
A positive integer that can be written as the sum of two or more consecutive positive integers. A138591: Erdős–Nicolas numbers: 24, 2016, 8190, 42336, 45864, 392448, 714240, 1571328, ... A number n such that there exists another number m and , =. A194472: Solution to Stepping Stone Puzzle
Pierre de Fermat gave a criterion for numbers of the form 8a + 1 and 8a + 3 to be sums of a square plus twice another square, but did not provide a proof. [1] N. Beguelin noticed in 1774 [2] that every positive integer which is neither of the form 8n + 7, nor of the form 4n, is the sum of three squares, but did not provide a satisfactory
This is a particular case of the sum of the reciprocals of any geometric series where the first term and the common ratio are positive integers. If the first term is a and the common ratio is r then the sum is r / a (r − 1) . The Kempner series is the sum of the reciprocals of all positive integers not containing the digit "9" in base 10.
For a positive integer n, p(n) is the number of distinct ways of representing n as a sum of positive integers. For the purposes of this definition, the order of the terms in the sum is irrelevant: two sums with the same terms in a different order are not considered to be distinct.