+ B B L L A A B S S S E E A S
Acids and bases are two enemies who have their own companies. Acids are very cunning. They have put their one trustworthy unit in the company of Bases to hack some important data. But Bases have set up a security code before giving access to their data. You have to help the acid unit to decode it.The code is in the form of alphanumeric puzzle listed above, where each letter represents a distinct digit. Find B + A + S + E + 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.
@Chew-Seong Cheong Thanks! This is helpful. I've converted it into a solution. If you subscribe to the comments, you will be notified of updates.
You should explain what the A 4 1 notation is. This is my first time seeing it.
I don't get why A should be less than 5 (first rule). I get that L is less than 5, but why should A?
Log in to reply
You are right. It was a mistake. I am trying to get another solution. Thanks for the comment.
Done, a simpler solution.
There's no change in the ten thousands, so L < 5. Let's look at hundreds and ones, one of the summands is different although they have the same sum. This must be caused by the carry forward from the tens, so B = E - 1. Since we've established the existence of the carry forward from tens, then S ≥ 5 and E < S, always. By the same reason, A < S and A + E = S < 10, so there won't be any other carry forwards sent over from ones and hundreds (thousands doesn't have one either, but that's because L < 5). E & A is an even number while B is odd. Since E & A as summands are both even, then S as their sum must also be even.
There are two ways for E + A = S to happen, one is 2 + 4 = 6 and the other 6 + 2 = 8, but the first solution will have L = 2 = E, which shouldn't be for they represent distinct digits each.
Finally, we have E = 6, A = 2, L = 1, S = 8 and B = 5.
Answer = B + A + S + E + S
= 5 + 2 + 8 + 6 + 8
= 29
I use a different approach. From the column (1), we know, that if we call S = E+A, that 2(E+A) mod 10 = E. The integer solution of this equation give four some possible subset {A, E} = {4,2}, {2,6}, {3,4}, {8,1}. In particular the first subset cannot be accepted because from the column (4) we know that 2L = A, so L=2. The last information that help us to chose the correct subset came from the column (3). In fact from the column we know that E+A = A+B, but it is only possible in two case: when B = E, but is impossible for hypothesis, and when B = E-1, that is possible only if S must be ≥ 5 with carry-over of 1. This information automatically exclude the subset {3,4} because yet A is set to 3. So remain {2, 6} and {8, 1} but if we want respect the (2) column we must impose that A < E, that automatically exclude {8, 1}. So the correct association is {A, E} = {2, 6}, that means {L, B, S} = {1, 5, 8}
Problem Loading...
Note Loading...
Set Loading...
Let the right-most column be column 0 .
From column 0, we note that: ( 0 ) : E + A = { S S + 1 0 . Let's denote it as E + A = S + 1 0 0 . And column 1: ( 1 ) : 2 S + 1 0 = E + 1 0 0 . Therefore, ( 0 ) + ( 1 ) : { E + A + 2 S = S + E + 1 0 0 E + A + 2 S + 1 = S + 1 0 + E + 1 0 0 ⇒ A + S = 1 0 0 > 0 ⇒ A + S = 1 9 − 1 ⇒ A + S = 1 0 ⇒ No solution ⇒ ( 0 ) : E + A = S ⇒ A + S = 1 0
From ( 0 ) : E + A = S ⇒ E = S − A = 1 0 − 2 A ⇒ S > E , S > A , A = 1 , 2 , 3 , 4 (denoted by: A 4 1 : A = 1 to 4 ) ⇒ E 1 0 − 2 ( 4 ) 1 0 − 2 ( 1 ) = E 2 8 ⇒ S 1 0 − 4 1 0 − 1 = S 6 9
From ( 2 ) : A 4 1 + B + 1 0 = S 6 9 + 1 0 0 ⇒ B + 1 0 = 2 8 + 1 0 0 ⇒ B + A + 1 0 = S Since ( 0 ) : E + A = S ⇒ B + 1 = E ⇒ B 1 7
Since ( 2 ) : B + A + 1 = S ⇒ ( 3 ) : 2 L + 0 = A 4 1 ⇒ L 2 1 ⇒ A = 2 , 4 but if L = 2 , then E = 1 0 − 2 A = 2 = L which is u n a c c e p t a b l e . Therefore, L = 1 , A = 2 , E = 6 , S = 8 , B = 5
⇒ B + A + S + E + S = 5 + 2 + 8 + 6 + 8 = 2 9