In the following equation, each letter represents a distinct digit in base ten:
× T Y M T E E T
Determine the sum E + M + T + Y .
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.
I disagree with "One of them has to be 37" Why can't one of them be 74?
@Calvin Lin - oops i missed the case of E=8 ,i'll fix it now
Log in to reply
Can you clean up the presentation of the solution? Right now, you know what you want to show, and you're thinking it, but you're not showing it to the reader.
IE It would be clearer to say "One of YE, ME has to be 37 or 74. Case 1: equal 37 ... Case 2: equal 74 ..." Otherwise, you just have a bunch of mathematical equations, without explaining why they are written down.
Problem Loading...
Note Loading...
Set Loading...
( Y E ) ⋅ ( M E ) ( Y E ) ⋅ ( M E ) = T T T = T ⋅ 1 1 1 = T ⋅ 3 7 ⋅ 3 ( 1 )
One of ( Y E ) , ( M E ) has to be 3 7 or 7 4
Case 1: Let, Y E = 7 4
This is only possible if T = 8 The last digit of ( Y E ) ⋅ ( M E ) is given by, ( 1 0 Y + E ) ( 1 0 M + E ) ( m o d 1 0 ) ⟹ E 2 ( m o d 1 0 ) However, E 2 ( m o d 1 0 ) Thus, T Thus YE cannot be equal to 74 Else, M E < 1 0 ≡ T T T ( m o d 1 0 ) ≡ T ≡ 1 , 4 , 5 , 6 , 9 , 0 = 8 Perfect squares always end in (1,4,5,6,9,0)
Case 2: Let, Y E = 3 7 ⟹ E ⟹ ( M E ) 3 T ( m o d 1 0 ) ⟹ T ( M E ) Thus we have, = 7 = 3 T From (1) = 7 = 9 = 3 T = 2 7 Y = 3 , M = 2 , E = 7 , T = 9 E + M + T + Y = 2 1