(b) Let m Sn. How many functions f: X→ Yare one-to-one?

(c) Let m = n. How many bijective functions f: X→Y satisfy f(x1) ≠y1 ?

(d) How many relations are there from X to Y?

(e) How many relations R from X to Y satisfy x1 R y1 and x2 R y2?

(a)

(b)

(c)

4. Let I={0, 1} be the input alphabet and O = {0, 1} be the output aplphabet of a finite state machine that recognizes all strings in the language {0, 1}* {01} {0, 1}⁺. Please draw a state diagram for the finite state machine after minimization.

(a)

6. Consider the number of the partitions of a positive integer into positive summands without regard to order. For example, 4 = 1+1+1+1 = 1+1+2 = 2+2 = 1+3, so the integer 4 has five partitions. Find the generating function for the number of the partitions of a positive integer n into positive summands where each summand appears at most twice in each of the partitions. Please express your generating function in a closed form and indicate how to find the number of the partitions of n from your generating function.

7. Please compute , and y= ((w-x) mod 17), and then output (w, x, y).

110年 - 110 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#104268

110年 - 110 國立中山大學_碩士班招生考試_電機系(丙組)：離散數學#104260

109年 - 109 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105758

108年 - 108 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105776

107年 - 107 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105787

106年 - 106 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105791

105年 - 105 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105816

104年 - 104 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105845

103年 - 103 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105841

102年 - 102 國立中山大學_碩士班招生考試_資工系(甲組)：離散數學#105881