[問題] 離散問題請教?
1. Given a big-O estimate for f(n)=nlog(n!)+n^2+(sin n)^4
use a simple function of smallest order, f(n) = _____________
2. The solution for the recurrence relaion a = a + (n-1), n >=2, a1=5
n n-1
is _____________.
3. consider the game rule: "Given 17 stones in a pile, two players take
turns removing 1, 2, or 3 stones, and whoever takes the last stone loses."
Design a strategy to guarantee one player a win and show your answer
step by step.
請順便告知求解過程拜託了 原po太笨 X(
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 122.118.10.178
討論串 (同標題文章)
以下文章回應了本文：
完整討論串 (本文為第 1 之 2 篇)：