Y by
Let
and
be coprime integers. Call a set
balanced if the numbers
form an arithmetic progression with difference
, and the numbers
form an arithmetic progression with difference
.
In terms of
and
, determine the maximum size of a collection of balanced sets such that every two of them have a non-empty intersection.







In terms of


This post has been edited 1 time. Last edited by Assassino9931, Apr 9, 2025, 10:33 PM