Intereting Posts

Can $\operatorname{Spec}(R)$ ever be finite?
Integral big question
Does a bounded holomorphic function on the unit disc have summable Taylor coefficients?
Proof for gcd associative property:
Different version of Gauss's Lemma
Double Negation is sequent calculus systems LK and LJ
Generating Functions in Discrete Math
Convexity of $\mathrm{trace}(S) + m^2\mathrm{trace}(S^{-2})$
Square root of a Mersenne number is irrational
What happens after the cardinality $\mathfrak{c}$?
$n = 2^k + 1$ is a prime iff $3^{\frac{n-1}{2}} \equiv -1 \pmod n$
Simultaneous diagonalization
Writing the equation of a perpendicular bisector
Is $M=\{(x,|x|): x \in (-1, 1)\}$ not a differentiable manifold?
Conditional probability on zero probability events (Definition)

The sequence $a_1, a_2, \ldots $ is defined by the initial conditions $$a_1 = 20; \quad a_2 = 30$$ and the recursion

$$a_{n+2} = 3a_{n+1} – a_n$$ and

for $n \geq 1$. Find all positive integers $n$ for which $1 + 5a_n * a_{n+1}$ is a perfect square.

I could only find the $n$-th term and don’t know how to proceed further.pls help

- Finite Summation of Fractional Factorial Series
- Evaluate $\sum_{n=1}^\infty \frac{n}{2^n}$.
- Calculate the sum of the infinite series $\sum_{n=0}^{\infty} \frac{n}{4^n}$
- Is $ \sum\limits_{n=1}^\infty \frac{|\sin n|^n}n$ convergent？
- Formula for the harmonic series $H_n = \sum_{k=1}^n 1/k$ due to Gregorio Fontana
- Proof by Induction $\sum_{i=0}^{k-1} 2^i = 2^k-1$

- What Is The Limit Of The Sequence: $\frac{n^3}{{((3n)!)^\frac{1}{n}}}$
- Find the Maclaurin series of f(x)
- converging subsequence on a circle
- Understanding the solution of a telescoping sum $\sum_{n=1}^{\infty}\frac{3}{n(n+3)}$
- About the solution of a difference equation
- What's the limit of $\prod_1^\infty \left(1-\frac{1}{2^n}\right)=(1-1/2)(1-1/4)(1-1/8)…$?
- Sum of the series $\frac{1}{2\cdot 4}+\frac{1\cdot3}{2\cdot4\cdot6}+\dots$
- Convergence of a sequence of non-negative real numbers $x_n$ given that $x_{n+1} \leq x_n + 1/n^2$.
- Computing the trigonometric sum $ \sum_{j=1}^{n} \cos(j) $
- Compute the limit $\sum_{n=1}^{\infty} \frac{n}{2^n}$

The only such $n$ is $n=3$, with

$$

1 + 5 a_3 a_4 = 1 + 5 \cdot 70 \cdot 180 = 63001 = 251^2.

$$

Let $b_n = a_n/10 = 2, 3, 7, 18, 47, \ldots$ for $n=1,2,3,4,5,\ldots$ .

These are sums of consecutive odd-order Fibonacci numbers:

$2 = 1+1$ (with the first $1$ being $F_{-1}$),

$3 = 1+2$, $7 = 2+5$, $18 = 5+13$, $47 = 13+34$, etc. by induction.

It soon follows that $b_n b_{n+1} = 5 F^2 + 1$ where $F$ is the

Fibonacci number common to $b_n$ and $b_{n+1}$:

$$

2\cdot 3 = 5 \cdot 1^2 + 1,\phantom{M}

3\cdot 7 = 5 \cdot 2^2 + 1,\phantom{M}

7\cdot 18 = 5 \cdot 5^2 + 1,\phantom{M}

18\cdot 47 = 5 \cdot 13^2 + 1,

$$

etc.

So we’re looking to make

$$

1 + 5 a_n a_{n+1} = 1 + 500 b_n b_{n+1} = 2500 F^2 + 501

$$

a square, and it’s easy to see that $F = 5$ is the only positive integer

that makes this happen even without the hypothesis that $F$ be

a Fibonacci number. (For instance, if $2500 F^2 + 501 = y^2$ with $y>0$,

we may factor $501 = y^2 – 2500F^2 = (y-50F) (y+50F)$,

or bound $y$ between $50F$ and $50F+1$ once $F>5$,

or use the technique I described in

this Mathoverflow answer.) Therefore $n=3$ is the unique answer as claimed.

**Note:Just a try. If I’m wrong feel free to comment. Maybe this approach will give someone an idea**

I’ll post a solution, or rather attempt to solve this problem.

Let $1 + 5 \cdot a_n \cdot a_{n+1} = x^2$

First obviously every number in the sequence $a$ is multiple of $10$. So:

$$a_n \cdot a_{n+1} \equiv 0 \pmod {100}$$

$$5 \cdot a_n \cdot a_{n+1} \equiv 0 \pmod {100}$$

$$1 + 5 \cdot a_n \cdot a_{n+1} \equiv 1 \pmod {100}$$

$$x^2 \equiv 1 \pmod {100} \implies x \equiv \pm 1, \pm49 \pmod {100}$$

This means that $x$ can be written as: $ x = 50k \pm 1$

$$1 + 5 \cdot a_n \cdot a_{n+1} = (50k \pm 1)^2$$

$$1 + 5 \cdot a_n \cdot a_{n+1} = 2500k^2 \pm 100k + 1$$

$$5 \cdot a_n \cdot a_{n+1} = 100k(25k \pm 1)$$

Now we can introduce another sequence $b$, where $b_n = \frac{a_n}{10}$

$$5 \cdot b_n \cdot b_{n+1} = k(25k \pm 1)$$

The RHS need to be divisible by $5$, but that’s only possible if $k$ is multiple of $5$. So we write $k=5l$

$$5 \cdot b_n \cdot b_{n+1} = 5l(25k \pm 1)$$

$$b_n \cdot b_{n+1} = l(125l \pm 1)$$

Now using the formula for the sequence we write $b_{n+1} = 3b_n – b_{n-1}$

$$b_n (3b_n – b_{n-1}) = l(125l \pm 1)$$

$$3b_n^2 – b_n \cdot b_{n-1} – l(125l \pm 1) = 0$$

We are now solving a quadratic equation for $b_n$

$$b_n = \frac{b_{n-1} \pm \sqrt{b_{n-1}^2 + 12l(125l \pm 1)}}{6}$$

But because $b_n$ can have one unique value it means that this equation has double root, implying that:

$$b_{n-1}^2 + 12l(125l \pm 1) = 0$$

But $12l(125l \pm 1) > 0$, which means that $b_{n-1}^2 < 0$, which is impossible. This leads to conclusion that an $1 + 5 \cdot a_n \cdot a_{n+1}$ can’t be a perfect square

- In need of tips/suggestions when to add or multiply probabilities
- Sine of natural numbers
- Are Position and Velocity (or Velocity and Acceleration) Vectors Always Parallel?
- Finding $\lim\limits_{x \to \infty} (\sqrt{9x^2+x} – 3x)$
- Combinatorial prime problem
- Rigorous Definition of One-Sided Limits
- Information on “stronger form” of Dirichlet's Theorem on Arithmetic Progressions
- Tiling a $3 \times 2n$ rectangle with dominoes
- what is the usage of combination $C(r,k)$ where $r$ extends to real number?
- Quadratic Equation Based Problem:Prove either $a = 2l$ & $b = m$ or $b + m = al$
- Evaluating $\int_{x=0}^a e^{-x}e^{-1/x}\,\mathrm dx$
- Showing that $e^x > 1+x$
- Prove this bizarre integral:$\int_{0}^{\infty}{\sin(x^{\pi\over4})\over x}dx=1$
- Wanted: example of an increasing sequence of $\sigma$-fields whose union is not a $\sigma$-field
- (Verification) $C \approxeq A$ or $C \approxeq \text{section of } A$ $\forall C$ s.t. $C \subset A$