problem4 calculates the largest palindrome from the product of two
n-digit numbers, being 'n' the giving number of digits
problem4(digits)
| digits | Number of max digits to run comparison |
|---|
The result number
This function has the following complexity O(n)
https://projecteuler.net/problem=4 for more info about it
problem4(1)#> [1] 9problem4(2)#> [1] 9009problem4(3)#> [1] 906609