離散數學›Ch1 集合與基礎數論
第 11 題/共 15 題
◀ LS 11/15
11. 反證法、質數、丟番圖方程
#LS-01-011中反證法質數丟番圖方程
  1. (30%) (a) Assume NN is a positive integer, please show that the statement "if 2N−12^N - 1 is prime, then NN is prime" is true using proof by contrapositive. (10%)

(b) 5n+7m=N5n + 7m = N, where n,mn, m are integers and n≥0n \ge 0, m≥0m \ge 0, N≥24N \ge 24. Please show that we can always find n,mn, m to satisfy the equality. For example, (n,m)=(2,2)(n,m) = (2,2) corresponds to 5⋅2+7⋅2=245 \cdot 2 + 7 \cdot 2 = 24 and (n,m)=(5,0)(n,m) = (5,0) corresponds to 5⋅5+7⋅0=255 \cdot 5 + 7 \cdot 0 = 25. (10%)

📄 成大110
跳轉到第題
▤完整推導請見《WH 資工筆記 · 離散數學》Ch1 集合與基礎數論
本章題號 · 1–15 / 15