<?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>
    <anon>Haskell</anon>
  </categories>
  <description>http://projecteuler.net/index.php?section=problems&amp;id=182 p182 p q = sum [e | e &lt;-[2..phi-1], gcd e phi == 1, gcd (e-1) (p-1) == 2, gcd (e-1) (q-1) == 2] where phi = (p-1)*(q-1) main = print $ p182 1009 3643 {-- g(e,p) = x^e=x (mod p) の解の数 = gcd(e-1,p-1)+1 a : prime of Zp (Zpの生成元) ,0 &lt;= y &lt; p (a^y)^…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090121%2F1232536913&quot; title=&quot;Problem 182 - 落書き、時々落学&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>2009-01-21 20:21:53</published>
  <title>Problem 182</title>
  <type>rich</type>
  <url>https://jeneshicc.hatenadiary.org/entry/20090121/1232536913</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
