It gives:
ab
cd
And translates to:
10a+b+10c+d+10a+c+10b+d
Which simplify to:
20a+11b+11c+2d
I guess that the digits should be distincts otherwise 9 everywhere and one zero everywhere would give respectively max and min.
With distincts:
max: a=9; b=8; c=7; d=6 (b and c can be swapped)
For 100
a=[0,4]
b=c (mod 2)
d=/=c (mod 2)
We can take an intermediate step. Let e be the sum of b and c.
e is a multiple of 11.
20a+11e+2d=100
Now, we know that 20a+2d is always even.
So, we can keep: 22,44,66 and 88.
20a+2d=22
a=1; d=1; e=0 (-> b=0; c=0)
20a+2d=44
a=1; d=12 (-> d>9)
a=2;d=2 (-> a=d)
20a+2d=66
a=3;d=3 (-> a=d)
20a+2d=88
a=4;d=4 (-> a=d)
We shown that with distinct numbers, this problem has the empty set as solution. (Eg. "no solution")
If the same number is allowed, we have the candidates eliminated above. With the cross product of sum of 2 multiples of 11 to N.
As "a=b" is a prerequisite (as shown above) we can proceed like this:
{...},{(0,4),(1,3),(2,2),(3,1),(4,0)},{...}
Cardinal is N+1 for each set.
3+5+7+9=24
If duplicates are allowed, there's 24 sums.
We can consider removing sums where operands are a permutation too.
For even sets, it is cardinal/2 for odd sets, (cardinal+1)/2.
2+3+4+5=14
This fully discuss the given problem ;-)
--