# Bilingual cryptarithm

This is a cryptarithm puzzle I found in a mathematical contest in 2004. The questions were available on the website of the of the AQJM (in french, Association Québécoise des jeux mathématiques) and we had about two months to give our answer.

$$\text{NINE} \times \text{THREE} = \text{NEUF} \times \text{TROIS}$$ What is the result of the multiplication?

Also, we know that $$\text{TROIS}$$ and $$\text{NINE}$$ are multiple of 3 and that $$\text{NEUF}$$ and $$\text{THREE}$$ are multiple of 9.

The usual rules of the alphametic puzzle apply here.

• The same letter always represent the same number
• Two letters represent different numbers

Since the questions were on the internet, we could use whatever means we want to find the answer. A friend of mine created a small programm to test all possible combinaison. I did it with pencil and paper and it took me about 10 hours of work to find the answer, mostly by trials and errors to exclude possiblities. I wonder if someone has a better way of tackling such problem.

Complete contest available here

Without the no-computers tag, I just did a search and found the unique solution:
It's slightly imperfect that NINE is not a multiple of $$9$$. But one cannot expect more... this already is a quite funny identity.