We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
It would also help the problem description to explain the reason why 9216 is the solution for N=4. If I understand it correctly, it is because there are three anagrams of 1296 that are squares: 1296, 2916, and 9216. There are no other "square anagram word sets" (a term that probably should be defined in the problem description) for numbers of length 4 that have as many elements as this set. 9216 is the largest element of this set, so it is the solution.
Where there are multiple "square anagram word sets" that have the same maximal size for a different value of N. I presume you would take the largest square in the union of these sets.
Project Euler #98: Anagramic squares
You are viewing a single comment's thread. Return to all comments →
It would also help the problem description to explain the reason why 9216 is the solution for N=4. If I understand it correctly, it is because there are three anagrams of 1296 that are squares: 1296, 2916, and 9216. There are no other "square anagram word sets" (a term that probably should be defined in the problem description) for numbers of length 4 that have as many elements as this set. 9216 is the largest element of this set, so it is the solution.
Where there are multiple "square anagram word sets" that have the same maximal size for a different value of N. I presume you would take the largest square in the union of these sets.