<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>jeneshicc</author_name>
  <author_url>https://blog.hatena.ne.jp/jeneshicc/</author_url>
  <blog_title>落書き、時々落学</blog_title>
  <blog_url>https://jeneshicc.hatenadiary.org/</blog_url>
  <categories>
    <anon>Project Euler</anon>
  </categories>
  <description>The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million. 自分が実装したエラトステネスのふるいは遅かった。単純な素数生成。 p010 = sum$takeWhile(&lt;2000000)$primes primes = 2:filter isPrime [3,5..] isPrime x = all ((/= 0).mod x)$takeWhile (&lt;= (floor.sqrt.fromIntegral$ x)) primes エラトステネス改良 …</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081026%2F1225000234&quot; title=&quot;Problem 10 - 落書き、時々落学&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2008-10-26 14:50:34</published>
  <title>Problem 10</title>
  <type>rich</type>
  <url>https://jeneshicc.hatenadiary.org/entry/20081026/1225000234</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
