<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>muchance</author_name>
  <author_url>https://blog.hatena.ne.jp/muchance/</author_url>
  <blog_title>mu chance or much chance ?</blog_title>
  <blog_url>https://blog.muchance.jp/</blog_url>
  <categories>
    <anon>Project Euler</anon>
  </categories>
  <description>問題 Problem 3：Largest prime factor The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? 解答例 def primeFactorization(n): i = 2 table = [] while i * i &lt;= n: while n % i == 0: n //= i table.append(i) i += 1 if n &gt; 1: table.append(n) return table re…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.muchance.jp%2Fentry%2F2017%2F04%2F21%2F233000&quot; title=&quot;Project Euler 3 - mu chance or much chance ?&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>2017-04-21 23:30:00</published>
  <title>Project Euler 3</title>
  <type>rich</type>
  <url>https://blog.muchance.jp/entry/2017/04/21/233000</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
