百度试题 结果1 题目Use Fermat's little theorem to calculate: 72009 (mod 11), 72009 (mod 13), and72009 (mod 17). 相关知识点: 试题来源: 解析 8 (mod 11), 11 (mod 13), 10 (mod 17) 反馈 收藏
How to use Fermat's little theorem Fermat's Little Theorem Letabe an integer that is relatively prime withp,a prime number. Then, ap−1≡1(modp). Here, relatively prime numbers means that there is no number which is greater than 1 such that the number divides both relatively prime num...
And amazingly he just stumbled onto Fermat’s Little Theorem. Given A colors and strings of length P, which are prime, the number of possible strings is A times A times A, P times, or A to the power of P. And when he removed the monocolored strings, he subtracts exactly A strings,...