Scribd
Upload
29 views

Num Py Project Euler 4

The document discusses solving Project Euler Problem 4 using NumPy. It involves: 1. Creating an array of 3-digit numbers from 100 to 999. 2. Creating an array of all possible products by taking the outer product and flattening the results. 3. Iterating through the products array in reverse order, converting numbers to strings, and checking for palindromic numbers by comparing to the reversed string. The largest palindromic number found is printed.

Uploaded by

ivan2
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
29 views

Num Py Project Euler 4

The document discusses solving Project Euler Problem 4 using NumPy. It involves: 1. Creating an array of 3-digit numbers from 100 to 999. 2. Creating an array of all possible products by taking the outer product and flattening the results. 3. Iterating through the products array in reverse order, converting numbers to strings, and checking for palindromic numbers by comparing to the reversed string. The largest palindromic number found is printed.

Uploaded by

ivan2
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ivanidris.

net

NumPy Project Euler Problem 4


Project Euler Problem 4 is a bit silly. Its about palindromic numbers. I could not find an appropriate algorithm, so I just tried something out. It seems to work OK.

1. Create a 3-digit numbers array


We will create an array to hold 3-digit numbers from 100 to 999 using our favorite NumPy function arange. Check the first and last element of the array with the assert_equal function from the numpy.testing package.
a = numpy.arange(100, 1000) numpy.testing.assert_equal(100, a[0]) numpy.testing.assert_equal(999, a[-1])

2. Create the products array


Now we will create an array to hold all the possible products of the elements of the 3-digits array with itself. We can accomplish this with the outer function. The resulting array needs to be flattened with ravel, to be able to easily iterate over it. Call the sort method on the array to make sure the array is properly sorted. After that we can do some sanity checks.
numbers = numpy.outer(a, a) numbers = numpy.ravel(numbers) numbers.sort() numpy.testing.assert_equal(810000, len(numbers)) numpy.testing.assert_equal(10000, numbers[0]) numpy.testing.assert_equal(998001, numbers[-1])

3. Find the largest palindromic number


At this point I decided to continue with standard Python. We can probably do something fancy with NumPy, but it looked like reversing string representations of the numbers, and comparing them to the originals would be simpler.
for i in xrange(-1, -1 * len(numbers), -1): s = str(numbers[i]) if s == s[::-1]: print s break

Below is the complete program.


import numpy import numpy.testing #A palindromic number reads the same both ways. #The largest palindrome made from the product of two 2-digit numbers is 9009 = 9 1 x 99. #Find the largest palindrome made from the product of two 3-digit numbers.

#1. Create 3-digits numbers array a = numpy.arange(100, 1000) numpy.testing.assert_equal(100, a[0]) numpy.testing.assert_equal(999, a[-1]) #2. Create products array numbers = numpy.outer(a, a) numbers = numpy.ravel(numbers) numbers.sort() numpy.testing.assert_equal(810000, len(numbers)) numpy.testing.assert_equal(10000, numbers[0]) numpy.testing.assert_equal(998001, numbers[-1]) #3. Find largest palindromic number for i in xrange(-1, -1 * len(numbers), -1): s = str(numbers[i]) if s == s[::-1]: print s break

Have a Go
Although I am pretty sure this is the right solution, it might be a good idea to check the result. Find out which two 3-digit numbers produce our palindromic number by modifying the code a bit. Try implementing the last step in a NumPy way. If you liked this post and are interested in NumPy check out NumPy Beginners Guide by yours truly.

You might also like