Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Features
Speaker Deck
PRO
Sign in
Sign up for free
Search
Search
n^k/a^n
Search
poyo
April 20, 2017
Education
0
200
n^k/a^n
poyo
April 20, 2017
Tweet
Share
More Decks by poyo
See All by poyo
Extended Euclidean algorithm
poyo
0
190
Chinese Remainder Theorem
poyo
0
140
CoordinateTransformation
poyo
0
150
continuity
poyo
0
180
ABC 041 D 徒競走
poyo
0
400
ARC 050 B 花束
poyo
0
630
Other Decks in Education
See All in Education
JOAI2025講評 / joai2025-review
upura
0
170
Virtual and Augmented Reality - Lecture 8 - Next Generation User Interfaces (4018166FNR)
signer
PRO
0
1.7k
Case Studies and Course Review - Lecture 12 - Information Visualisation (4019538FNR)
signer
PRO
1
2k
仮説の取扱説明書/User_Guide_to_a_Hypothesis
florets1
4
320
万博非公式マップとFOSS4G
barsaka2
0
280
Pydantic(AI)とJSONの詳細解説
mickey_kubo
0
110
(キラキラ)人事教育担当のつらみ~教育担当として知っておくポイント~
masakiokuda
0
110
子どものためのプログラミング道場『CoderDojo』〜法人提携例〜 / Partnership with CoderDojo Japan
coderdojojapan
4
16k
The Art of Note Taking
kanaya
1
140
小さなチャレンジが生んだチームの大きな変化 -私のふりかえり探求の原点
callas1900
0
540
登壇未経験者のための登壇戦略~LTは設計が9割!!!~
masakiokuda
3
540
2025/06/05_読み漁り学習
nag8
0
150
Featured
See All Featured
Bootstrapping a Software Product
garrettdimon
PRO
307
110k
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
10
950
Building a Modern Day E-commerce SEO Strategy
aleyda
42
7.4k
Design and Strategy: How to Deal with People Who Don’t "Get" Design
morganepeng
130
19k
Docker and Python
trallard
44
3.5k
Keith and Marios Guide to Fast Websites
keithpitt
411
22k
The Cost Of JavaScript in 2023
addyosmani
51
8.5k
Put a Button on it: Removing Barriers to Going Fast.
kastner
60
3.9k
I Don’t Have Time: Getting Over the Fear to Launch Your Podcast
jcasabona
32
2.4k
Writing Fast Ruby
sferik
628
62k
jQuery: Nuts, Bolts and Bling
dougneiner
63
7.8k
The Web Performance Landscape in 2024 [PerfNow 2024]
tammyeverts
8
680
Transcript
lim n→∞ nk an April 21, 2017
n, k : ࣗવ a : ਖ਼ͷ࣮ ͠ a ≤
1 ͳΒ໌Β͔ʹ nk/an → ∞ (n → ∞) ͳͷͰɺa > 1 ʹର ͯ͠ lim n→∞ nk an = 0 Λূ໌͠·͢ɻ
a > 1 ͳͷͰ a = 1 + h (h
> 0) ͱ͓͚·͢ɻೋ߲ఆཧΑΓ an = (1 + h)n = nC01 + nC1h + nC2h2 + · · · + nCnhn Ͱ͕͢ɺn → ∞ ͱ͢ΔͷͰ k < n ͱԾఆ͍͍ͯ͠Ͱ͢ɻ͜ͷͱ͖ an = nC0 + · · · + nCk+1hk+1 + · · · + nCnhn ≥ nCk+1hk+1 ͕Γཱͪ·͢ɻ
an ≥ nCk+1hk+1 ͕͔ͬͨͷͰ 0 ≤ nk ak ≤ nk
nCk+1hk+1 = nk n! (n − (k + 1))!(k + 1)! hk+1 = nk n(n − 1) · · · (n − k) (k + 1)! hk+1 = 1 n(1 − 1/n) · · · (1 − k/n) (k + 1)! hk → 0 (n → ∞) ͱͳͬͯɺ lim n→∞ nk an = 0 ͕ূ໌͞Ε·ͨ͠ɻ