smoking186 https://blog.hatena.ne.jp/smoking186/ 186 @ hatenablog https://186.hatenablog.com/ CS Project Euler 2/9を終えたところ. nが341550071728321未満のときまでは素数判定がO(log^3 n)か. Miller-Rabinテストはやっぱり偉いんだなー. ところで本業の方をschemeで書くという暴挙はどうだろう. LLLとか実装すんの. 大変そう. ;Refs:http://www.ice.nuie.nagoya-u.ac.jp/~h003149b/lang/miller.html (define (decomposition-k&q n) ;n=q 2^k (let loop [(k 0) (q n)] (if (even? q) (loop (+ k 1) (/ q 2)) … 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2F186.hatenablog.com%2Fentry%2F20080222%2F1203611635" title=" 素数判定 - 186 @ hatenablog" 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 2008-02-22 01:33:55 rich https://186.hatenablog.com/entry/20080222/1203611635 1.0 100%