When I was in highschool I became obsessed with this strange combination I discovered. I don't really know a lot about math but I've recently re-discovered it and believe I have found an answer, but no real way to prove it. I'd like someone with a fair bit more knowledge than me to try at it.
You have 4 single digit number, 4 double digit numbers, and 2 triple digit numbers, demonstrated with "space filling" variables like so; X + X + X + X + XX + XX + XX + XX + XXX + XXX = SUM there are 18 X's above. You are permitted to use each digit from 1 to 9 exactly twice each, no more no less. No zeroes are allowed. They can be in any order, for example: 1 + 2 + 3 + 4 +56 +78 +91 +23 +456 +789 = 1503 Using this setup, how many different possible combinations of digits are there so that the SUM is equal to 1350? And can you prove there are no other possible solutions?
I believe there are 36 possible permutations that sum to 1350. If someone can mathematically prove that or disprove it by discovering additional solutions that I have not found I would be greatly appreciative.
Here are the first 37 elements of a list of 456 that are obtained by imposing the constraint that ones, tens, and hundreds should appear in non-decreasing order from left to right. (As noted by Abraham Zhang in a comment, permuting digits of equal weight does not change the sum.) Many more combinations are possible if that constraint is removed or weakened.
Which elements (if any) of this list contradict your rules? If some do, why?
EDIT: With the "original problem" described in a comment, in which
$$(a + bc + def + gh + i) + (i + hg + fed + cb + a) = 1350 \enspace,$$
the following are the first 37 of 480 solutions obtained by imposing the constraint that $a<i$, $c<h$, and $d<f$: