story-nigg https://blog.hatena.ne.jp/story-nigg/ 日々の記録 https://econ.hatenablog.jp/ Fermat's little theoremを乱択アルゴリズムで表現することを考える． p : prime number a in {1, 2, ..., p-1} (mod p) p=5, a=2 (mod5) m, n; integers m>n>0 m = qm+r 0 < r < n m = 13, n = 8 13 = 18 + 5 13 5 (mod 8) < Fermat's little theorem - Wikipedia 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Fecon.hatenablog.jp%2Fentry%2F2018%2F04%2F05%2F112742" title="乱択アルゴリズム　１ - 日々の記録" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2018-04-05 11:27:42 rich https://econ.hatenablog.jp/entry/2018/04/05/112742 1.0 100%