Showing that $\lceil (\sqrt{3} + 1)^{2n} \rceil$ is divisible by $2^{n+1}$. I have a question which has fluxommed me and my pals for the past few days. Any help or solution is welcome

Show using Binomial theorem that the integer just after $(3^{1/2} + 1)^{2n}$ is divisble by $2^{n+1}$.

here n belongs to natural numbers (positive integers).
 A: This is a classic, the standard proof is to consider
$$ (\sqrt{3} + 1)^{2n} = x_n + y_n \sqrt{3}$$
for integer $x_n$, $y_n$, (which you can see using Binomial theorem) and show that
$$ (\sqrt{3} - 1)^{2n} = x_n - y_n \sqrt{3}$$
again using Binomial theorem.
Now use the fact that $\sqrt{3} - 1 \lt 1$ and that
$$(\sqrt{3} + 1)^{2n} + (\sqrt{3} - 1)^{2n} = 2x_n$$
Thus the integer you are looking for is $2x_n$.
Get a recurrence for $x_n$ and $y_n$ and use induction.
To get the recurrence:
we have that $(\sqrt{3} + 1)^2 = 4 + 2\sqrt{3}$ and so
$$ x_{n+1} + y_{n+1} = (x_n + y_n \sqrt{3})(4 + 2 \sqrt{3}) = (4x_n + 6y_n) + (2x_n + 4y_n) \sqrt{3}$$
Thus
$$ x_{n+1} = 4x_n + 6y_n$$
$$ y_{n+1} = 2x_n + 4y_n$$
Write $$x_{n+2} = 4x_{n+1} + 6y_{n+1}$$ and eliminate $y_n$ and $y_{n+1}$
(I believe it comes to $x_{n+2} = 8x_{n+1} - 4 x_n$)
A: This similar to the Fibonacci sequence and is going to involve a recurrence.
Note that $1+\sqrt{3}$ is a solution of $x^2=2x+2$ and the other solution is $1-\sqrt{3}$.
So you can see that $$a_n=(1+\sqrt{3})^n + (1-\sqrt{3})^n$$ satisfies $$a_{n+2}=2a_{n+1}+2a_n.$$ If this is not instantly obvious then prove it by induction. The sequence $a_n$ starts $2,2,8,20,56,152,416,\ldots$. OEIS A080040
Since $(1-\sqrt{3})^{2n}$ is positive and is less than $1$ for positive $n$, you have $$a_{2n}=\left\lceil(\sqrt3+1)^{2n}\right\rceil\;$$ for positive $n$.
Since $a_0$ and $a_1$ are both divisible by $2$, it is an easy induction from the recurrence that $a_{2n}$ and $a_{2n+1}$ are both divisible by $2^{n+1}$.     
A: This is similar to Henry's answer, but things are simpler if we use $4+2\sqrt{3}=(1+\sqrt{3})^2$ and $4-2\sqrt{3}=(1-\sqrt{3})^2$ instead. These satisfy $x^2-8x+4=0$.
The sequence defined by
$$
a_0=2\text{, }a_1=8\text{, and }a_n=8a_{n-1}-4a_{n-2}\tag{1}
$$
has the solution
$$
\begin{align}
a_n
&=(4+2\sqrt{3})^n+(4-2\sqrt{3})^n\\
&=(1+\sqrt{3})^{2n}+(1-\sqrt{3})^{2n}\\
&=\left\lceil(\sqrt{3}+1)^{2n}\right\rceil\text{ for }n>0\tag{2}
\end{align}
$$
Let $b_n=a_n2^{-n-1}$. Then, $(1)$ becomes
$$
b_0=1\text{, }b_1=2\text{, and }b_n=4b_{n-1}-b_{n-2}\tag{3}
$$
Recursion $(3)$ insures that $b_n\in\mathbb{Z}$ for all $n\ge0$. Thus, for $n>0$, $(2)$ yields
$$
\begin{align}
\left\lceil(\sqrt{3}+1)^{2n}\right\rceil
&=a_n\\
&=2^{n+1}b_n\\
&\in2^{n+1}\mathbb{Z}\tag{4}
\end{align}
$$
A: You can prove by induction method and easily get answer.
Obviously, the statement is true for n =1.
Suppose the statement is true for n=k;
i.e, (√3+1)^(2k) is divisible by 2^(k+1).

(√3+1)^(2k) = [2^(k+1)]*q, for some q.

Now we have to show that the statement is true for n=k+1;
(√3+1)^(2(k+1)) = (√3+1)^(2k + 2) 
                = [(√3+1)^(2k)]*[(√3+1)^(2)]
                = [2^(k+1)]*q*[3 + 1 + 2√3]
                = [2^(k+1)]*q*2*(2 +√3)
                = [2^(k+2)]*q*(2 +√3)  

There fore, (√3+1)^(2(k+1)) is divisible by 2^(k+2).
There fore the statement is true for n=k+1.
