Skip to content

Conversation

@jfindlay
Copy link

No description provided.

jfindlay added 6 commits June 22, 2013 10:16
The ordering I assumed only checked numbers on the diagonal and
superdiagonal matrix elements.  I need to check all the matrix elements:
(n - i)*(n - j) = n**2 - (i + j)*n + i*j.  However, my new, far simpler
idea is to assume that the largest palindrome in the set (or square
matrix with elements (n - i)*(n - j) for integers 0 <= i,j <= n) is much
closer to n**2 than to 0: n**2 > largest_base_ten_palindrome >> 0.
The assumption used is helpful to find the larges palindrome without
permuting the whole parameter space, however the palindrome itself can
be found in multiple binary combinations of the prime factors of the
palindrome.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant