[理工] [離散]-交大101-資訊聯招

看板Grad-ProbAsk作者Frondage (阿福)時間11年前 (2013/01/05 19:15)推噓2(2推 0噓 6→)

留言8則, 4人參與討論串1/1

交大101年 11-b Please compute 1820^13 mod 2537, The answer shold be given in the range of [0, 2536] 想法是用 Euler's theorem來解 2537 = 43 * 59 但好像行不通想問問板友怎麼解這題比較好 //剛寫code算出來結果是2089 12-b What is the largest n so that the following assertion is always true? Assertion: Let G be a graph with 10 vertices in which there is at least one edge among any three vertices. The G must contain Kn, where Kn is the complete graph with n vertices. 這題就不知道怎麼下手謝謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.112.4.195 ※ 編輯: Frondage 來自: 140.112.4.195 (01/05 19:34)

推

movo11

01/05 21:17, , 1^F

01/05 21:17, 1^F

→

movo11

01/05 21:19, , 2^F

01/05 21:19, 2^F

→

cutemiller

01/05 21:32, , 3^F

01/05 21:32, 3^F