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
コマンドラインを見直そう(1995年からタイムリープ)
sapi_kawahara
0
660
子どもが自立した学習者となるデジタルの活用について
naokikato
PRO
0
180
外国籍エンジニアの挑戦・新卒半年後、気づきと成長の物語
hypebeans
0
730
焦りと不安を、技術力に変える方法 - 新卒iOSエンジニアの失敗談と成長のフレームワーク
hypebeans
1
650
ThingLink
matleenalaakso
28
4.3k
多様なメンター、多様な基準
yasulab
PRO
5
19k
卒論の書き方 / Happy Writing
kaityo256
PRO
54
28k
✅ レポート採点基準 / How Your Reports Are Assessed
yasslab
PRO
0
280
1014
cbtlibrary
0
520
2025年の本当に大事なAI動向まとめ
frievea
0
170
HyRead2526
cbtlibrary
0
200
Human Perception and Cognition - Lecture 4 - Human-Computer Interaction (1023841ANR)
signer
PRO
0
1.3k
Featured
See All Featured
Fantastic passwords and where to find them - at NoRuKo
philnash
52
3.6k
Accessibility Awareness
sabderemane
0
51
Collaborative Software Design: How to facilitate domain modelling decisions
baasie
0
140
Art, The Web, and Tiny UX
lynnandtonic
304
21k
The Curious Case for Waylosing
cassininazir
0
230
Bioeconomy Workshop: Dr. Julius Ecuru, Opportunities for a Bioeconomy in West Africa
akademiya2063
PRO
1
54
Amusing Abliteration
ianozsvald
0
97
Optimizing for Happiness
mojombo
379
71k
Evolution of real-time – Irina Nazarova, EuRuKo, 2024
irinanazarova
9
1.2k
Dealing with People You Can't Stand - Big Design 2015
cassininazir
367
27k
Design in an AI World
tapps
0
140
A Guide to Academic Writing Using Generative AI - A Workshop
ks91
PRO
0
200
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 ͕ূ໌͞Ε·ͨ͠ɻ