This is a follow-up to Problem 44289 - Find two triangular numbers whose sum is input.
There are some numbers that are the sum of multiple pairs of triangular numbers. For example, 81 = 36+45 = 15+66 = 3+78. Given a number X, find all of the possible pairs of triangular numbers that add up to X. Your answer should be in a 2-by-X matrix. Each column of the matrix should sum to X, and each pair of triangular numbers should only appear once. The top row sorted from low to high. The output for 81 would be:
[ 3 15 36 78 66 45]
Good luck!
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers245
Suggested Problems
-
4559 Solvers
-
Project Euler: Problem 5, Smallest multiple
1648 Solvers
-
Generate a vector like 1,2,2,3,3,3,4,4,4,4
13591 Solvers
-
835 Solvers
-
Convert a Cell Array into an Array
2185 Solvers
More from this Author80
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
The first test case is wrong 0 and 21 are triangular numbers too (https://oeis.org/A000217), therefore:
multi_triangular(21)
[ 0, 6;
21, 15]
PS: And 0 does not make a pair with every number in this case.