{"height":"190","author_url":"https://blog.hatena.ne.jp/gom68/","title":"Project Euler - Problem 2","width":"100%","categories":["ruby"],"provider_name":"Hatena Blog","author_name":"gom68","url":"https://gom.hatenablog.com/entry/20090323/1237766613","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fgom.hatenablog.com%2Fentry%2F20090323%2F1237766613\" title=\"Project Euler - Problem 2 - gom68\u306e\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>","description":"1\u5206\u9593\u3067\u306a\u3093\u3066\u3068\u3066\u3082\u89e3\u3051\u307e\u305b\u3093\u3002 Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...Find the sum of all the even-valued terms in the sequence which do not exceed four million. #!/usr/bin/en\u2026","blog_title":"gom68\u306e\u65e5\u8a18","provider_url":"https://hatena.blog","type":"rich","published":"2009-03-23 09:03:33","image_url":null,"version":"1.0","blog_url":"https://gom.hatenablog.com/"}