B Proof that (x^n)/n has a limit of 0 at infinity

Derek Hart
Messages
14
Reaction score
1
I understand that the standard proof is a bit different from my own, but I want to know if my reasoning is valid. PROOF:
Firstly, I assume that x is positive.

I then consider p = inf{n∈ℕ : n>x} . In other words, I choose "p" to be the smallest natural number greater than x. If we choose n>p, then we can rewrite the original statement as ((x/1)(x/2)...(x/(p-1)))*((x/p)...(x/n)). If we let α=((x/1)(x/2)...(x/(p-1))), then xn/n! = α((x/p)...(x/n)) where each term x/k is less than one. Thus α((x/p)...(x/n)) < α(x/n). So if we want to require that (xn/n!) < ε for some ε>0, then we can choose n satisfying α(x/n) < ε ⇒ n > (αx/ε). Since α = (xp-1/(p-1)!), we must have n > (xp/ε(p-1)!). Thus, any n satisfying n > max[p, (xp/ε(p-1)!)] will ensure that xn/n! < ε.

Is this subsequent method for finding sufficiently large "n" viable in practice, and are my findings valid?
 
Mathematics news on Phys.org
That works, sure.

Derek Hart said:
xp/ε(p-1)!
This could be misinterpreted. What exactly is part of the denominator?
Better write it as xp/(ε(p-1)!) to avoid ambiguity.
Or, even better, use TeX: ##\displaystyle n > \frac{x^p}{\epsilon (p-1)!}##.
 
  • Like
Likes Derek Hart and scottdave
Derek Hart said:
I then consider p = inf{n∈ℕ : n>x} . In other words, I choose "p" to be the smallest natural number greater than x.
There's a function that does this, the least integer function, also known as the ceiling function. See http://www.mathwords.com/c/ceiling_function.htm. The notation is ##\lceil x \rceil##. Unrendered, this looks like \lceil x \rceil.

For example, ##\lceil 4.52 \rceil = 5##.

There's a related function, the greatest integer function (or floor function), denoted as ##\lfloor x \rfloor##.
 
  • Like
Likes Derek Hart
mfb said:
That works, sure.

This could be misinterpreted. What exactly is part of the denominator?
Better write it as xp/(ε(p-1)!) to avoid ambiguity.
Or, even better, use TeX: ##\displaystyle n > \frac{x^p}{\epsilon (p-1)!}##.
Yeah sorry I meant for both epsilon and the factorial to be in the denominator. Didn't even notice my mistake at first
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top