+ H A A H H D A H A
If each letter represents a different nonzero digit, what must D be?
This is the hardest cryptogram we've challenged you with so far, but they can get much harder yet!
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.
Nice. One minor correction, add a "+10" to get, H+A+1=H+10, so A=9
Your solution is the best solution... Proud to be Indian..
I do like nice, simple, obvious solutions
How do you know in line 1 that H + D can't = 20 ? Shouldn't you show why it can't?
Log in to reply
The maximum for any digit is 9, thus adding 2 digits can give a maximum total of 18.
sum of 2 digits cannot cross 20
Hmm... Interesting... But I still don’t get your way...
We have H A D + H A + H = 1 0 0 A + H A and 1 0 0 H + 1 0 A + D + H = 1 0 0 A .
Thus D + H is divisible by 1 0 . Hence D + H = 1 0 , since D + H ≤ 1 7 .
Now, we have 1 0 H + A + 1 = 1 0 A . Thus A + 1 is divisible by 1 0 . Hence A = 9 , since A ≤ 9 . Thus H = 8 and D = 2 .
Your solutions and expertise in Diophantine equations always amazes me. It blows my mind that this and your last 100 day solution don't have the most upvotes. In any case, I prefer this rigorous approach. You always do solid work, Kazem :)
Log in to reply
While it's quite elegant, the answers that get the most upvotes are the simple, fast and quick to understand ones.
Log in to reply
That's right Jozsef :) The good thing about these problems is that people come up with different and beautiful approaches.
Thanks a lot Zach :) This is not a level 1 solution and thus gets less attention. I know that there are some of people (like me and you) that enjoy this type of solutions, so I write them and we enjoy together :))
I really like your number theoretical solution. It is easy to follow and elegant.
i had it wrong again:<
Since the units digit of AHA is A, this means that either D and H are both 0 or the letters sum up to 10.
Since 0 is not a choice, we go with D + H = 1 0 The one carries in addition and sets up the equality A + H + 1 = H + 1 0 . It could not be A + H + 1 = H since A = -1, which cannot happen.
The one from getting a 10 carries another one and sets up a third equation H + 1 = A .
From the second equation, we rearrange to get A = 9, which leads to H = 8 using the third equation. Going back to the first equation, we substitute H for 8 and get D + 8 = 10. Therefore, D = 2
D + H = 1 0
A + 1 = 1 0 → A = 9
H + 1 = A = 9 → H = 8
D + 8 = 1 0 → D = 2
I know one can work out equations etc. But this one presents one glaring clue that solves it without that much work.
That clue is: whenever a digit in the column is passed to the sum, the rest must sum to 10 (in a column of only two or three). With that observation alone the puzzle can be solved.
The second column A + H = H forces A = 9 because A with a (forced) carry of 1 must be 10. This also forces a carry of 1 to the third column.
H and A in the third column forces H + 1 = A. Thus H = 8.
Finally D + A + H = A forces D = 2 so that 17 + 2 puts A = 9 in the right hand position of the sum, and does carry the necessary 1 to the second column.
So D must be 2.
a t f i r s t .
H + D + A = 1 0 + A
o r , H + D = 1 0 .......... [ s u b t r a c t i n g A f r o m b o t h s i d e s ]
n o w , H + A + 1 = H , s o , A = 9
a n d , H + 1 = A , s o , H = 8 ..................... [ H + D = 1 0 ]
s o , D = 2
Add the three terms together, we have 1 1 1 H + 1 1 A + D = 1 0 1 A + 1 0 H , 1 0 1 H + D = 9 0 A . Since the right-hand side is a multiply of 10, so is the left-hand side. Thus H + D = 1 0 . Substitute this: 1 0 0 H + 1 0 = 9 0 A . 1 0 H + 1 = 9 A = 1 0 A − A . One more than a multiple of ten equals A less than a multiple of 10. This implies A = 9 . From there, we easily find H = 8 , D = 2 .
Your solutions are always so overlooked, Arjen! In any case, you never fail to do solid work. You definitely deserve more praise :)
Log in to reply
Thank you kindly. I don't feel overlooked, Zach. I am just trying to help, often by posting an alternative when others have already posted excellent solutions.
111H + 11A +D = 101A + 10H D = 90A-101H The only values for A and H where 0<D<10 are A=9 and H=8 Therefore D must equal 810-808 = 2 when you put this in the equation it indeed is true
Here's what went through my head sorry if it is hard to follow. I started with the second column and told myself A has to be either 0 or 10 more than H and if A was 0 more than H then A and H would be the same number and in the directIons it says they have to be different. So that means A must be 10 but if it was 10 that would make it so the first row of numbers would be four digits and H would be one and A would be 0 which is a contradictory. So there must be a carryover from the last column. And D+H+A at most could be 7+8+9=24 as they cannot be the same. So the second row could be eight since the carryover is 2 so we get 2+8+H=1H for a carryover of 1. Which would make H+1=A if A is one more than H and the only way we can make that work if we use the logic of columns 1 and 2 so that H=7 and A=8. And 7+8 = 15 so we are going to have to do D+15=24, or 24-15=D, which is 9. But that doesn't work because D and H must equal 10 to make the answer added to A be 1A, and the carryover is 1 instead of 2 so the A and H of column 2, and thus all of them, must be upped by 1, so instead of A=8 and B=7, it will be A=9 and B=8. That doesn't change the correctness of column 3 or 2. 8+9=17 so we must add the last digit, D, as 2 to make this right. Sorry this is a little all over.
I do not want to submit a solution, because although I did get it right I did it in exactly the same way that Akshay Gupta did it in his previous solution. So wouldn't it be a good idea if you could 'like' the solution in the way you do on Facebook. Maybe there's already a way, and maybe some-one will be kind enough to tell me this. Regards, David
Because no one approached it this (quick) way: apply modular arithmetic modulo 11, noting that 1 0 i m o d 1 1 = ( − 1 ) i . We find ( − H + A − D ) + ( H − A ) + ( − H ) = − A + H − H ( m o d 1 1 ) which simplifies to − H − D = − 2 A + H ( m o d 1 1 ) From the leftmost column and that all digits are distinct we know A = H + 1 . Plugging this in the equation above yields D = 2 ( m o d 1 1 ) ; since, D is a decimal digit, we have $ D = 2 $ .
Since D+A+H has a sum with A as it's one's digit, D+H must equal 10 or D=10-H
A + H must have carried a 1 over to the hundred's column because H in the hundreds column doesn't equal A without a carry. 1 must have been carried due to the fact that a carry more than one isn't possible. Suppose the digits D,A,H or 9,8,and 7 (any order). That means that there would be a 2 carried over to the tens column. If A and H are 9 and 8 (any order), then 9 + 8 + 2 would equal 19. Therefore, it is only possible for the carry from the tens column to the hundreds column must be 1. Therefore A=H+1 or H=A-1.
Now, guess and check.
If A=9 then, H=A-1=8 D=10-H=10-8=2
Check if it works.
892+89+8=898
IT WORKS!!!
Therefore D=2.
1 . H+A+D=10+A, so H+D=10 2 . HAD+HA+H=AHA equals 100H+10A+D+10H+A+H=100A+10H+A equals HAD+H=A00
so... 1 .1+A=10 so A equals 9 2 .H+1=9 so H equals 9 3 .H+D=10 or 9+D=10 so D equals 2
*therefore D = 2 *
H + D = 1 0 A + 1 = 1 0 H + 1 = A A + D = 1 1 9 + D = 1 1 D = 2
LaTeX: Let’s make the operation as if they were digits :
LaTeX: H A D + H A + H = A H A ⟺ 1 0 0 H + 1 0 A + D + 1 0 H + A + H = 1 0 0 A + 1 0 H + A
LaTeX: H A D + H A + H = A H A ⟺ − 1 0 1 H + 9 0 A = D
LaTeX: we get a linear diophantine equation where A and H are unknown, and D varies from 1 to 5
LaTeX: D = 1 − 1 0 1 H + 9 0 A = 1
LaTex: Let’s apply the euclidean algorithm :
LaTex: L 1 : 1 0 1 = 9 0 × 1 + 1 1
LaTex: L 2 : 9 0 = 1 1 × 8 + 2
LaTex: L 3 : 1 1 = 2 × 5 + 1 The g c d ( 1 0 1 , 9 0 ) = 1
LaTex: L 4 : 2 = 1 × 2 + 0
LaTex: 101 and 90 are prime between them ⟺ ∃ ( H ; A ) ∈ Z 2 ∣ x H + y A = 1
LaTex: Let’s modify the euclidean algorithm with the last remainder different from 0 :
LaTex: L 3 : 1 1 − 2 × 5 = 1
LaTex: L 3 : 1 1 − ( 9 0 − 1 1 × 8 ) × 5 = 1 ⇐ [ L 2 : 9 0 − 1 1 × 8 = 2 ]
LaTex: L 3 : 1 1 − 9 0 × 5 + 4 0 × 1 1 = 1
LaTex: L 3 : − 5 × 9 0 + 4 1 × 1 1 = 1
LaTex: L 3 : − 5 × 9 0 + 4 1 × ( 1 0 1 − 9 0 × 1 ) = 1 ⇐ [ L 1 : 1 0 1 − 9 0 × 1 = 1 1 ]
LaTex: L 3 : 4 1 × 1 0 1 − 4 6 × 9 0 = 1
Latex: the value D=1 doesn’t suit for H ∈ / { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } and A ∈ / { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }
LaTeX: D = 2 − 1 0 1 H + 9 0 A = 2
LaTeX: In our euclidean algorithm, we have a remainder equals to 2 in L 2 : 9 0 = 1 1 × 8 + 2
LaTex: L 2 : 9 0 − 1 1 × 8 = 2
LaTex: L 2 : 9 0 − ( 1 0 1 − 9 0 × 1 ) × 8 = 2 ⇐ [ L 1 : 1 0 1 − 9 0 × 1 = 1 1 ]
LaTex: L 2 : − 8 × 1 0 1 + 9 × 9 0 = 2
LaTex: D = 2 is the right number : H = − 8 a n d A = + 9
LaTex: H ∈ { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } and A ∈ { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }
LaTeX: D = 3 − 1 0 1 H + 9 0 A = 3
LaTeX: There is no remainder equals to 3, then we have to use the equation for D = 1, to multiply it by 3:
LaTex: L 3 : 4 1 × 3 × 1 0 1 − 4 6 × 3 × 9 0 = 1 × 3
LaTex: L 3 : 1 2 3 × 1 0 1 − 1 3 8 × 9 0 = 3
LaTex: H ∈ / { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } and A ∈ / { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }
LaTex: We see that for D >2, the values H and A are not part of { ± 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 }
LaTex: If D = 2 k and ( k ∈ Z ∖ { − 1 , 0 , + 1 } ) ⇒ L 3 : − 8 × k × 1 0 1 + 9 × k × 9 0 = 2 k
LaTex: If D = n , n > 2 and n = 2 k ( n ; k ) ∈ Z ∗ 2 ⇒ L 3 : 4 1 × n × 1 0 1 − 4 6 × n × 9 0 = n
LaTex: Thus, the only solution is : D = 2 , H = 8 , B = 9
D+H=10, given the first column
H+A+1=10+H, given the first and second columns
A+1=10 and A=9, solving for the above equation
H+1=A, given the last column
A=9, so H=8
D+H=10=D+8, substituting for the first equation
D=2
:)
D + H = 10 since the digit of 'A' stays
A + H + 1 = H + 10 since one carries over and the digit of 'H' stays
H + 1 = A the last sum since one is the most that can carry over given the conditions
sub (H+1) for A in equation 2, we get 2H + 2 = H + 10 Therefore H = 8, and D = 2 by equation 1
D+A+H=10+A
A+H+1=H so A+1=10 therefore A=9
H+1=A so A(9)-1=H=8
D+A+H=10+A goes to D+8=10 D=10-8=2
D + H = 10 1 + A = 10 A = 9 1 + H = A H = 8 D = 2
100H+10A+D+H = 100A.
=> 90A = 101H + D = 90H+(11H+D).
=> A = H + (11H + D)/90.
=> 11H + D = 90.
=> 11H = 88 + (2 - D).
=> H = 8 + (2 - D)/11.
=> D = 2
By knowing that H = A − 1 and subtract away 111H of the question we get
A D + A = 1 0 1 which stands for A = 9 and so D = 2 and H = 8
In the units column, we have D+A+H=A, meaning that D+H must be equal to either 0 or 10(since 20 is too big for the biggest single-digit numbers to sum to it - 9+9=18<20). Since for D+H to equal to 0, both D and H must be 0, but this is not an option, meaning D+H=10. In the tens column, we have A+H=H, and we carried one over from D+H in the units column, so A has to be 9, carrying 1 over to the hundreds column. In the hundreds column, we have H+1(because we carried 1 over)=A, so H=A-1=8. From our first equation(D+H=10), we get D=10-H=10-8=2.
Thus D=2.
d= 90 a -101 h
2= 810 - 808
The key starting point for this equation was the middle column, A + H = H . At this stage, it is most likely that A and H have a difference of 1 as A + H + 1 0 could equal H. If you read the last column, H = A , A must be larger than H as A. List out all the possibilities of A + H that equals H and replace the letters in the left and middle column with the possibilities. Now work it out, starting from the middle and just pretend you have a 10 when solving the middle column (tens column) as you'll see why later.
If it makes sense, move onto the very right column and replace A and H. By now, you should have A = 9 and H = 8 . Now all you need to do is replace the numbers from 1 - 5 into D and you will soon get an answer which is D = 2.
Problem Loading...
Note Loading...
Set Loading...
H + D + A = 10 + A, so H + D = 10
H + A + 1 = H + 10, so A = 9 [1 in LHS carry from summing ones digits]
H + 1 = A, so H = 8 [1 in LHS carry from summing ones digits]
By 1st, D = 2