But of course, the numbers aren't necessarily distinct, so that's an extra wrinkle. At least this reduces the problem into determining whether number of the form 2T, where T is a triangular number, can be represented by 2 or more other triangular numbers.

Every integer is the sum of three triangular numbers, proven by Gauss, and entered in his notebook dated 7/ 10/ 1796. It is sometimes called the Eureka Theorem, for that's what Gauss called it. Ed Gray

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestCheck this out

Fermat Polygonal Number Theorem

But of course, the numbers aren't necessarily distinct, so that's an extra wrinkle. At least this reduces the problem into determining whether number of the form 2T, where T is a triangular number, can be represented by 2 or more other triangular numbers.

Log in to reply

This definitely cannot be done for some numbers. For example 5 = 3 + 1 + 1, but there is no expression for it in terms of unique triangular numbers.

Log in to reply

Every integer is the sum of three triangular numbers, proven by Gauss, and entered in his notebook dated 7/ 10/ 1796. It is sometimes called the Eureka Theorem, for that's what Gauss called it. Ed Gray

Log in to reply

Every integer is the sum of 3 triangular numbers, proven by Gauss, 7/10/1796. Ed Gray

Log in to reply