Maths Olympiad Prep

Library / Brazilian Math Olympiad /56 of 66

Brazilian Math Olympiad

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)=min⁡t∈Z/(n)∣A∩(A+t)∣f(A) = \min_{t \in \mathbb{Z}/(n)} |A \cap (A+t)|, where A+t={x+t,x∈A}⊂Z/(n)A+t = \{x+t, x \in A\} \subset \mathbb{Z}/(n). Define g(n)=max⁡{f(A);A⊂Z/(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/4⌋−1,∀n≥1g(n) \le \lfloor n/4 \rfloor - 1, \forall n \ge 1.

b. Prove that g(n)=⌊n/4⌋−1g(n) = \lfloor n/4 \rfloor - 1 for infinite values of n≥1n \ge 1.

Solution

a.
Let A={a1,a2,…,a⌊n/2⌋}A = \{a_1, a_2, \dots, a_{\lfloor n/2 \rfloor}\}. Consider the sum
∑t=0n−1∣A∩(A+t)∣ \sum_{t=0}^{n-1} |A \cap (A+t)|
Now each element a∈Aa \in A appears in a set A+tiA + t_i ∣A∣=⌊n/2⌋|A| = \lfloor n/2 \rfloor times: choose ti=a−ait_i = a - a_i for each i=1,2,…,⌊n/2⌋i = 1, 2, \dots, \lfloor n/2 \rfloor. So
∑t=0n−1∣A∩(A+t)∣=⌊n2⌋2 \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⌋)2≤n4. \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)≤⌊n4⌋−1. 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)≤⌊n4⌋−1g(n) \le \left\lfloor \frac{n}{4} \right\rfloor - 1.

b.
Let p≡3(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)∩A∣≥⌊p4⌋−1for all t∈Fp |(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 t≠0ˉt \ne \bar{0}. From now on, all equalities are in FpF_p, that is, taken modulo pp.

We have that x2∈A∩(A+t)x^2 \in A \cap (A+t) if and only if there exists y2∈Ay^2 \in A such that
x2=y2+t(x−y)(x+y)=t∣x−y=ux+y=u−1tfor some u∈Fp×∣x=u+u−1t2y=u−1t−u2for some u∈Fp× \begin{array}{ll} 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+u−2t24,u∈Fp×, x^2 = \frac{u^2 + 2t + u^{-2}t^2}{4}, \quad u \in F_p^{\times},
with x≠0x \neq 0 and y≠0y \neq 0, that is,
∣u+u−1t≠0u−1t−u≠0  ⟺  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 u2≠v2u^2 \neq v^2,
u2+2t+u−2t24=v2+2t+v−2t24  ⟺  u2−v2=t2u2−t2v2  ⟺  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 x2∈A∩(A+t)x^2 \in A \cap (A+t) twice (observe that the case u2=v2u^2 = v^2 is excluded since u2⋅u2=t2  ⟺  u2=±tu^2 \cdot u^2 = t^2 \iff u^2 = \pm t). Therefore
∣A∩(A+t)∣=p−12−12=p−34=⌊p4⌋−1, |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,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.