Art of Problem Solving
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
During AMC 10A/12A testing, the AoPS Wiki is in read-only mode and no edits can be made.

2019 USAMO Problems/Problem 4: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

26 April 2023

20 September 2022

14 May 2020

21 April 2019

  • curprev 21:4921:49, 21 April 2019 Superram talk contribs 4,021 bytes +4,021 Created page with "==Problem== 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\}</ma..."
Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_USAMO_Problems/Problem_4"