Assume that p=3. Then obviously x1 can take any value. Now suppose that p≥5. We want to prove that (x1,x2,…,x2p−1)∈{0,1}2p−1. Note that
i=1∑2p−1(1−axi)2p−1≡2p−1+M((1−a)2p−1−1)(modp),
where M is common value mod p of
i=1∑2p−1xij(1≤j≤2p−1).
If we choose a such that (1−a)2p−1=1, then by using (1−axi)2p−1=±1 or 0 and the above equation we have for each i,
(1−axi)2p−1=(p1−axk)=1
So if (pt)=1 we get
(p1−(1−t)xi)=1
Now if xi=0 then the map f(t)=1−(1−t)xi is bijective. Hence if P is the set of square remainder, f define a bijection from P to itself and
t∈P∑f(t)=t∈P∑t=0,
which implies that xi=1.