MHB Oddity of $\left\lfloor{(2+\sqrt3)^n}\right\rfloor$ for All $n \in \mathbb{N}$

  • Thread starter Thread starter kaliprasad
  • Start date Start date
kaliprasad
Gold Member
MHB
Messages
1,333
Reaction score
0
show that $\left\lfloor{(2+\sqrt3)^n}\right\rfloor$ is odd for every positive integer n
 
Mathematics news on Phys.org
My solution:

First, we find that the minimal polynomial for $2+\sqrt{3}$ is:

$$x^2-4x+1$$

And by inspecting initial conditions, we may then state:

$$\left(2+\sqrt{3}\right)^n=U_n+V_n\sqrt{3}$$

where both $U$ and $V$ are defined recursively by:

$$W_{n+1}=4W_{n}-W_{n-1}$$

and:

$$U_0=1,\,U_1=2$$

$$V_0=0,\,U_1=1$$

Now, we can see that $U_n$ and $V_n$ have opposing parities, and given:

$$\left\lfloor U_n+V_n\sqrt{3} \right\rfloor=U_n+V_n\left\lfloor \sqrt{3} \right\rfloor=U_n+V_n$$

We may then conclude that for all natural numbers $n$ that $$\left\lfloor \left(2+\sqrt{3}\right)^n \right\rfloor$$ must be odd, since the sum of an odd and an even natural number will always be odd.
 
A slight variation on the same idea.
[sp] $$(2+\sqrt3)^n + (2-\sqrt3)^n = 2\sum_{k=0}^{\lfloor k/2\rfloor}{n\choose 2k}2^{n-2k}3^k$$ (binomial expansion). The right side is clearly an even integer. On the left side, $(2-\sqrt3)^n < 1$, so it follows that $\left\lfloor(2+\sqrt3)^n\right\rfloor$ is odd.[/sp]
 
MarkFL said:
My solution:

First, we find that the minimal polynomial for $2+\sqrt{3}$ is:

$$x^2-4x+1$$

And by inspecting initial conditions, we may then state:

$$\left(2+\sqrt{3}\right)^n=U_n+V_n\sqrt{3}$$

where both $U$ and $V$ are defined recursively by:

$$W_{n+1}=4W_{n}-W_{n-1}$$

and:

$$U_0=1,\,U_1=2$$

$$V_0=0,\,U_1=1$$

Now, we can see that $U_n$ and $V_n$ have opposing parities, and given:

$$\left\lfloor U_n+V_n\sqrt{3} \right\rfloor=U_n+V_n\left\lfloor \sqrt{3} \right\rfloor=U_n+V_n$$

We may then conclude that for all natural numbers $n$ that $$\left\lfloor \left(2+\sqrt{3}\right)^n \right\rfloor$$ must be odd, since the sum of an odd and an even natural number will always be odd.
$\left\lfloor{V_n\sqrt{3}}\right\rfloor\ne V_n\left\lfloor{\sqrt3}\right\rfloor$
or am I mssing some thing
 
kaliprasad said:
$\left\lfloor{V_n\sqrt{3}}\right\rfloor\ne V_n\left\lfloor{\sqrt3}\right\rfloor$
or am I mssing some thing

Yes, my mistake, that's only true for $V_n\in\{0,1\}$. :D
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top