{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fnoriok.hatenadiary.jp%2Fentry%2F2014%2F06%2F07%2F235705\" title=\"Project Euler 23 - C#\u7df4\u7fd2\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","height":"190","author_url":"https://blog.hatena.ne.jp/noriok/","image_url":null,"provider_name":"Hatena Blog","width":"100%","published":"2014-06-07 23:57:05","provider_url":"https://hatena.blog","blog_url":"https://noriok.hatenadiary.jp/","version":"1.0","title":"Project Euler 23","url":"https://noriok.hatenadiary.jp/entry/2014/06/07/235705","type":"rich","categories":["C#","PE"],"description":"Problem 23 Wikipedia \u3067\u3001\u5b8c\u5168\u6570\u3001\u4e0d\u8db3\u6570\u3001\u904e\u5270\u6570\u306b\u3064\u3044\u3066\u8abf\u3079\u308b\u3002 \u5b8c\u5168\u6570(perfect number) \u305d\u306e\u6570\u81ea\u8eab\u3092\u9664\u304f\u7d04\u6570\u306e\u548c\u304c\u3001\u305d\u306e\u6570\u81ea\u8eab\u3068\u7b49\u3057\u3044\u81ea\u7136\u6570\u306e\u3053\u3068\u3002 \u4f8b\u3048\u3070 6 (= 1 + 2 + 3)\u300128 (= 1 + 2 + 4 + 7 + 14) \u3084496\u304c\u5b8c\u5168\u6570\u3002 \u4e0d\u8db3\u6570(deficient number) \u81ea\u7136\u6570\u306e\u3046\u3061\u3001\u305d\u306e\u6b63\u306e\u7d04\u6570\u306e\u7dcf\u548c\u304c\u5143\u306e\u6570\u306e2\u500d\u3088\u308a\u5c0f\u3055\u3044\u6570\u306e\u3053\u3068\u3002 \u4f8b\u3048\u307015\u306e\u7d04\u6570\u306e\u7dcf\u548c\u306f 1+3+5+15=24<15\u00d72 \u3067\u3042\u308b\u306e\u306715\u306f\u4e0d\u8db3\u6570\u3002 \u904e\u5270\u6570(abundant number) \u81ea\u7136\u6570\u3067\u3001\u305d\u306e\u6b63\u306e\u7d04\u6570\u306e\u7dcf\u548c\u304c\u5143\u306e\u6570\u306e2\u500d\u3088\u308a\u5927\u304d\u3044\u6570\u306e\u3053\u3068\u2026","blog_title":"C#\u7df4\u7fd2\u65e5\u8a18","author_name":"noriok"}