Product of all such expressions is a positive integer

Here's my attempt: Call this set $S$. The set $S$ has $2^{n}$ members. No such member can be zero. There is a one-one correspondence between a positive member $x \in S$ and $-x \in S$ (note that both $x$ and $-x$ will belong to this set and this is seen by switching all the signs). Their product is $-x^2 < 0$. And the number of such pairs is $2^n/2 = 2^{n-1}$. For $n \ge 2$, this is an even natural number. And the product of an even number of pairs, where the product of each pair is negative, is of course, positive.

My try is as follows.

Let $P_{n-1}(x) = a_{2^{n-1}}x^{2^{n-1}} + a_{2^{n-1}-1}x^{2^{n-1}-1} + \cdots + a_1 x^1 + a_0$

be the polynomial having roots as numbers of the form $\pm \sqrt{1} \pm \sqrt{2} \pm \sqrt{3} \pm \cdots \pm \sqrt{n-1}$

Then, $P_n(x)$ has roots as $\text{Root of} P_{n-1}(x) \pm \sqrt{n}$. Thus we can transform it as-

$P_n(x) = (a_{2^{n-1}}{(x-\sqrt{n})}^{2^{n-1}} + a_{2^{n-1}-1}{(x-\sqrt{n})}^{2^{n-1}-1} + \cdots + a_1 {(x-\sqrt{n})}^1 + a_0)(a_{2^{n-1}}{(x+\sqrt{n})}^{2^{n-1}} + a_{2^{n-1}-1}{(x+\sqrt{n})}^{2^{n-1}-1} + \cdots + a_1 {(x+\sqrt{n})}^1 + a_0)$

Proposition: $P_n(x) \text{is a polynomial having integer coefficients}$

We prove this using induction.

Base Case - $n = 1 : x^2 -1 = 0$

Assuming for $n-1$, let's try for $n$,

$\displaystyle [x^k]{P_n(x)} = \sum_{b + c = k}{\left(\sum_{m=0}^{2^{n-1}}{\binom{m}{b} a_m {(\sqrt{n})}^{m-b}}\right)\left(\sum_{t=0}^{2^{n-1}}{\binom{t}{c} a_t {(-\sqrt{n})}^{t-c}}\right)}$

(Oh, that is scary, but it is not required).

We can get a $\sqrt{n}$ term left if $m-b = \text{Odd}, t-c = \text{Even}$ or $t-c = \text{Odd}, m-b = \text{Even}$

Now, an irrational term or a non-integer term(in this case), will be left if either

$m-b = \text{Odd}, t -c = \text{Even}$

or

$m-b = \text{Even}, t -c = \text{Odd}$.

And now if there is a case like $(m-b, t-c) = (1,2)$, then there will also be a case like $(m-b,t-c) = (2,1)$. Note that this counter-case will not be there if $m-b = t-c$ but then their parity is same too, so they will not be considered.

Since by interchanging $(m,b) \rightarrow (t,c)$, we change the coefficient of $n^{(m+t-b-c)/2}$from

$\binom{m}{b}\binom{t}{c}a_m a_t \rightarrow -\binom{m}{b}\binom{t}{c}a_m a_t$

all the numbers with fractional powers cancel out and only integers remain.

By observing the general polynomial recurrence we can see that leading coefficient is given by

$a_n = a_{n-1}^2; a_1 = 1 \implies a_n = 1$

And we have just proven that all the other coefficients are integers.

Therefore, all symmetric products of numbers of the form $\pm \sqrt{1} \pm \sqrt{2} \pm \cdots \pm \sqrt{n}$ is an integer.

Hey,great solution.BTW you are in which class?