benchmarks.wiki / Public workspace

Omni-MATH / Let m,n be positive integers. Find the minimum positive integer N which satisfies the following condition. If there exists a set S of integers that contains a complete residue syst…

Problem

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

problem

Let m,nm,n be positive integers. Find the minimum positive integer NN which satisfies the following condition. If there exists a set SS of integers that contains a complete residue system module mm such that |S|=N| S | = N, then there exists a nonempty set A⊆SA \subseteq S so that $n\mid {\sum\limits_{x \in A} x }$.
Plain-text mathematical notation (without MathML)
Let m,n be positive integers. Find the minimum positive integer N which satisfies the following condition. If there exists a set S of integers that contains a complete residue system module m such that |S|=N, then there exists a nonempty set A⊆S so that $n\mid {\sum\limits_{x \in A} x }$.
Original LaTeX notation
Let $m,n$ be positive integers. Find the minimum positive integer $N$ which satisfies the following condition. If there exists a set $S$ of integers that contains a complete residue system module $m$ such that $| S | = N$, then there exists a nonempty set $A \subseteq S$ so that $n\mid {\sum\limits_{x \in A} x }$.

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