Skip to main content

Problem 57 Project Euler Solution with python

Square root convergents

It is possible to show that the square root of two can be expressed as an infinite continued fraction.
√ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...
By expanding this for the first four iterations, we get:
1 + 1/2 = 3/2 = 1.5
1 + 1/(2 + 1/2) = 7/5 = 1.4
1 + 1/(2 + 1/(2 + 1/2)) = 17/12 = 1.41666...
1 + 1/(2 + 1/(2 + 1/(2 + 1/2))) = 41/29 = 1.41379...
The next three expansions are 99/70, 239/169, and 577/408, but the eighth expansion, 1393/985, is the first example where the number of digits in the numerator exceeds the number of digits in the denominator.
In the first one-thousand expansions, how many fractions contain a numerator with more digits than denominator?


Before we start with the solution, have a look at the following links:

Mathematics Stack: Convergent of square root of 2
Convergent Wolfram

You can also have a look at Wikipedia Continued fraction if you want.

According to the links, if p/q is is the first convergent then the next convergent can be written as (p+2q)/(p+q).

So simply we will start with 1/1 where p = 1 and q = 1 and iterate 1000 times and find how many times the length of p is greater than q.

Program

You can download the source code from Github Gist pep57.py

Output

Summary

This problem is again simple. I am satisfied with the execution time and haven't tried to optimize the code. I also liked the clean and clear solution I have written. One can still optimize the code. 

 Please excuse and correct me if my grammar is wrong or in an ambiguous way. 

 Comment in the comment box below if you have any doubt or didn't understand anything. I will be glad to help you.

 Please do comment in the comment box below if you have found any typo or have a different solution or a better program or have a suggestion. I will be very happy to view each of them.

 You can also contact me.

 Thank you. Have a nice day😃!
Labels:

Popular posts from this blog

Project Euler Problem 62 solution with python

Cubic permutations ¶ The cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits which are also cube. Find the smallest cube for which exactly five permutations of its digits are cube.
Read more

Project Euler Problem 67 Solution with Python

Maximum path sum II By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find the maximum total from top to bottom in triangle.txt (right click and 'Save Link/Target As...'), a 15K text file containing a triangle with one-hundred rows.
Read more

Add/Embed SVG to Blogger website

In this post I will tell you my method(trick) of adding SVG images in a blogger website or blog. Before starting , the first thin g I am assu m ing is that you are aware of SVG if you are here. If not please see S calable V ec tor G raphics Recently when I tried to embed a SVG image for a post on pygal, I tried uploading the SVG file and blogger Image uploader came up with an error, because of which I had to find some other way.  SVG File upload Error in Blogger  I started sea rc hing Google " Embed SVG in Blogger " . I found blogorrhea , w h ich gave some i nformatio n on add ing SVG directly as a markup , which worked , but I faced another problem using this . Also th is guy has used lot of Javascript which was confusin g for me, being new to using SVG.   So I first t houg ht of learning on h ow to embed SVG in HTML and t his on e worked out. Actually we can embed SVG in HTML i n following ways: Using Object tag Using Iframe tag Using embed...
Read more