benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Joshua chooses five distinct numbers. In how many different ways can he assign…

Problem

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

problem

Joshua chooses five distinct numbers. In how many different ways can he assign these numbers to the variables p,q,r,sp, q, r, s, and tt so that p<s,q<s,r<tp<s, q<s, r<t, and s<ts<t?
Plain-text mathematical notation (without MathML)
Joshua chooses five distinct numbers. In how many different ways can he assign these numbers to the variables p,q,r,s, and t so that p<s,q<s,r<t, and s<t?
Original LaTeX notation
Joshua chooses five distinct numbers. In how many different ways can he assign these numbers to the variables $p, q, r, s$, and $t$ so that $p<s, q<s, r<t$, and $s<t$?

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
8d064433-0cfd-59c5-999f-372957e6cb42
task_key
test--8d064433-0cfd-59c5-999f-372957e6cb42
task_revision_id
1
config / split
/ test

Official source

initial import