Share this: Google+
CryptArithmetic Problem: ATTRACTIONS + INTENTIONS = REGENERATION
This puzzle is an interesting CryptArithmetic Problem:
How to solve the above challenge?
We put the letter as equality constraints
Expression1 = 10^10*A + 10^9*T + 10^8*T + 10^7*R + 10^6*A + 10^5*C + 10^4*T + 10^3*I + 10^2*O + 10*N + S
Expression2 = 10^9*I + 10^8*N + 10^7*T + 10^6*E + 10^5*N + 10^4*T + 10^3*I + 10^2*O + 10*N + S
Expression3 = 10^11*R + 10^10*E + 10^9*G + 10^8*E + 10^7*N + 10^6*E + 10^5*R + 10^4*A + 10^3*T + 10^2*I + 10*O + N
If (Expression3 ==Expression1 + Expression2) then
Report the value of {A, T, R, C, I, O, N, S, E, G}
We do permutation of digit 0 to 9 and then compute the above expression.
Solution
The solution is unique:
{ A=9, T=4, R=1, C=5, I=7, O=3, N=6, S=8, E=0, G=2}
ATTRACTIONS 94419547368
INTENTIONS 7640647368
---------------------- + ------------------------- +
REGENERATION 102060194736