看板
[ Math ]
討論串[其他] 離散一題
共 15 篇文章
內容預覽:
題目: https://imgur.com/a/THhEDA0. 不知道想法對不對. 解法會不會不嚴謹. (a). To check whether F halts on input x. -> this is the halting problem. ∵Halting problem is uns
(還有205個字)
內容預覽:
題目:https://imgur.com/a/dqZwWZL. (a),(b),(C)-i已解. C(n,k)表from n choose k. (c)-i:. 我得到的expression:. C(2n,n)-C(2n,n-1)=1/(n+1) * C(2n,n). (c)-ii覺得怪怪. lar
(還有154個字)
內容預覽:
The notation is the same as above.. c[n] has the road to c[y] or c[y] has the road to c[n] by assumptoin.. There is nothing needed to prove for the fi
(還有794個字)
內容預覽:
題目:. There are n cities(n >= 2) such that. for every pair of cities X and Y,. either X had road to Y(X->Y) or Y had road to X(Y->X).. Prove that there
(還有950個字)
內容預覽:
題目: https://imgur.com/a/t2rJUCV. 題目裡job/candidate都有n個. (a)部分不太懂該如何下手. 也不清楚Hint裡引入imaginary entities的作用. (b)部分不清楚推的合不合理. Assume 2 stable matching T1, T
(還有348個字)