# Euler Problem 4: Largest Palindromic Product

December 22, 2016
By

[This article was first published on The Devil is in the Data, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

## Euler Problem 4 Definition

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers.

## Solution

This code searches fo palindromic numbers, starting at the highest values. The palindromes are tested by converting the number to a character string. When the first palindromic number is found, the loop is broken.

```# Cycles through all number combinations, starting at 999
for (i in 999:900) {
for (j in 990:900) {
word <- as.character(i * j)
# Create reverse
reverse <- paste(rev(unlist(strsplit(word, ""))), collapse = "")
# Check whether palindrome
palindrome <- word == reverse
if (palindrome)
break
}
if (palindrome) {
break
}
}
```

Searching a bit further results in twelve palindromic numbers. Sequence A002113 in the OEIS lists palindromes in base 10. Mathematicians used these numbers only for fun, without any purpose in reality. The graph below shows the number of palindromic numbers between 0 and 1 million.

Palindromic number count

The post Euler Problem 4: Largest Palindromic Product appeared first on The Devil is in the Data.

R-bloggers.com offers daily e-mail updates about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.
Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.