Finding a limit without using L'Hospital's rule

208 Views Asked by At

I encountered an issue for finding the limit for a function, one small step I just can't get. I know that this is classic case for L'Hospital's however our calculus course didn't reach it and I can not use it for this one.

$ 2.3 .m,n\in\mathbb{N}\quad\underset{x\rightarrow1}{\lim}\frac{x^{m}-1}{x^{n}-1}$

$x\neq1$

\begin{aligned}\underset{x\rightarrow1}{\lim}\frac{x^{m}-1}{x^{n}-1}=\underset{x\rightarrow1}{\lim}\frac{x^{m}-1^{m}}{x^{n}-1^{n}}=\underset{x\rightarrow1}{\lim}\frac{\left(x-1\right)\sum_{i=0}^{m-1}x^{i}\cdot1^{m-i-1}}{\left(x-1\right)\sum_{i=0}^{m-1}x^{j}\cdot1^{n-j-1}}=\\ \underset{x\rightarrow1}{\lim}\frac{\left(m-1\right)x^{m-1}}{\left(n-1\right)x^{n-1}}=\underset{x\rightarrow1}{\lim}\frac{mx^{m-1}-x^{m-1}}{nx^{n-1}-x^{n-1}} \end{aligned}

And here I stuck... know I need to reach $\frac{m}{n}$ but how can I proceed...?!!? nothing to cancel out here...

8

There are 8 best solutions below

2
On BEST ANSWER

Another approach is along the lines of

\begin{align} L & = \lim_{x \to 1} \frac{x^m-1}{x^n-1} \\ & = \lim_{h \to 0} \frac{(1+h)^m-1}{(1+h)^n-1} \\ & = \lim_{h \to 0} \frac{1+mh+O(h^2)-1}{1+nh+O(h^2)-1} \\ & = \lim_{h \to 0} \frac{mh+O(h^2)}{nh+O(h^2)} \\ & = \frac{m}{n} \end{align}

1
On

You can factor $$x^m-1 = (x-1)(x^{m-1} + x^{m-2} + \dots + x + 1)$$.

2
On

$$\frac{x^m-1}{x^n-1}=\frac{(x-1)(1+x+x^2+\cdots +x^{m-1})}{(x-1)(1+x+x^2+\cdots +x^{n-1})}$$ The numerator has $m$ terms and the denominator has $n$.

Applying the limit, we get $$\lim_{x \to 1}\frac{x^m-1}{x^n-1}=\frac{m}{n}$$

4
On

It seems you are aware that the numerator and denominator factor. Check the upper limit on the sigma in the denominator, and also check the conclusion that $$\underset{x\rightarrow1}{\lim}\frac{\left(x-1\right)\sum_{i=0}^{m-1}x^{i}\cdot1^{m-i-1}}{\left(x-1\right)\sum_{i=0}^{m-1}x^{j}\cdot1^{n-j-1}}= \underset{x\rightarrow1}{\lim}\frac{\left(m-1\right)x^{m-1}}{\left(n-1\right)x^{n-1}}.$$

The left hand side is correct (apart from the upper limit in the denominator), but the right is not. It should read $$\underset{x\rightarrow1}{\lim}\frac{\sum_{i=0}^{m-1}x^{i}\cdot1^{m-i-1}}{\sum_{i=0}^{n-1}x^{j}\cdot1^{n-j-1}}=\frac{m}{n}.$$

0
On

Once you factor $x-1$ from the numerator and denominator, simply cancel them out, then substitute $1$. This yields

$$\dfrac{\sum_{i=0}^{m-1}1}{\sum_{i=0}^{n-1}1}$$

Since each term in the sum is now constant, this reduces to simple multiplication. There are $m$ $1$'s in the numerator and $n$ $1$'s in the denominator. So the result is simply $\frac{m(1)}{n(1)}=\frac mn$.

0
On

$\lim_{x\to 1} \dfrac{x^m - 1}{x^n - 1} = \lim_{x\to 1} \dfrac{(x-1)(x^{m - 1} + x^{m - 2} + x^{m - 3} + ... + 1)}{(x-1)(x^{n - 1} + x^{n - 2} + x^{n - 3} + ... + 1)} = \lim_{x\to 1} \dfrac{(x-1)\sum_{i=1}^{m} x^{m-i}}{(x-1)\sum_{j=1}^{n} x^{n-j}} = \lim_{x\to 1} \dfrac{\sum_{i=1}^{m} x^{m-i}}{\sum_{j=1}^{n} x^{n-j}} = \dfrac{\sum_{i=1}^{m} 1^{m-i}}{\sum_{j=1}^{n} 1^{n-j}} = \dfrac{\sum_{i=1}^{m} 1}{\sum_{j=1}^{n} 1} = \dfrac{m}{n}$

0
On

\begin{aligned}\underset{x\rightarrow1}{\lim}\frac{x^{m}-1}{x^{n}-1} &=\underset{x\rightarrow1}{\lim}\frac{x^{m}-1^{m}}{x^{n}-1^{n}}\\ &=\underset{x\rightarrow1}{\lim}\frac{\left(x-1\right)\sum_{i=0}^{m-1}x^{i}\cdot1^{m-i-1}}{\left(x-1\right)\sum_{i=0}^{m-1}x^{j}\cdot1^{n-j-1}}\\ &=\underset{x\rightarrow1}{\lim}\frac{\sum_{i=0}^{m-1}x^{i}\cdot1^{m-i-1}}{\sum_h{i=0}^{m-1}x^{j}\cdot1^{n-j-1}}\\ &=\dfrac mn \end{aligned}

0
On

Define $\displaystyle L(m,n) = \underset{x\rightarrow1}{\lim}\frac{x^{m}-1}{x^{n}-1}.$ You wish to find the value of $L(m,n)$ for $m,n\in\mathbb N$.

It’s easy to see that $L(k,k)=1$, and if $L(m,n)$ exists and is nonzero, then $L(m,n)=\dfrac{1}{L(n,m)}$. Now notice that

$$L(m+1,n)=\underset{x\rightarrow1}{\lim}\frac{x^{m+1}-1}{x^{n}-1}=\underset{x\rightarrow1}{\lim}\frac{x\left(x^{m}-1\right)+(x-1)}{x^{n}-1}=L(m,n)+L(1,n),$$

so $L[m,n]$ satisfies the recurrence relation

$L[m,n]={\Big\{} \begin{array}{cc} \ & \begin{array}{cc} 1 & m=n \\ \dfrac{1}{L[n,m]} & m<n \\ L(m-1,n)+L(1,n) & m>n \end{array} \end{array} $

This recurrence relation has a unique solution $L[m,n]=\dfrac{m}{n}$.