{"version":"1.0","published":"2008-10-29 22:33:28","url":"https://jeneshicc.hatenadiary.org/entry/20081029/1225287208","type":"rich","blog_url":"https://jeneshicc.hatenadiary.org/","author_name":"jeneshicc","provider_url":"https://hatena.blog","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081029%2F1225287208\" title=\"Problem 27 - \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>","categories":["Project Euler"],"width":"100%","title":"Problem 27","height":"190","author_url":"https://blog.hatena.ne.jp/jeneshicc/","description":"Euler published the remarkable quadratic formula:n\u00b2 + n + 41It turns out that the formula will produce 40 primes for the consecutive values n = 0 to 39. However, when n = 40, 402 + 40 + 41 = 40(40 + 1) + 41 is divisible by 41, and certainly when n = 41, 41\u00b2 + 41 + 41 is clearly divisible by 41.Using\u2026","image_url":null}