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 Solvers247
Suggested Problems
-
23760 Solvers
-
Project Euler: Problem 3, Largest prime factor
1790 Solvers
-
Project Euler: Problem 7, Nth prime
1753 Solvers
-
Create a square matrix of multiples
498 Solvers
-
Find the maximum number of decimal places in a set of numbers
3385 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.