benchmarks.wiki / Public workspace

Omni-MATH / Find the smallest positive integer K such that every K-element subset of {1,2,...,50} contains two distinct elements a,b such that aplus{}b divides ab.

Problem

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

problem

Find the smallest positive integer K K such that every K K-element subset of {1,2,...,50} \{1,2,...,50 \} contains two distinct elements a,b a,b such that $ a\plus{}b$ divides ab ab.
Plain-text mathematical notation (without MathML)
Find the smallest positive integer K such that every K-element subset of {1,2,...,50} contains two distinct elements a,b such that $ a\plus{}b$ divides ab.
Original LaTeX notation
Find the smallest positive integer $ K$ such that every $ K$-element subset of $ \{1,2,...,50 \}$ contains two distinct elements $ a,b$ such that $ a\plus{}b$ divides $ ab$.

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