Skip to main content

Problem 44 Project Euler Solution with python

Pentagon numbers

Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are:
1, 5, 12, 22, 35, 51, 70, 92, 117, 145, ...
It can be seen that P4 + P7 = 22 + 70 = 92 = P8. However, their difference, 70 − 22 = 48, is not pentagonal.
Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference are pentagonal and D = |Pk − Pj| is minimised; what is the value of D?


I have wasted almost three days to solve this question, thinking in a very complicated way. I have read a lot of pdf's and websites online thinking that there should be a very complicated approach to solve this problem. Some of the papers which I have read are as follows:
Arithmetic of Pentagonal Numbers - Fibonacci quaterly
The pentagonal number theorem
Pentagonal Numbers - Wikipedia 
Pentagonal Numbers - Wolfram Math 
Pentagonal Numbers - Mathisfun 
Pentagonal Numbers - Fun way to learn math 
But none of them had any impact on my solution except the Wikipedia page which gave me information to check if the given number is pentagonal number or not.
The formula to check if the given number 'n' is pentagonal number or not is:
(1+(24n+1)1/2)/6 is an integer or not.

 A simple looping will yield the result.

Program

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

Output

Summary

I personally don't think that this problem deserves the Project Euler list. But anyhow they have added this problem on the website and I have written the solution. I am not fully satisfied with the solution. I have also thought of using two for loops with upper limit of 1 million for the first loop. That would have also worked.

 You can 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 if you have found any typo or have a different program or better program or have any 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