Maths Olympiad Prep

Library / /22 of 27

Combinatorics Difficulty 6.9 National olympiad Prove it Brazil

Let nn be a positive integer and AA a subset of Z/(n)\mathbb{Z}/(n), the set of the integers modulo nn, define f(A)=mintZ/(n)A(A+t)f(A) = \min_{t \in \mathbb{Z}/(n)} |A \cap (A+t)|, where A+t={x+t,xA}Z/(n)A+t = \{x+t, x \in A\} \subset \mathbb{Z}/(n). Define g(n)=max{f(A);AZ/(n),A=n/2}g(n) = \max\{f(A); A \subset \mathbb{Z}/(n), |A| = \lfloor n/2 \rfloor\}.

a. Prove that g(n)n/41,n1g(n) \le \lfloor n/4 \rfloor - 1, \forall n \ge 1.

b. Prove that g(n)=n/41g(n) = \lfloor n/4 \rfloor - 1 for infinite values of n1n \ge 1.

Solution

a.
Let A={a1,a2,,an/2}A = \{a_1, a_2, \dots, a_{\lfloor n/2 \rfloor}\}. Consider the sum
t=0n1A(A+t) \sum_{t=0}^{n-1} |A \cap (A+t)|
Now each element aAa \in A appears in a set A+tiA + t_i A=n/2|A| = \lfloor n/2 \rfloor times: choose ti=aait_i = a - a_i for each i=1,2,,n/2i = 1, 2, \dots, \lfloor n/2 \rfloor. So
t=0n1A(A+t)=n22 \sum_{t=0}^{n-1} |A \cap (A+t)| = \left\lfloor \frac{n}{2} \right\rfloor^2
and the average of A(A+t)|A \cap (A+t)| is
1n(n2)2n4. \frac{1}{n} \left( \left\lfloor \frac{n}{2} \right\rfloor \right)^2 \le \frac{n}{4}.
Since A(A+0)=A>n4|A \cap (A+0)| = |A| > \frac{n}{4} is above average, there is a tt such that A(A+t)|A \cap (A+t)| is below average, so
f(A)A(A+t)<n4    f(A)n41. f(A) \le |A \cap (A+t)| < \frac{n}{4} \implies f(A) \le \left\lfloor \frac{n}{4} \right\rfloor - 1.
So g(n)n41g(n) \le \left\lfloor \frac{n}{4} \right\rfloor - 1.

b.
Let p3(mod4)p \equiv 3 \pmod 4 be a prime, and set
A=(Fp×)2(modp) A = (F_p^\times)^2 \pmod{p}
We have to show that
(A+t)Ap41for all tFp |(A+t) \cap A| \ge \left\lfloor \frac{p}{4} \right\rfloor - 1 \quad \text{for all } t \in F_p
Since this is clear for t=0ˉt = \bar{0}, we henceforth assume that t0ˉt \ne \bar{0}. From now on, all equalities are in FpF_p, that is, taken modulo pp.

We have that x2A(A+t)x^2 \in A \cap (A+t) if and only if there exists y2Ay^2 \in A such that
\begin{array}{l@{\quad \Longleftrightarrow \quad}l} x^2 = y^2 + t & (x-y)(x+y) = t \\[1.5ex] \left| \begin{array}{l} x-y=u \\ x+y=u^{-1}t \end{array} \right. & \text{for some } u \in F_p^{\times} \\[1.5ex] \left| \begin{array}{l} x = \displaystyle\frac{u+u^{-1}t}{2} \\ y = \displaystyle\frac{u^{-1}t-u}{2} \end{array} \right. & \text{for some } u \in F_p^{\times} \end{array}

x2=u2+2t+u2t24,uFp×, x^2 = \frac{u^2 + 2t + u^{-2}t^2}{4}, \quad u \in F_p^{\times},
with x0x \neq 0 and y0y \neq 0, that is,
u+u1t0u1tu0    u2±t \left| \begin{array}{l} u + u^{-1}t \neq 0 \\ u^{-1}t - u \neq 0 \end{array} \right. \iff u^2 \neq \pm t

(±tp)=(±1p)(tp)=±(tp) \left(\frac{\pm t}{p}\right) = \left(\frac{\pm 1}{p}\right) \left(\frac{t}{p}\right) = \pm \left(\frac{t}{p}\right)

On the other hand, if u2v2u^2 \neq v^2,
u2+2t+u2t24=v2+2t+v2t24    u2v2=t2u2t2v2    u2v2=t2 \frac{u^2 + 2t + u^{-2}t^2}{4} = \frac{v^2 + 2t + v^{-2}t^2}{4} \iff u^2 - v^2 = \frac{t^2}{u^2} - \frac{t^2}{v^2} \iff u^2 v^2 = t^2
Hence, as u2u^2 runs over the non-zero quadratic residues, with exception of ±t\pm t, we obtain each x2A(A+t)x^2 \in A \cap (A+t) twice (observe that the case u2=v2u^2 = v^2 is excluded since u2u2=t2    u2=±tu^2 \cdot u^2 = t^2 \iff u^2 = \pm t). Therefore
A(A+t)=p1212=p34=p41, |A \cap (A+t)| = \frac{\frac{p-1}{2} - 1}{2} = \frac{p-3}{4} = \left\lfloor \frac{p}{4} \right\rfloor - 1,

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.