2019 USAJMO Problems/Problem 5
Revision as of 18:11, 19 April 2019 by Kevinmathz (talk | contribs) (Created page with "Let <math>n</math> be a nonnegative integer. Determine the number of ways that one can choose <math>(n+1)^2</math> sets <math>S_{i,j}\subseteq\{1,2,\ldots,2n\}</math>, for int...")
Let be a nonnegative integer. Determine the number of ways that one can choose
sets
, for integers
with
, such that:
[list]
[*] for all
, the set
has
elements; and
[*]
whenever
and
.
[/list]
[i]Proposed by Ricky Liu[/i]