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
200
Chinese Remainder Theorem
poyo
0
140
CoordinateTransformation
poyo
0
150
continuity
poyo
0
180
ABC 041 D 徒競走
poyo
0
410
ARC 050 B 花束
poyo
0
670
Other Decks in Education
See All in Education
Tips for the Presentation - Lecture 2 - Advanced Topics in Big Data (4023256FNR)
signer
PRO
0
500
Gitの中身 / 03-a-git-internals
kaityo256
PRO
0
130
2025-12-19-LT
takesection
0
120
Gesture-based Interaction - Lecture 6 - Next Generation User Interfaces (4018166FNR)
signer
PRO
0
2k
演習:Gitの基本操作 / 04-git-basic
kaityo256
PRO
0
340
P3NFEST 2026 Spring ハンズオン「ハッキング・ラブ!はじめてのハッキングをやってみよう」資料
nomizone
0
230
MySmartSTEAM 2526
cbtlibrary
0
210
Blueprint for Strengthening Community Colleges Training Grant Success
territorium
PRO
0
130
AIでキミの未来はどう変わる?
behomazn
0
120
GOBUSATA紹介
chankawa919
0
130
インシデント対応
akira345
0
280
Information Architectures - Lecture 2 - Next Generation User Interfaces (4018166FNR)
signer
PRO
1
1.9k
Featured
See All Featured
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
irinanazarova
9
1.2k
GraphQLの誤解/rethinking-graphql
sonatard
75
11k
Rails Girls Zürich Keynote
gr2m
96
14k
Mozcon NYC 2025: Stop Losing SEO Traffic
samtorres
0
180
Optimising Largest Contentful Paint
csswizardry
37
3.6k
Leo the Paperboy
mayatellez
4
1.5k
Lightning Talk: Beautiful Slides for Beginners
inesmontani
PRO
1
480
SEO for Brand Visibility & Recognition
aleyda
0
4.4k
svc-hook: hooking system calls on ARM64 by binary rewriting
retrage
2
170
Scaling GitHub
holman
464
140k
コードの90%をAIが書く世界で何が待っているのか / What awaits us in a world where 90% of the code is written by AI
rkaga
60
42k
Bioeconomy Workshop: Dr. Julius Ecuru, Opportunities for a Bioeconomy in West Africa
akademiya2063
PRO
1
70
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 ͕ূ໌͞Ε·ͨ͠ɻ