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
200
0
Share
n^k/a^n
poyo
April 20, 2017
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
680
Other Decks in Education
See All in Education
0203
cbtlibrary
0
150
タイムマシンのつくりかた
nomizone
3
1.2k
P3NFEST 2026 Spring ハンズオン「ハッキング・ラブ!はじめてのハッキングをやってみよう」資料
nomizone
0
400
Measuring what matters
jonoalderson
0
170
Referendum Costituzionale Giustizia
nostradalmine
0
120
ブランチ操作 / 02-a-branch
kaityo256
PRO
0
240
事業紹介資料(トレーナー養成講座)
kentaro1981
0
140
SSH公開鍵認証 / 02-b-ssh
kaityo256
PRO
0
140
計算物理におけるGitの使い方 / 01-c-compphys
kaityo256
PRO
2
540
Padlet opetuksessa
matleenalaakso
12
15k
この講義について / 00-setup
kaityo256
PRO
2
310
演習:GitHubの基本操作 / 06-github-basic
kaityo256
PRO
0
260
Featured
See All Featured
Claude Code どこまでも/ Claude Code Everywhere
nwiizo
64
54k
Thoughts on Productivity
jonyablonski
76
5.1k
The Limits of Empathy - UXLibs8
cassininazir
1
290
SEOcharity - Dark patterns in SEO and UX: How to avoid them and build a more ethical web
sarafernandez
0
160
Put a Button on it: Removing Barriers to Going Fast.
kastner
60
4.2k
The Art of Delivering Value - GDevCon NA Keynote
reverentgeek
16
1.9k
Game over? The fight for quality and originality in the time of robots
wayneb77
1
160
Raft: Consensus for Rubyists
vanstee
141
7.4k
AI: The stuff that nobody shows you
jnunemaker
PRO
5
530
Claude Code のすすめ
schroneko
67
220k
ReactJS: Keep Simple. Everything can be a component!
pedronauck
666
130k
Improving Core Web Vitals using Speculation Rules API
sergeychernyshev
21
1.4k
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 ͕ূ໌͞Ε·ͨ͠ɻ