benchmarks.wiki / Public workspace

Omni-MATH / Let a₁,a₂,⋯,a_(n) be a permutation of 1,2,⋯,n. Among all possible permutations, find the minimum of ∑_(i=1)^(n)min{a_(i),2i−1}.

Problem

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

problem

Let a1,a2,,ana_1,a_2,\cdots,a_n be a permutation of 1,2,,n1,2,\cdots,n. Among all possible permutations, find the minimum of i=1nmin{ai,2i1}.\sum_{i=1}^n \min \{ a_i,2i-1 \}.
Plain-text mathematical notation (without MathML)
Let a₁,a₂,⋯,a_(n) be a permutation of 1,2,⋯,n. Among all possible permutations, find the minimum of  ∑_(i=1)^(n)min{a_(i),2i−1}.
Original LaTeX notation
Let $a_1,a_2,\cdots,a_n$ be a permutation of $1,2,\cdots,n$. Among all possible permutations, find the minimum of  $$\sum_{i=1}^n \min \{ a_i,2i-1 \}.$$

Discussion

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

Official source

initial import