作者christensen ()
看板Grad-ProbAsk
标题[问题] 离散问题请教?
时间Wed Mar 18 16:28:03 2009
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