Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

rename statics/euler and sync b93 code with main repo

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-20 17:38:54 +01:00
parent 0efeb3afeb
commit 69e3f51730
409 changed files with 745 additions and 509 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
www/statics/euler/Euler_Problem-098_description.md Normal file
View File

@@ -0,0 +1,16 @@
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.
Using [words.txt](https://projecteuler.net/project/resources/p098_words.txt),
a 16K text file containing nearly two-thousand common English words,
find all the square anagram word pairs
(a palindromic word is NOT considered to be an anagram of itself).
What is the largest square number formed by any member of such a pair?
NOTE: All anagrams formed must be contained in the given text file.