Consider $\:\: f(x,y,z) := \alpha^2(x-y) + \alpha(z-y)+ (x-z) \:\:$ with some constant $\alpha \in \mathbb{R} \: \:$ If I'm not wrong, this function isn't cyclic. Now consider $$f(a,b,c) = f(c,a,b) = f(b,c,a) = 0 \:\:\: a,b,c \in \mathbb{R}$$
Does this imply that $a=b=c$?
Motivation
On attempting the second problem from this contest I employed the following approach $$P_1(\alpha) = P_2(\alpha) \implies \alpha^2(a-b)+\alpha(c-b)+(a-c) = 0 \tag 1 \:\:\:\: \text{(I've omitted some simple algebra)}$$
Similarly we get $$\alpha^2(b-c) + \alpha(a-c) + (c-b) = 0 \tag 2$$ $$\alpha^2(c-a) + \alpha(b-a) + (c-b) = 0 \tag 3$$
After this we define $f(x,y,z)$ and if the property that I am thinking of is true, then I think we're done.
Yes, for real $\alpha$ the only solutions are $a=b=c$.
The system of linear equations $f(a,b,c)=0, f(c,a,b)=0,f(b,c,a)=0$ has coefficient matrix $$ A = \left[ \begin {array}{ccc} {\alpha}^{2}+1&-{\alpha}^{2}-\alpha&\alpha -1\\ -{\alpha}^{2}-\alpha&\alpha-1&{\alpha}^{2}+1 \\ \alpha-1&{\alpha}^{2}+1&-{\alpha}^{2}-\alpha \end {array} \right] $$ which has rank $2$ (for generic values of $\alpha$) and null space spanned by $(1,1,1)^T$. Thus for almost all $\alpha$, the only solutions have $a=b=c$. To have other solutions, you'd need the rank to be at most $1$, which would require all $2 \times 2$ submatrices to have determinant $0$, i.e. all entries of the classical adjoint or adjugate to be $0$. In fact, all entries of the adjugate are $-{\alpha}^{4}-{\alpha}^{3}-2\,{\alpha}^{2}+\alpha-1$. But this polynomial has no real roots.