With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

No credit card required

Finding palindromic numbers

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99. Let's try to find the largest palindrome made from the product of two 3-digit numbers.

How to do it...

The following is the complete program from the palindromic.py file in this book's code bundle:

import numpy as np #A palindromic number reads the same both ways. #The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99. #Find the largest palindrome made from the product of two 3-digit numbers. #1. Create 3-digits numbers array a = np.arange(100, 1000) np.testing.assert_equal(100, a) np.testing.assert_equal(999, a[-1]) #2. Create products array numbers = ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

No credit card required