Skip to main content

Problem 36 Project Euler Solution with python

Double-base palindromes

The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include leading zeros.)

 Before you continue reading the solution I would recommend you having a look at Palindrome Number Wikipedia, if you don't know what a palindrome number is.

This problem is pretty easy if you have already solved problem 4. You can see my solution to understand the program for this problem. Problem 4 Project Euler Solution with python.

After reading this question it just took me a few minutes to get the solution. Algorithm is simple, use python's inbuilt bin function and then get the binary version of the number. In the similar way use extended slicing to get the reverse of the number. If you don't want to use extended slicing but to use some other program for getting the reverse of the number, then you might have to look at Reverse a string in python. There are a lot of answer given by the community members.

 Now coming back to question, as I was not paying a careful attention to the question to the last problem, I wasted some time solving the problem for wrong question. So this time I didn't want to do the same mistake. If you have observed, the last statement in the question says, "Please note that the palindromic number, in either base, may not include leading zeros". There are two conclusions we can make of this statement.

 First conclusion I made was regarding the base 10 number, according to which if the number is palindrome then there should not be zeros in the end also. So we can eliminate all the multiples of 10.

 Before I came up with the second conclusion, I first revised my concepts with converting Decimal number to Binary number on wikihow. All the even numbers when written in base 2 will have zero at the end. I also checked the same with bin in the interpreter. As we know that there should not be any zeros in the start of the number then there should not be any zeros at the end of the number also. But all the even numbers when written in binary format have zeros and they can be eliminated from our calculation.

 Finally I only had to do iterations for odd numbers and it was easy with xrange, because I only increased the step size to 2. You can see the same in the program also.

Program

Program is very simple and also it is very compact. If you remove all the comments and the time stuff from the code you will end up with just 6 lines of code.

In the program, I have not checked for Base 2 numbers and Base 10 numbers separately. I  simply checked for Base 10 numbers and if the given number is Palindrome in Base 10 then check if the number is Palindrome in Base 2. This has saved me a lot of resources and has also saved a lot of execution time.

As always you can download the source code from Github Gist pep36.py

Output 


Summary

The first time I wrote the program for this problem, it came out to be very simple and compact. Performance was also very good and I didn't think of optimizing the code. I am satisfied with this code because even after looping for  half a million times the execution time is very less. But there might be some scope for improvement. Even if improved we will have to compromise on the compactness of the code.

 If you have any doubt or didn't understand anything then comment in the comment box below and 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 or better program or if you have any suggestion. I will be glad to view each of them. 

 You can also contact me.

 Thank you. Have a nice day😃.
Labels:

Popular posts from this blog

Making a quiz web app with python and flask

Edit : When you are creating a web app with h tml templates, then y ou will have to sa ve the html file in templates folder in the Current Wor ki ng Directory( CWD). If you save the file in the C W D directl y you will get a TemplateNotFound error. Thank you Udhay for pointing it out.   In this post we will create a quiz website using python . I will be using the flask framework . After reading this tutorial you will learn form submission , flask templates , python code in flask templates , shuffling the questions and options with the random module and few others.  Please note that this tutorial is not big as it seems to be. Some of the code has been rewritten to maintain consistency and also font size is somewhat big so that your eyes won't get stressed reading this tutorial. Also the content has not occupied the full width of the page. In this tutorial I am assuming that you are having a very basic understanding of the flask framework . Please refer the documentation
Read more

Problem 11 Project Euler Solution with python

Largest product in a grid In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 04 52 08 83 97 35 99 16 07
Read more

Problem 60 Project Euler Solution with python

Prime pair sets The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a set of four primes with this property. Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime. This problem is j u st a brute force problem. If you have come here because you don't know the limit upto which you will h ave to gener ate the prime numbers t hen go ahe ad and t r y with 10,000 . When I first start ed solving the problem I chose 1 million(beca use most of the problem s on project E uler have this limit ), but it took very long for the computer to fin d the solution. After searching on the internet then I found many people choosing 10, 000 so I have changed my in put f rom 1 million to 10000 and the output was f ast. He
Read more