This is the proof. Now I have two questions:-
Why did Fermat pick a lower limit of 0 here? Why not any other number? Is this formula provable with other numbers as the lower limit?
Where did 'r' come from?
This is the proof. Now I have two questions:-
Why did Fermat pick a lower limit of 0 here? Why not any other number? Is this formula provable with other numbers as the lower limit?
Where did 'r' come from?
On
BEST ANSWER
On
The proof as given in your link is not rigorous. The right approach is to let $0<a<b$ and partition $[a, b] $ via points $$x_k=ar^k, k=0, 1,2,\dots,n,r^n=b/a$$ The Riemann sum for $f(x) =x^m$ for this partition is $$\sum_{k=1}^{n}f(x_{k})(x_k-x_{k-1})$$ which is same as $$\sum_{k=1}^{n}a^{m+1}r^{km} (r^{k}-r^{k-1})=a^{m+1}(r-1)\sum_{k=1}^{n}r^{k(m+1)-1}$$ The above equals $$a^{m+1}(r-1)\cdot\frac{r^m(r^{n(m+1)}-1)}{r^{m+1}-1}$$ and the desired limit as $n\to\infty, r\to 1$ is $$\frac{a^{m+1}}{m+1}((b/a) ^{m+1}-1)=\frac{b^{m+1}-a^{m+1}}{m+1}$$ You can see that the variable $r$ is used only to simplify calculation and minimize typing effort. You can very well replace all instances of $r$ by $\sqrt[n] {b/a} $.
The approach can't be used to deal with an interval which contains $0$ as it makes the definition of $r$ invalid. To deal with integrals over interval $[0,b]$ one can take limit of integral over $[a, b] $ as $a\to 0^+$.