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
SISTEMA DE MEMORIA Y SU IMPACTO EN LAS DECISIONES.
jvpcubias
0
190
Презентация "Знаю Россию"
spilsart
0
320
HTML5 and the Open Web Platform - Lecture 3 - Web Technologies (1019888BNR)
signer
PRO
2
3.1k
Evaluation Methods - Lecture 6 - Human-Computer Interaction (1023841ANR)
signer
PRO
0
1.2k
相互コミュニケーションの難しさ
masakiokuda
0
300
GOVERNOR ADDRESS:2025年9月29日合同公式訪問例会:2720 Japan O.K. ロータリーEクラブ、2025年10月6日卓話:藤田 千克由 氏(国際ロータリー第2720地区 2025-2026年度 ガバナー・大分中央ロータリークラブ・大分トキハタクシー(株)顧問)
2720japanoke
0
690
Réaliser un diagnostic externe
martine
0
320
俺と地方勉強会 - KomeKaigi・地方勉強会への期待 -
pharaohkj
1
640
20250830_MIEE祭_会社員視点での学びのヒント
ponponmikankan
1
180
Cifrado asimétrico
irocho
0
250
AIを使って最新研究 について調べて発表しよ う!
mickey_kubo
4
150
H5P-työkalut
matleenalaakso
4
40k
Featured
See All Featured
How to Create Impact in a Changing Tech Landscape [PerfNow 2023]
tammyeverts
55
3.1k
Building Adaptive Systems
keathley
44
2.8k
The Power of CSS Pseudo Elements
geoffreycrofte
80
6.1k
Chrome DevTools: State of the Union 2024 - Debugging React & Beyond
addyosmani
9
970
Save Time (by Creating Custom Rails Generators)
garrettdimon
PRO
33
1.8k
Facilitating Awesome Meetings
lara
57
6.6k
Code Reviewing Like a Champion
maltzj
527
40k
Rebuilding a faster, lazier Slack
samanthasiow
84
9.3k
Distributed Sagas: A Protocol for Coordinating Microservices
caitiem20
333
22k
KATA
mclloyd
PRO
32
15k
GraphQLとの向き合い方2022年版
quramy
49
14k
RailsConf 2023
tenderlove
30
1.3k
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 ͕ূ໌͞Ε·ͨ͠ɻ