Someone in our school asked this math question, saying it was a super hard riddle. Whoever solves it will be highly honored apparently. But I think this riddle makes no sense.

Can someone validate if this problem even makes sense?

Let S be the set of sequences of length 2018 whose terms are in the set {1,2,3,4,5,6,10} and sum to 3860. Prove that the cardinality of S is at most 2^{3860 * }(\(\frac{2018}{2048}\))^{2018}

CalculatorUser Sep 28, 2019

#1**+2 **

The problem makes sense. It's easy enough to visualize a sequence of length 2018 whose elements are in {1,2,3,4,5,6,10},

and whose terms sum to 3860. It's an integer partition problem.

How sensible the bound on the cardinality of the set of such sequences is will take some figuring.

Rom Sep 29, 2019