If each letter represents distinct non-zero digits in the above cryptogram .
Fine the value of .
This is an original problem
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We have 13 distinct numbers and distinct non-zero digits are 9 ie; { 1 , 2 , 3 , ⋯ , 8 , 9 } = 9 . Hence, no solution exist
Let's prove it
Proof:
Suppose on the contrary there exist unique solution for all letters then notice that 1 0 < I + M = I < 1 8 isnot possible unless it has carry 1 from Z + A as I = M then I + M > 1 0 = 1 0 + I ⟹ M = 1 0 which is absurd as 0 < M < 1 0 .If I + M < 1 0 then I + M = I ; I + M + 1 = 1 0 + I ⇒ M = 9 .
Which further follows as B + 1 = S and also we have Z + A = S ⟹ 1 = Z + A − B . It's vivid that Z + A , B are co-prime integers. Moreover, we must say they are consecutive integers. Now recall that I + M has a carry 1 from Z + A implies Z + A > 1 0 ⟹ Z + A − B > 1 which contradicts Z + A − B = 1 which proves that there exist no solution .