Current location - Training Enrollment Network - Mathematics courses - Solve the problem of encryption algorithm
Solve the problem of encryption algorithm
Different letters in the title should represent different numbers!

It is easy to know that T=0,

R is one millionth of the sum of the two, satisfying 6.

Since r is also the unit of L+L+ 1, that is, r is an odd number,

So R can only be 7 (L is 8 at this time) or 9 (L is 9 at this time, that is, L and R are the same, so don't give up).

Therefore, R=7 and L=8.

E is a unit of A+A+ 1, and e is also an odd number. E can only be 1, 3 and 9(5 and 7 are d and r respectively).

(A is neither 0 nor 5, so E is not1; A and e cannot be 9 at the same time)

So E=3 (at this time A= 1, or 6) or 9 (at this time A=4).

Because o is the single digit of O+E+0 (or 1, or 2, depending on the last few digits), we can see E >;; =8

So: E=9, A=4.

It can be seen that O+E+0 (or 1, or 2) can only be the combination of O+9+ 1 (that is, enter a bit later).

Because o+9+ 1 >: 10, it also entered one place.

So G= 1

Only the last three n, r and o are undecided. They come from the remaining three numbers: 2, 3 and 6.

B is N+R, that is, the single digit of N+7, which can only be N=6 and B=3.

The last one left, O=2.

That is, 526485+ 197485=723970.