$30 off During Our Annual Pro Sale. View Details »
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
TeXで変える教育現場
doratex
0
4.9k
MySmartSTEAM 2526
cbtlibrary
0
170
HCI and Interaction Design - Lecture 2 - Human-Computer Interaction (1023841ANR)
signer
PRO
0
1.4k
Semantic Web and Web 3.0 - Lecture 9 - Web Technologies (1019888BNR)
signer
PRO
2
3.1k
東大1年生にJulia教えてみた
matsui_528
7
11k
1014
cbtlibrary
0
500
Cifrado asimétrico
irocho
0
360
Microsoft Office 365
matleenalaakso
0
2k
令和エンジニアの学習法 〜 生成AIを使って挫折を回避する 〜
moriga_yuduru
0
180
AIは若者の成長機会を奪うのか?
frievea
0
140
自分だけの、誰も想像できないキャリアの育て方 〜偶然から始めるキャリアプラン〜 / Career planning starting by luckly v2
vtryo
1
340
Software
irocho
0
650
Featured
See All Featured
RailsConf 2023
tenderlove
30
1.3k
<Decoding/> the Language of Devs - We Love SEO 2024
nikkihalliwell
0
98
How Software Deployment tools have changed in the past 20 years
geshan
0
29k
Designing Experiences People Love
moore
143
24k
Impact Scores and Hybrid Strategies: The future of link building
tamaranovitovic
0
170
Leveraging LLMs for student feedback in introductory data science courses - posit::conf(2025)
minecr
0
85
Effective software design: The role of men in debugging patriarchy in IT @ Voxxed Days AMS
baasie
0
170
Un-Boring Meetings
codingconduct
0
160
Raft: Consensus for Rubyists
vanstee
141
7.2k
Rebuilding a faster, lazier Slack
samanthasiow
85
9.3k
How to Get Subject Matter Experts Bought In and Actively Contributing to SEO & PR Initiatives.
livdayseo
0
27
Sharpening the Axe: The Primacy of Toolmaking
bcantrill
46
2.6k
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 ͕ূ໌͞Ε·ͨ͠ɻ