Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2019 USAJMO Problems/Problem 5"
Line 2: Line 2:
  
 
1. for all <math>0\leq i,j\leq n</math>, the set <math>S_{i,j}</math> has <math>i+j</math> elements; and
 
1. for all <math>0\leq i,j\leq n</math>, the set <math>S_{i,j}</math> has <math>i+j</math> elements; and
−
2. <math>S_{i,j}\subseteq S_{k,l}</math> whenever <math>0\leq i\leq k\leq n</math> and <math>0\leq j\leq l\leq n</math>.
+
 
 +
2. <math>S_{i,j}\subseteq S_{k,l}</math> whenever <math>0\leq i\leq k\leq n</math> and <math>0\leq j\leq l\leq n</math>.
  
 
Proposed by Ricky Liu
 
Proposed by Ricky Liu

Revision as of 19:11, 19 April 2019

Let $n$ be a nonnegative integer. Determine the number of ways that one can choose $(n+1)^2$ sets $S_{i,j}\subseteq\{1,2,\ldots,2n\}$, for integers $i,j$ with $0\leq i,j\leq n$, such that:

1. for all $0\leq i,j\leq n$, the set $S_{i,j}$ has $i+j$ elements; and

2. $S_{i,j}\subseteq S_{k,l}$ whenever $0\leq i\leq k\leq n$ and $0\leq j\leq l\leq n$.

Proposed by Ricky Liu

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_USAJMO_Problems/Problem_5&oldid=105372"