benchmarks.wiki / Public workspace

Omni-MATH / Let A be the number of unordered pairs of ordered pairs of integers between 1 and 6 inclusive, and let B be the number of ordered pairs of unordered pairs of integers between 1 and…

Problem

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

problem

Let AA be the number of unordered pairs of ordered pairs of integers between 1 and 6 inclusive, and let BB be the number of ordered pairs of unordered pairs of integers between 1 and 6 inclusive. (Repetitions are allowed in both ordered and unordered pairs.) Find A−BA-B.
Plain-text mathematical notation (without MathML)
Let A be the number of unordered pairs of ordered pairs of integers between 1 and 6 inclusive, and let B be the number of ordered pairs of unordered pairs of integers between 1 and 6 inclusive. (Repetitions are allowed in both ordered and unordered pairs.) Find A−B.
Original LaTeX notation
Let $A$ be the number of unordered pairs of ordered pairs of integers between 1 and 6 inclusive, and let $B$ be the number of ordered pairs of unordered pairs of integers between 1 and 6 inclusive. (Repetitions are allowed in both ordered and unordered pairs.) Find $A-B$.

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

Official source

initial import