問題如下
1. Use the Euclidean algorithm to show that 88 and 945 are co-prime
2. Find the Euler Totient function (n) for n = 323
3.Find the modular inverse of the integer 8 with modulo 17, i.e. find x such that
8x ≡ 1 (mod 17). Steps must be clearly shown.
數學問題 20分
2015-03-19 3:24 am
回答 (1)
2015-03-19 5:07 am
收錄日期: 2021-04-23 23:26:52
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20150318000051KK00079