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.
"By replacing each of the letters in the word CARE with 1,2,9, and 6 respectively, we form a square number: 1296=36^2. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216=96^2. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.
What is the largest square number formed by the largest set of anagrams of the given length?"
instead try:
"some square numbers are numerical anagrams of other square numbers. For instance, 1296=36^2 and 9216=96^2. The set of square anagrams of 1296 is [1296, 9216]. For each value of N, we wish to know the largest set of square anagrams for a number with N digits. . Print out the largest number of this set. If the largest set is not unique, pick whichever one has the largest maximum element."
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #98: Anagramic squares
You are viewing a single comment's thread. Return to all comments →
yeah sure, Here it is.
"By replacing each of the letters in the word CARE with 1,2,9, and 6 respectively, we form a square number: 1296=36^2. What is remarkable is that, by using the same digital substitutions, the anagram, RACE, also forms a square number: 9216=96^2. We shall call CARE (and RACE) a square anagram word pair and specify further that leading zeroes are not permitted, neither may a different letter have the same digital value as another letter.
What is the largest square number formed by the largest set of anagrams of the given length?"
instead try:
"some square numbers are numerical anagrams of other square numbers. For instance, 1296=36^2 and 9216=96^2. The set of square anagrams of 1296 is [1296, 9216]. For each value of N, we wish to know the largest set of square anagrams for a number with N digits. . Print out the largest number of this set. If the largest set is not unique, pick whichever one has the largest maximum element."