benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Find the number of ways to choose two nonempty subsets X and Y of {1,2,…,2001}, such that |Y|=1001 and the smallest element of Y is equal to the largest element of X.

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Find the number of ways to choose two nonempty subsets XX and YY of {1,2,…,2001}\{1,2, \ldots, 2001\}, such that |Y|=1001|Y|=1001 and the smallest element of YY is equal to the largest element of XX.
Plain-text mathematical notation (without MathML)
Find the number of ways to choose two nonempty subsets X and Y of {1,2,…,2001}, such that |Y|=1001 and the smallest element of Y is equal to the largest element of X.
Original LaTeX notation
Find the number of ways to choose two nonempty subsets $X$ and $Y$ of $\{1,2, \ldots, 2001\}$, such that $|Y|=1001$ and the smallest element of $Y$ is equal to the largest element of $X$.

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
8a9264c9-d645-562a-9fb2-b8e0351495a6
task_key
test--8a9264c9-d645-562a-9fb2-b8e0351495a6
task_revision_id
1
config / split
/ test

Official source

initial import