+ S M C A Q Q I R U U E Y E E N A E O E O C M N F N F E M In the above cryptogram, letters represent non-negative, but not necessarily distinct , digits. Leading digits are non-zero.
If R Y = 4 0 , C I = 3 7 , and S F = 1 7 , then find the value of Q + U + E + N + O + F + S + C + I + M + A + R + Y .
This is for the 4 0 years of brilliance of a beautiful mind, who was the first woman to win the Fields medal prize when she was 3 7 and the first Iranian student to achieve a perfect score and to win two gold medals in the IMO when she was 1 7 .
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.
Same method here!
at first i took the values-----RY=40; CI=37; SF=17
then i did permutation with other numbers one by one.
the values could be:
Q=3 ; U=2; E=5; N=1 ; O=8 ; F=7 ; S=1[as SF=17, FS should be=71]; C=3 ; I=7; M=1; A=4; R=4; Y=0[given that RY=40]
so, now the summation is= 3 + 2 + 5 + 1 + 8 + 7 + 1 + 3 + 7 + 1 + 4 + 4 + 0
= 4 6
Problem Loading...
Note Loading...
Set Loading...
+ 1 M n 5 3 A n 4 Q Q 7 4 n 3 U U E 0 n 2 E E N A n 1 E O E O 3 M N 7 N 7 E M
There is no carry over in the millions place. Thus M = 1 and in the ones and tens places we must get an odd sum. Thus n 1 = 2 , 4 .
If n 1 = 4 , then 2 N + 1 4 + E = 4 1 and 2 N + E = 2 7 . It follows that N = E = 9 . Tens place gives a sum as 2 5 + 2 O , which can be 3 1 or 4 1 . So n 2 = 3 or 4 . Then hundreds place's sum will be n 2 + 2 E + N = n 2 + 2 7 = 3 0 or 3 1 . Hence A = 0 or 1 . But this is a contradiction since A > 3 .
So we must have n 1 = 2 . Thus 2 N + E = 7 . Remember that E must be odd.
In the thousands place, n 3 must be an odd number to give an even sum and since n 2 + 2 E + N < 3 0 , then n 3 = 1 .
Now, lets go to to the ten thousands place, where n 4 must be an odd number. Notice that the sum of thousands place is n 3 + 2 U + E < 3 0 . Therefore, n 4 = 1 , and for the ten thousands place, we get 2 Q + 8 = 1 4 or 2 4 .
If 2 Q + 8 = 1 4 , then Q = 3 and A = 4 . Hence sum of hundreds place is n 2 + 2 E + N = 1 4 and n 2 + 2 ( 7 − 2 N ) + N = 1 4 . It follows that n 2 = 3 N . Thus, we must have n 2 = 3 and N = 1 . Then E = 5 . From tens place 1 5 + 2 O = 3 1 , which gives O = 8 . Finally from thousands place, we get 2 U + E = 9 and U = 2 .
If 2 Q + 8 = 2 4 , then Q = 8 and A = 5 . Hence sum of hundreds place is n 2 + 2 E + N = 1 5 and n 2 + 2 ( 7 − 2 N ) + N = 1 5 . It follows that n 2 = 3 N + 1 . Thus, we must have n 2 = 4 and N = 1 . Then E = 5 . So from tens place, we get 1 5 + 2 O = 4 1 , and O = 1 3 , which is impossible.
Thus, the answer is Q + U + E + N + O + F + S + C + I + M + A + R + Y = 3 + 2 + 5 + 1 + 8 + 7 + 1 + 3 + 7 + 1 + 4 + 4 + 0 = 4 6 .
If you remove each one of the constraints, problem becomes extremely difficult! I think more beautiful variations of this cryptogram can be made, with changing constraints!