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.
Ok so for what I read the deal goes like this: given an integer N your goal is to find an integer of N digits where neither one of them is either zero or repeated, check if this digit is a perfect square and then rearrange these digits until you find the largest perfect square with those same digits.
As for the words "CARE & RACE" in the description it seems they only wanted to use them as an example of what an anagram is.
This is my humble conclusion of the problem, I could be wrong in something.
Project Euler #98: Anagramic squares
You are viewing a single comment's thread. Return to all comments →
Ok so for what I read the deal goes like this: given an integer N your goal is to find an integer of N digits where neither one of them is either zero or repeated, check if this digit is a perfect square and then rearrange these digits until you find the largest perfect square with those same digits. As for the words "CARE & RACE" in the description it seems they only wanted to use them as an example of what an anagram is. This is my humble conclusion of the problem, I could be wrong in something.