Problem

Source: Romania NMO - 2018

Tags: algebra



Let $n \in \mathbb{N}_{\geq 2}.$ For any real numbers $a_1,a_2,...,a_n$ denote $S_0=1$ and for $1 \leq k \leq n$ denote $$S_k=\sum_{1 \leq i_1 < i_2 < ... <i_k \leq n}a_{i_1}a_{i_2}...a_{i_k}$$Find the number of $n-$tuples $(a_1,a_2,...a_n)$ such that $$(S_n-S_{n-2}+S_{n-4}-...)^2+(S_{n-1}-S_{n-3}+S_{n-5}-...)^2=2^nS_n.$$