{"schema_version":"ocme-site-results-v1","locale":"en","page_type":"derivations","facts":{"questions":36000,"reviewed":36000,"display_candidates":0,"knowledge":302,"guides":299,"paths":59,"batches":360,"families":1441,"atlas":302,"core":80,"evidence":9,"formal_evidence":5,"formal_subjects":4,"lean_files":6,"lean_toolchain":"leanprover/lean4:v4.30.0","question_state":"candidate","english_state":"ai_candidate","question_Lean":"NOT_RUN","canonical_truth_promotion":false},"filters":{"q":"mko-sequence-limit"},"kind":"guides","total":1,"pages":1,"page":1,"entries":[{"id":"derivation-mko-sequence-limit-01","title":{"zh-Hant":"數列極限：倒數模型的精確尾界與 ε-N 證明","en":"Sequence limits: the exact tail cutoff and an ε-N proof for the reciprocal model"},"summary":{"zh-Hant":"對 u(n)=2−3/(n+1)（n∈ℕ0，即 MKO 模型 L=2、c=−3、d=1）：(1) 證明候選尾界 N 對 ε 合法當且僅當 3/(N+1)<ε；(2) 求 ε=1/2 的最小合法 N，並說明 N=5 為何不合法；(3) 以 ε-N 定義證明 u(n)→2；(4) 說明 N 必須依 ε 選取。","en":"For u(n)=2−3/(n+1) with n∈ℕ0 (the MKO model with L=2, c=−3, d=1): (1) prove that a candidate cutoff N is valid for ε exactly when 3/(N+1)<ε; (2) find the least valid N for ε=1/2 and explain why N=5 fails; (3) prove u(n)→2 from the ε-N definition; (4) show that N must be chosen after ε."},"mko_ids":["mko-sequence-limit"]}],"title":"Concept derivation guides"}