阿摩線上測驗
登入
首頁
>
研究所、轉學考(插大)◆離散數學
>
110年 - 110台灣聯合大學系統_碩士班招生考試_電機類:離散數學#104950
> 申論題
5. Show time! (10 points] Prove that for every positive integer n, there are n consecutive composite integers. In other words, prove that we can find n consecutive composite integers for any n.
相關申論題
(a) [6 points] Prove that any Sprouts game consists of a finite number of moves before someone loses. In other words, the game will terminate eventually.
#445072
(b) [7 points] Show a tight upper bound on the worst -case number of moves in a Sprouts game that starts with n dots, and prove your answer.
#445073
7. Act together, we go far. [12 points) Suppose we have two isomorphic graphs G1 and H1, as well as two isomor- phic graphs G2 and H2. Prove or disprove tha are also isomorphic.
#445074
(a) [7 points] Use the recurrence tree method to solve the time complexity of recurrence T(n) = 3T(n/4]) + θ(n2) in theθ-notation.
#445075
(b)[7 points] Solve the time complexity of recurrence in the θ-notation without using Master method.
#445076
(1)申論題5%)Let the Foure tansform of xf(x)be G,namely
#445077
(2)(計算題5%Obtain the Four tsform off(x)=x.
#445078
(3)(申論題10% Prove that the inverse Fourier transform of F is equal to f(x).
#445079
(1) (計算題5%)
#445080
(2) (計算題10%)
#445081
相關試卷
110年 - 110台灣聯合大學系統_碩士班招生考試_電機類:離散數學#104950
110年 · #104950
110年 - 110 國立臺灣大學_碩士班招生考試_工程科學及海洋工程學研究所丁組:離散數學(A)#100758
110年 · #100758
109年 - 109 國立高雄大學_碩士班招生考試_資訊工程學系：離散數學#103285
109年 · #103285
阿摩線上測驗
登入