benchmarks.wiki / Public workspace

Omni-MATH / You want to arrange the numbers 1,2,3,…,25 in a sequence with the following property: if n is divisible by m, then the nth number is divisible by the m th number. How many such seq…

Problem

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

problem

You want to arrange the numbers 1,2,3,…,251,2,3, \ldots, 25 in a sequence with the following property: if nn is divisible by mm, then the nnth number is divisible by the mm th number. How many such sequences are there?
Plain-text mathematical notation (without MathML)
You want to arrange the numbers 1,2,3,…,25 in a sequence with the following property: if n is divisible by m, then the nth number is divisible by the m th number. How many such sequences are there?
Original LaTeX notation
You want to arrange the numbers $1,2,3, \ldots, 25$ in a sequence with the following property: if $n$ is divisible by $m$, then the $n$th number is divisible by the $m$ th number. How many such sequences are there?

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