Can you provide a proof or a counterexample to the following claim :
Let $n$ be a natural number greater than one and let $ F_{n}(x)$ be Fibonacci polynomial , then $n$ is prime if and only if : $ \displaystyle\sum_{k=0}^{n-1}F_{n}(k) \equiv -1 \pmod n$ .
You can run this test here .