olymmath

RMO 2013 B6

  • CRMO Paper 2

For a natural number nn , let T(n)T(n) denote the number of ways we can place nn objects of weights 1,2,⋯ ,n1,2,\cdots, n on a balance such that the sum of the weights in each pan is the same. Prove that T(100)>T(99)T(100) > T(99) .

Dataset text AI-MO AoPS. Quoted with source.

Official text: Indian Regional Mathematical Olympiad 2013 official paper, page 1.

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 in-rmo/2013/b6 · Tag FKNCAHYS8D · Edit this page on GitHub · Keys: j next, k previous