benchmarks.wiki / Public workspace
OlympiadBench / 1775 / Given a positive integer n, find the smallest value of…
Problem
Answer published by the source. Consult the official source to check your work against its answer.
question
Given a positive integer , find the smallest value of over all permutations of .
Plain-text mathematical notation (without MathML)
Given a positive integer n, find the smallest value of ⌊(a₁)/(1)⌋+⌊(a₂)/(2)⌋+⋯+⌊(a_(n))/(n)⌋ over all permutations (a₁,a₂,…,a_(n)) of (1,2,…,n).
Original LaTeX notation
Given a positive integer $n$, find the smallest value of $\left\lfloor\frac{a_{1}}{1}\right\rfloor+\left\lfloor\frac{a_{2}}{2}\right\rfloor+\cdots+\left\lfloor\frac{a_{n}}{n}\right\rfloor$ over all permutations $\left(a_{1}, a_{2}, \ldots, a_{n}\right)$ of $(1,2, \ldots, n)$.answer type
Expression
is multiple answer
false
language
English
question type
Open-ended
subject
Math
Discussion
No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. 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. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.
Source and history
initial import