benchmarks.wiki / Public workspace

Omni-MATH / Find all integers n≥3 such that the following property holds: if we list the divisors of n! in increasing order as 1=d₁<d₂<⋯<d_(k)=n! , then we have d₂−d₁≤d₃−d₂≤⋯≤d_(k)−d_(k−1). Co…

Problem

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

problem

Find all integers n≥3n \geq 3 such that the following property holds: if we list the divisors of n!n ! in increasing order as 1=d1<d2<⋯<dk=n!1=d_1<d_2<\cdots<d_k=n! , then we have d2−d1≤d3−d2≤⋯≤dk−dk−1.d_2-d_1 \leq d_3-d_2 \leq \cdots \leq d_k-d_{k-1} . Contents 1 Solution (Explanation of Video) 2 Solution 2 3 Video Solution 4 See Also
Plain-text mathematical notation (without MathML)
Find all integers n≥3 such that the following property holds: if we list the divisors of n! in increasing order as 1=d₁<d₂<⋯<d_(k)=n! , then we have d₂−d₁≤d₃−d₂≤⋯≤d_(k)−d_(k−1). 
Contents   1  Solution (Explanation of Video)  2  Solution 2  3  Video Solution  4  See Also
Original LaTeX notation
Find all integers $n \geq 3$ such that the following property holds: if we list the divisors of $n !$ in increasing order as $1=d_1<d_2<\cdots<d_k=n!$ , then we have \[d_2-d_1 \leq d_3-d_2 \leq \cdots \leq d_k-d_{k-1} .\] 
Contents   1  Solution (Explanation of Video)  2  Solution 2  3  Video Solution  4  See Also

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