Alek Elbekian is a Lebanese Armenian and a graduate student in theoretical physics at Utrecht University, specializing in quantum field theory and condensed matter. He also works at the Yerevan Physics Institute researching cosmic rays and naturally occurring radiation.
I think it’s simpler to see if the words have the same letters. You don’t need math for this! You just made it more complicated.
That’s funny. But you have to love a system that serves as an independent check on your simple method. You can imagine how this might be preferable if all words had a prime-product as a second identifier. Then the list of all words could be arranged by their prime product rather than a list of letters. Anagrams could be identified by a simple sort of increasing value. Still, I appreciate your take on it.
It takes asymptotically longer to check if the words have the same letters than it does to multiply their prime numbers and check the products.
Bravo Alek … I am 76 yrs old and your article generated great interest and woke up my sleeping mind ! Much appreciated for Armenian Weekly publishing articles by young writers and their views , like another great article in this issue by Arianna Mesrobian . It strengthens my belief in our younger Generation for OUR Future !
Azad .
I would love to hear more about how such a prime-product identifier could be used in more complex textural analysis.
To reduce computation the letters could be assigned values based on their typical frequency in text instead of their position in the alphabet. So «ա» would still be 2 (because it’s the most frequent letter) but 3 would be «ն», 5 would be «ր» etc.
I think it’s simpler to see if the words have the same letters. You don’t need math for this! You just made it more complicated.
That’s funny. But you have to love a system that serves as an independent check on your simple method. You can imagine how this might be preferable if all words had a prime-product as a second identifier. Then the list of all words could be arranged by their prime product rather than a list of letters. Anagrams could be identified by a simple sort of increasing value. Still, I appreciate your take on it.
It takes asymptotically longer to check if the words have the same letters than it does to multiply their prime numbers and check the products.
Bravo Alek … I am 76 yrs old and your article generated great interest and woke up my sleeping mind ! Much appreciated for Armenian Weekly publishing articles by young writers and their views , like another great article in this issue by Arianna Mesrobian . It strengthens my belief in our younger Generation for OUR Future !
Azad .
I would love to hear more about how such a prime-product identifier could be used in more complex textural analysis.
To reduce computation the letters could be assigned values based on their typical frequency in text instead of their position in the alphabet. So «ա» would still be 2 (because it’s the most frequent letter) but 3 would be «ն», 5 would be «ր» etc.