演算法›Ch2 分治法
第 12 題/共 12 題
◀ AL 12/12
12. Existence Proof、Numerical Method、Binary Search
#AL-02-012中Existence ProofNumerical MethodBinary Search
  1. (10%) Consider a fixed positive integer k and a sequence of positive real numbers a1,⋯ ,ak,b1,⋯ ,bka_1,\cdots,a_k,b_1,\cdots,b_k, where ai>0,bi>1a_i>0, b_i>1 for 1≤i≤k1 \le i \le k, such that ∑i=1kai/bir=1\sum_{i=1}^{k} a_i/b_i^r = 1.

(A) [5%] Prove such r exists.

(B) [5%] Design an efficient procedure to find the real number r with error within 10−610^{-6}. (Note: If you don't answer part (A) correctly, then you will not earn any point from this problem!)

📄 交大113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch2 分治法
本章題號 · 1–12 / 12