benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Joe has written 5 questions of different difficulties for a test with problems…

Problem

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

problem

Joe has written 5 questions of different difficulties for a test with problems numbered 1 though 5. He wants to make sure that problem ii is harder than problem jj whenever i−j≥3i-j \geq 3. In how many ways can he order the problems for his test?
Plain-text mathematical notation (without MathML)
Joe has written 5 questions of different difficulties for a test with problems numbered 1 though 5. He wants to make sure that problem i is harder than problem j whenever i−j≥3. In how many ways can he order the problems for his test?
Original LaTeX notation
Joe has written 5 questions of different difficulties for a test with problems numbered 1 though 5. He wants to make sure that problem $i$ is harder than problem $j$ whenever $i-j \geq 3$. In how many ways can he order the problems for his test?

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
94cd6f29-ffb0-5f77-a580-0c65c55f9b4b
task_key
test--94cd6f29-ffb0-5f77-a580-0c65c55f9b4b
task_revision_id
1
config / split
/ test

Official source

initial import