Define recursively, $$f(n,k) = \sum_{i=1}^{k}f(n-i,k)$$ with initial conditions $f(n,k)=0$ for $n<0$ and $f(0,k)=1.$ For starters observe that $$\lim_{n\to \infty}\frac{f(n+1,k)}{f(n,k)}=\phi(k)$$ where $\phi(k)>0$ is the positive root of the polynomial $$g_k(x) = x^{k}-\sum_{0\leq l< k}x.$$ Then I observed that, $$\lim_{k\to \infty} \phi(k)=2.$$ I intend to prove this fact by showing that $$2(1-2^{-k})<\phi(k)<2.$$ I understand why $\phi(k)<2$ since $g_k(2)=1.$ But I am not sure why $$2(1-2^{-k})<\phi(k)$$ holds. I have shown that $$\phi(k)<\phi(k+1)$$ perhaps this helps in proving this inequality. I don't know. Any ideas to prove the inequality will be much appreciated.
2026-03-26 07:58:25.1774511905
How to show this inequality involving generalized Fibonacci sequence?
42 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in INEQUALITY
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- Prove or disprove the following inequality
- Proving that: $||x|^{s/2}-|y|^{s/2}|\le 2|x-y|^{s/2}$
- Show that $x\longmapsto \int_{\mathbb R^n}\frac{f(y)}{|x-y|^{n-\alpha }}dy$ is integrable.
- Solution to a hard inequality
- Is every finite descending sequence in [0,1] in convex hull of certain points?
- Bound for difference between arithmetic and geometric mean
- multiplying the integrands in an inequality of integrals with same limits
- How to prove that $\pi^{e^{\pi^e}}<e^{\pi^{e^{\pi}}}$
- Proving a small inequality
Related Questions in RECURRENCE-RELATIONS
- Recurrence Relation for Towers of Hanoi
- Solve recurrence equation: $a_{n}=(n-1)(a_{n-1}+a_{n-2})$
- General way to solve linear recursive questions
- Approximate x+1 without addition and logarithms
- Recurrence relation of the series
- first order inhomogeneous linear difference equation general solution
- Guess formula for sequence in FriCAS
- Solve the following recurrence relation: $a_{n}=10a_{n-2}$
- Find closed form for $a_n=2\frac{n-1}{n}a_{n-1}-2\frac{n-2}{n}a_{n-2}$ for all $n \ge 3$
- Young Tableaux generating function
Related Questions in FIBONACCI-NUMBERS
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
- Fibonacci Numbers Proof by Induction (Looking for Feedback)
- Fibonacci sequence and golden ratio
- Induction proof of Fibonacci numbers
- Fibonacci sequence and divisibility.
- Fibonacci numbers mod $p$
- A proof regarding the Fibonacci Sequence.
- Congruencies for Fibonacci numbers
- Is every $N$th Fibonacci number where $N$ is divisible by $5$ itself divisible by $5$
- Proof involving Fibonacci number and binomial coefficient
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The strict lower bound doesn’t hold at $k=1$. Indeed, $g_1(x)=x-1$ so $\phi(1)=1=2(1-2^{-1})$. Here equality holds.
Let us thus suppose $k \geq 2$. Then $g_k(1)=1-k \neq 0$ so $\phi(k) \neq 1$. Now $\phi(k)$ is a root (other than $1$) of $p(x)=(1-x)g_k(x)=x^k(1-x)-(1-x^k)=x^k(2-x)-1$. We have $p’(x)=x^{k-1}(2k-(k+1)x)$. Thus $p(x)$ is increasing on $[0, \frac{2k}{k+1}]$ and decreasing on $[\frac{2k}{k+1},\infty]$. We have $p(1)=0, p(2)=-1$.
Remark: If we just wanted to prove the weaker statement $\lim_{k\to \infty} \phi(k)=2$, note that we clearly have $\phi(k) \in (\frac{2k}{k+1},2)$ so we are done. The stronger lower bound is proved below.
Note $2^k=(1+1)^k \geq 1+k$ using Bernoulli’s inequality/binomial expansion. Thus $2(1-2^{-k}) \geq 2(1-\frac{1}{k+1})=\frac{2k}{k+1}$. Finally $$ \begin{align} p(2(1-2^{-k})) &=(2(1-2^{-k})^k(2(2^{-k}))-1 \\ &=2(1-2^{-k})^k-1 \\ & >2(1-k2^{-k})-1 \\ &=1-\frac{k}{2^{k-1}} \\ & \geq 0 \\ \end{align}$$ where we have used the strict version of Bernoulli’s inequality for the first inequality, and Bernoulli again/binomial expansion on $2^{k-1}$ for the second inequality.
Thus $p(x)<0=p(1)$ on $[0,1)$, $0=p(1)<p(x)$ on $(1,\frac{2k}{k+1}]$, $p(x) \geq p(2(1-2^{-k}))>0$ on $[\frac{2k}{k+1},2(1-2^{-k})]$ and $p(x) \leq p(2)<0$ on $[2,\infty)$. Thus we conclude $\phi(k) \in (2(1-2^{-k}), 2)$.
Remark: In fact, we easily see $p(2(1-2^{-(k+1)}))=(2(1-2^{-(k+1)}))^k 2^{-k}-1=(1-2^{-(k+1)})^k-1<0$, so we may conclude $\phi(k) \in ((2(1-2^{-k}), 2(1-2^{-(k+1)}))$.