×

# Sum of Triangular Numbers

Is the set of all positive integers which cannot be expressed as a sum of distinct triangular numbers finite?

Note by Marta Reece
8 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Check 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.

- 7 months, 4 weeks ago

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.

- 7 months, 4 weeks ago

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

- 5 days, 19 hours ago

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

- 5 days, 19 hours ago