Putnam 1991 A6
- Session A
Let denote the number of sums of positive integers which add up to with
Let denote the number of which add up to , with
-
-
each is in the sequence defined by , , and and
-
if then every element in appears at least once as a .
Prove that for each .
(For example, because the relevant sums are and because the relevant sums are )
Curated text Kedlaya Putnam archive. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.