Intereting Posts

Is there any motivation for Zorn's Lemma?
eqiuvalent norms in $H_0^2$
Is $\lim_{n \rightarrow \infty} a_{n+1}/a_n=L \implies \lim_{n \rightarrow \infty} \sqrt {a_n}=L$ true? If not, is there a counter example?
If $$ is finite, then $ = $ iff $G = HK$ (Hungerford Proposition 4.8, Proof)
Cardinality of the set of differentiable functions
$S_6$ contains two subgroups that are isomorphic to $S_5$ but are not conjugate to each other
This integral is defined ? $\displaystyle\int_0^0\frac 1x\:dx$
Is tensor product of Sobolev spaces dense?
Less than or equal sign
Can a rectangle be cut into 5 equal non-rectangular pieces?
Real orthogonal Lie algebra isomorphic to Clifford bivectors
Terms that get closer and closer together
What is $\lfloor i\rfloor$?
Differentiation and integration
A proof for the inequality $\sum_{i=0}^{t-2}{\frac{1}{t+3i}} \leq \frac{1}{2} $ for all $t \geq 2$

For each $n$ consider the expression $$\frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^n\right]$$

I am trying to prove by induction that this is an integer for all $n$.

In the base case $n=1$, it ends up being $1$.

- Multivariable Equation: $4ab=5(a+b)$
- $p$-Splittable Integers
- Show that $x^2\equiv a \pmod {2^n}$ has a solution where $a\equiv1 \pmod 8$ and $n\ge3$
- Subgroup of matrices exercise
- Proof of infinitely many primes, clarification
- Regular $n$-gon in the plane with vertices on integers?

I am trying to prove the induction step:

- if $\frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n}-\left(\frac{1-\sqrt{5}}{2}\right)^n\right]$ is an integer, then so is

$\frac{1}{\sqrt{5}}\left[\left(\frac{1+\sqrt{5}}{2}\right)^{n+1}-\left(\frac{1-\sqrt{5}}{2}\right)^{n+1}\right]$.

I have tried expanding it, but didn’t get anywhere.

- Prime with digits reversed is prime?
- How to solve for any given natural number n?
- Proving the irrationality of $\sqrt{5}$: if $5$ divides $x^2$, then $5$ divides $x$
- If $m=\operatorname{lcm}(a,b)$ then $\gcd(\frac{m}{a},\frac{m}{b})=1$
- What five odd integers have a sum of $30$?
- Prove by contradiction that every integer greater than 11 is a sum of two composite numbers
- Alternative Proof of ${{p^\alpha-1}\choose{k}} \equiv ({-1})^k (mod \ p)$
- If $n$ is an even perfect number $ n> 6$ show that the sum of its digits is $\equiv 1 (\bmod 9)$
- Proof by Induction: Alternating Sum of Fibonacci Numbers
- Proof on cubic residues

Try writing

$$

\left(\frac{1+\sqrt{5}}{2}\right)^n = \frac{a_n+b_n\sqrt{5}}{2}

$$

with $a_1=b_1=1$ and

$$

\frac{a_{n+1}+b_{n+1}\sqrt{5}}{2} = \left(\frac{1+\sqrt{5}}{2}\right)\left(\frac{a_n+b_n\sqrt{5}}{2}\right)

$$

see what you get, then repeat as much as you need to with $\left(\frac{1-\sqrt{5}}{2}\right)^n$.

**Hint** $\rm\quad \phi^{\:n+1}\!-\:\bar\phi^{\:n+1} =\ (\phi+\bar\phi)\ (\phi^n-\:\bar\phi^n)\ -\ \phi\:\bar\phi\,\ (\phi^{\:n-1}\!-\:\bar\phi^{\:n-1})$

Therefore, upon substituting $\rm\ \phi+\bar\phi\ =\ 1\ =\, -\phi\bar\phi\ $ and dividing by $\:\phi-\bar\phi = \sqrt 5\:$ we deduce that $\rm\:f_{n+1} = f_n + f_{n-1}.\:$ Since $\rm\:f_0,f_1\:$ are integers, all $\rm\,f_n\:$ are integers by induction, using the recurrence.

- Rules for Product and Summation Notation
- Pairwise independence of Random variables does not imply indendence
- What is the best base to use?
- Find density for $Z=X+Y$ with joint density function
- Derivation of the Partial Derangement (Rencontres numbers) formula
- Why are (representations of ) quivers such a big deal?
- Dimensions of vector subspaces
- The Fourier series $\sum_{n=1}^\infty (1/n)\cos nx$
- The Space $C(\Omega,\mathbb{R})$ has a Predual?
- Prove that if $a$ and $b$ are odd, coprime numbers, then $\gcd(2^a +1, 2^b +1) = 3$
- $\int^b_a t^kf(t) dt\,=0$ for all $k \geq 1 \implies f=0$ a.e.
- Linear Programming with Matrix Game
- Puzzles or short exercises illustrating mathematical problem solving to freshman students
- Ramanujan theta function and its continued fraction
- Geometric Progression: How to solve for $n$ in the following equation $\frac {5^n-1}4 \equiv 2 \pmod 7$