{"provider_url":"https://hatena.blog","title":"\u4e71\u629e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3000\uff11","categories":[],"version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fecon.hatenablog.jp%2Fentry%2F2018%2F04%2F05%2F112742\" title=\"\u4e71\u629e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3000\uff11 - \u65e5\u3005\u306e\u8a18\u9332\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"height":"190","published":"2018-04-05 11:27:42","type":"rich","width":"100%","blog_url":"https://econ.hatenablog.jp/","url":"https://econ.hatenablog.jp/entry/2018/04/05/112742","blog_title":"\u65e5\u3005\u306e\u8a18\u9332","author_url":"https://blog.hatena.ne.jp/story-nigg/","author_name":"story-nigg","description":"Fermat's little theorem\u3092\u4e71\u629e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3067\u8868\u73fe\u3059\u308b\u3053\u3068\u3092\u8003\u3048\u308b\uff0e 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","provider_name":"Hatena Blog"}