Benchmark AI / Public workspace
Omni-MATH / Find all positive integers a such that there exists a set X of 6 integers satisfying the following conditions: for every k=1,2,…,36 there exist x,y∈X such that ax+y−k is divisible …
Problem
Answer published by the source. Consult the official source to check your work against its answer.
problem
Find all positive integers such that there exists a set of integers satisfying the following conditions: for every there exist such that is divisible by .
Plain-text mathematical notation (without MathML)
Find all positive integers a such that there exists a set X of 6 integers satisfying the following conditions: for every k=1,2,…,36 there exist x,y∈X such that ax+y−k is divisible by 37.
Original LaTeX notation
Find all positive integers $a$ such that there exists a set $X$ of $6$ integers satisfying the following conditions: for every $k=1,2,\ldots ,36$ there exist $x,y\in X$ such that $ax+y-k$ is divisible by $37$.
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.
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