Solve this alphametic multiplication problem, where each of the small letters denotes a different base 14 digit from 0 to D, and each of the asterisks denotes a base 14 digit from 0 to D whether same or different. None of the numbers can contain any leading zero.
|
|
e |
i |
g |
h |
t |
|
|
|
|
t |
w |
o |
--------------------- |
|
|
* |
* |
* |
* |
* |
|
* |
* |
* |
* |
* |
|
* |
* |
* |
* |
* |
|
|
--------------------- |
s |
i |
x |
t |
e |
e |
n |
(In reply to
computer solution by Charlie)
For the record, the completely filled in algorithm is:
15297
* 786
-------
83210
AD760
984A7
-------
A5C7110
|
Posted by Charlie
on 2010-05-28 18:58:09 |