2019 USAJMO Problems/Problem 5
Revision as of 18:11, 19 April 2019 by Kevinmathz (talk | contribs)
Let be a nonnegative integer. Determine the number of ways that one can choose
sets
, for integers
with
, such that:
1. for all , the set
has
elements; and
2.
whenever
and
.
Proposed by Ricky Liu