I know that sum$(a_i)$ = $2n$ and sum($a_i^2)$ = $4n$ and $a_i$ is any natural number > 0. The sums are from 1 to n so they have exactly n terms.
I want to prove that any $a_i$ must be 2 in these conditions or that those $a_i$ are unique.
In other words: Let $n$ natural numbers $a_i > 0$, and assume the following summations are true: $$ \sum_{i=1}^n a_i = a_1 + a_2 + a_3 + \cdots + a_n = 2n \\ \sum_{i=1}^n a_i^2 = a_1^2 + a_2^2 + a_3^2 + \cdots + a_n^2 = 4n $$
Prove all $a_j = 2$. Or, prove that all $a_j$ are unique.
The problem is: given $a_1,a_2,\dots, a_n$ positive integers such that
$a_1+a_2+\dots + a_n=2n$ and $a_1^2+a_2^2+\dots + a_n^2=4n$, prove that $a_i=2$ for all $1\leq i \leq n$.
This can be solved in a more general setting with Jensen's theorem:
Suppose that $a_1+a_2+\dots + a_n$ are real numbers such that $a_1+a_2+\dots+a_n=A$. And let $f$ be a strictly convex function on $\mathbb R$.
We then have that $f(a_1)+f(a_2)+\dots + f(a_n)\geq nf(A/n)$ with equality if and only if $a_i=a/n$ for all $1\leq i \leq n$.
In our question we have the strictly convex function $f(x)=x^2$, we have that $A=2n$ and we have that $f(a_1)+f(a_2)+\dots + f(a_n)=nf(A/n)$. So we can conclude that $a_i=A/n=2$ for all $1\leq i \leq n$.