{"provider_url":"https://hatena.blog","version":"1.0","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","blog_url":"https://jeneshicc.hatenadiary.org/","title":"Problem 146","description":"http://projecteuler.net/index.php?section=problems&id=146 import Number import Data.List import Control.Monad step = [1,3,7,9,13,27] indivisible p n = and [mod (n*n+s) p /= 0 | s <-step] residue u p = [n | n <-[0..min u (p-1)], indivisible p n] residues u [p] = residue u p residues u (p:ps) = [k*q+n\u2026","type":"rich","height":"190","provider_name":"Hatena Blog","published":"2008-12-12 19:19:06","author_url":"https://blog.hatena.ne.jp/jeneshicc/","author_name":"jeneshicc","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081212%2F1229077146\" title=\"Problem 146 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" 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,"url":"https://jeneshicc.hatenadiary.org/entry/20081212/1229077146","categories":["Project Euler","Haskell"]}