Search results
Results from the WOW.Com Content Network
A Young diagram representing visually a polite expansion 15 = 4 + 5 + 6. 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.
The Erdős–Moser equation, + + + = (+) where m and k are positive integers, is conjectured to have no solutions other than 1 1 + 2 1 = 3 1. The sums of three cubes cannot equal 4 or 5 modulo 9, but it is unknown whether all remaining integers can be expressed in this form.
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
A weak composition of an integer n is similar to a composition of n, but allowing terms of the sequence to be zero: it is a way of writing n as the sum of a sequence of non-negative integers. As a consequence every positive integer admits infinitely many weak compositions (if their length is not bounded).
The first key insight is that the series of positive numbers 1 + 2 + 3 ... value to the sum 1 + 2 + 3 + ... the zeta and eta functions to negative integers. ...
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.
In number theory and combinatorics, a partition of a non-negative integer n, also called an integer partition, is a way of writing n as a sum of positive integers. Two sums that differ only in the order of their summands are considered the same partition. (If order matters, the sum becomes a composition.)
G(3) is at least 4 (since cubes are congruent to 0, 1 or −1 mod 9); for numbers less than 1.3 × 10 9, 1 290 740 is the last to require 6 cubes, and the number of numbers between N and 2N requiring 5 cubes drops off with increasing N at sufficient speed to have people believe that G(3) = 4; [22] the largest number now known not to be a sum of ...