+ M W P A E H S I Y S G S
In the cryptogram above, each letter represents a distinct single digit non-negative integer. What is the largest possible value of P H Y S ?
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.
Problem Loading...
Note Loading...
Set Loading...
Looking at the units column, clearly G = 0 and there is no carry to the tens column. Now ignore the units column, and remember that none of the digits may be 0 (since it's used for G ).
There are 9 letters and 9 digits, so all digits get used. Adding up all the digits gives M + A + S + W + E + I + P + H + Y , which must be equal to 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 = 4 5 . Now consider the addition modulo 9. M A S + W E I + P H Y ≡ 4 5 ( m o d 9 ) , since we can obtain the remainder modulo 9 by adding up the digits. However, M A S + W E I = P H Y , so we have 2 ⋅ P H Y ≡ 4 5 ≡ 0 ( m o d 9 ) and so P H Y ≡ 0 ( m o d 9 ) . In other words, P H Y is divisible by 9. The largest possible number for P H Y is hence 981, and the largest possible S after this is 7, giving max P H Y S = 9 8 1 7 . This is achievable, by for example 3 2 7 7 + 6 5 4 0 = 9 8 1 7 .