Sum of Triangular Numbers

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

#NumberTheory

Note by Marta Reece
4 years, 2 months ago

No vote yet
1 vote

  Easy Math Editor

This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.

When posting on Brilliant:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. 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 1

paragraph 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×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

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.


Michael Mendrin - 4 years, 2 months ago

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.

Marta Reece - 4 years, 2 months ago

I think that after the number 3333, all positive integers can be expressed as a sum of 33 or less distinct triangular numbers. 2,5,8,12,23,332, 5, 8, 12, 23, 33 can not be expressed as a sum of distinct triangular numbers. 2020 can be expressed as a sum of 44 distinct triangular numbers.

Maria Kozlowska - 2 years, 11 months 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

Edwin Gray - 3 years, 7 months ago

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

Edwin Gray - 3 years, 7 months ago
×

Problem Loading...

Note Loading...

Set Loading...