benchmarks.wiki / Public workspace
Omni-MATH / Find the smallest positive number λ, such that for any 12 points on the plane P₁,P₂,…,P₁₂(can overlap), if the distance between any two of them does not exceed 1, then …
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Find the smallest positive number , such that for any points on the plane (can overlap), if the distance between any two of them does not exceed , then .
Plain-text mathematical notation (without MathML)
Find the smallest positive number λ, such that for any 12 points on the plane P₁,P₂,…,P₁₂(can overlap), if the distance between any two of them does not exceed 1, then ∑_(1≤i<j≤12)|P_(i)P_(j)|²≤λ.
Original LaTeX notation
Find the smallest positive number $\lambda$, such that for any $12$ points on the plane $P_1,P_2,\ldots,P_{12}$(can overlap), if the distance between any two of them does not exceed $1$, then $\sum_{1\le i<j\le 12} |P_iP_j|^2\le \lambda$.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