olymmath

HMMT November 2010 U11

  • Guts
  • Answer

How many nondecreasing sequences a1,a2,…,a10a_{1}, a_{2}, \ldots, a_{10} are composed entirely of at most three distinct numbers from the set {1,2,…,9}\{1,2, \ldots, 9\} (so 1,1,1,2,2,2,3,3,3,31,1,1,2,2,2,3,3,3,3 and 2,2,2,2,5,5,5,5,5,52,2,2,2,5,5,5,5,5,5 are both allowed)?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

3357

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmnt/2010/u11 · Tag YSJX0155ND · Edit this page on GitHub · Keys: j next, k previous