Let n be a positive integer and A a subset of Z/(n), the set of the integers modulo n, define f(A)=mint∈Z/(n)∣A∩(A+t)∣, where A+t={x+t,x∈A}⊂Z/(n). Define g(n)=max{f(A);A⊂Z/(n),∣A∣=⌊n/2⌋}.
a. Prove that g(n)≤⌊n/4⌋−1,∀n≥1.
b. Prove that g(n)=⌊n/4⌋−1 for infinite values of n≥1.
Solution
a. Let A={a1,a2,…,a⌊n/2⌋}. Consider the sum t=0∑n−1∣A∩(A+t)∣ Now each element a∈A appears in a set A+ti∣A∣=⌊n/2⌋ times: choose ti=a−ai for each i=1,2,…,⌊n/2⌋. So t=0∑n−1∣A∩(A+t)∣=⌊2n⌋2 and the average of ∣A∩(A+t)∣ is n1(⌊2n⌋)2≤4n. Since ∣A∩(A+0)∣=∣A∣>4n is above average, there is a t such that ∣A∩(A+t)∣ is below average, so f(A)≤∣A∩(A+t)∣<4n⟹f(A)≤⌊4n⌋−1. So g(n)≤⌊4n⌋−1.
b. Let p≡3(mod4) be a prime, and set A=(Fp×)2(modp) We have to show that ∣(A+t)∩A∣≥⌊4p⌋−1for all t∈Fp Since this is clear for t=0ˉ, we henceforth assume that t=0ˉ. From now on, all equalities are in Fp, that is, taken modulo p.
We have that x2∈A∩(A+t) if and only if there exists y2∈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=4u2+2t+u−2t2,u∈Fp×, with x=0 and y=0, that is, u+u−1t=0u−1t−u=0⟺u2=±t
(p±t)=(p±1)(pt)=±(pt)
On the other hand, if u2=v2, 4u2+2t+u−2t2=4v2+2t+v−2t2⟺u2−v2=u2t2−v2t2⟺u2v2=t2 Hence, as u2 runs over the non-zero quadratic residues, with exception of ±t, we obtain each x2∈A∩(A+t) twice (observe that the case u2=v2 is excluded since u2⋅u2=t2⟺u2=±t). Therefore ∣A∩(A+t)∣=22p−1−1=4p−3=⌊4p⌋−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.