Prove log(n)/n^sigma is a null sequence.

  • Thread starter Thread starter elliti123
  • Start date Start date
  • Tags Tags
    Calculus Sequence
elliti123
Messages
19
Reaction score
0
Mod note: Moved from the homework section.
1. Homework Statement

If σ > 0 and base b > 1 then prove that ##log n/n^σ## is a null sequence. This is not really a homework since i am self studying Konrad Knopp book about infinite series and i wanted to see different ideas and perspectives on the proof of the problem.Thanks.
 
Last edited by a moderator:
Mathematics news on Phys.org
Can you provide your proof of the problem?

Also what is the b value? Is it the base of the log function?
 
Yes the b is the base of the log function.
 
Mod note: Edited text below to make it more readable.
If b > 1 then we have ##b^σ > 1##. Therefore ##(n/(b^σ)^n)## is a null sequence.
Given ε > 0 we have consequently from a point onwards - say for every n > m, ##(n/(b^σ)^n) < ε' = ε/b^σ##. But in any case, ##log n/n^σ < b^σ(g + 1/(b^σ)^g b^1 ))## . If g denotes the characteristic of log n . If therefore, ## n > b^m## Then, ## |(log\ n/n^σ)| < ε ∀\ n > b^m## Q.E.D

This is the proof of the book and it is a theorem not in the exercises as the author is building up the knowledge of the reader, but as i read this again i have one question now how did he come up with what n has to be bigger than ?
 
Last edited by a moderator:
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