Please scrutinize the following sets of integers:

S1 (2, 5, 8)
S2 (22, 55, 888, 201)
S3 (232, 88781, 20)
S4 (1, 635, 5, 868, 781, 20 ,115)
S5 (26, 3 ,19, 110, 35, 544, 82, 68, 781, 207)
S6 (3 ,14, 15, 926, 535)

I am choosing one random member from each set :
e.g. 2, 888, 20, 1, 544 and 926.

Sum of those numbers apparently ends by 1.

How many distinct results generated this way will terminate by 1?

How many by a zero digit?

Any comments?

(In reply to re: computer solution by Ady TZIDON)

I see that I did not make clear what that list was a list of.  It follows a paragraph that begins "3085 possible totals have more than one way of occurring"  and I just assumed that it would be understood that the listing that followed included only those that fit this description, of having more than one way of being produced.  The column labeled "ways" contains only integers higher than 1; if there's only one way, then the sum is omitted from the list, to conserve space.

I'll go back and edit the comment to make this more clear.

Posted by Charlie on 2014-02-18 23:39:08