[分析] 有關序列收斂速度的小問題

[starnick (哈哈 寶貝蛋~~)]

Suppose

    max       |f(n+j) - f(n)| <= K, K<∞, for all nature number n.
 1<= j<= √n


How to see f(n) = √n O(1) in details?

[Here "O" denotes Big-o.]

Thanks a lot ~~

[p.s. So far I could only see f(n) = O(n) as n→∞.]


--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 140.112.111.99