Why u dun liek mudkipz?

Logic Level 4

T R E E C K O + T O R C H i C S T a R T E R S \large\begin{array}{c}&&T&R&E&E&C&K&O \\ +\ \ &T&O&R&C&H&i&C \\ \hline \ \ S&T&a&R&T&E&R&S \end{array}

Given:

1 ) K = 5 1) K=5

2 ) 2) Lower-case alphabets are wildcards, they can represent a number which is already represented by a upper-case alphabet.

Find T R E E C K O T O R C H i C \overline{TREECKO}-\overline{TORCHiC}


This problem is part of the question set Mathematics in Anime

For another more challenging cryptogram problem I create, click here


The answer is 322635.

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.

1 solution

Zk Lin
Jan 8, 2016

T R E E C K O + T O R C H i C S T a R T E R S \large\begin{array}{c}&&T&R&E&E&C&K&O \\ +\ \ &T&O&R&C&H&i&C \\ \hline \ \ S&T&a&R&T&E&R&S \end{array}

Terminology : I read the cryptogram from left to right, so I will refer to the leftmost column as the first column, and so on...

From the second column, note that without carry over from the third column, we will have 2 T T ( m o d 10 ) 2T \equiv T \pmod{10} , possible only if T = 0 T=0 , but we know T 0 T\neq0 since it is the leading number of both T O R C H i C TORCHiC and T R E E C K O TREECKO . Therefore, with carry over, 2 T + 1 T ( m o d 10 ) 2T+1 \equiv T \pmod{10} , or T 9 ( m o d 10 ) T \equiv 9 \pmod{10} , which means T = 9 T=9 . This also implies that S = 1 S=1 .

We shift our attention to the fourth column. Note that E + R E+R gives R R . We can immediately conclude that E = 0 E=0 and there is no carry over from the fourth column. Why? Suppose that there is a carry over. Then, E + R + 1 R ( m o d 10 ) E+R+1 \equiv R \pmod{10} or E = 9 E=9 . This creates a contradiction, since already T = 9 T=9 .

Our partially solved cryptogram now looks like this:

9 R 0 0 C 5 O + 9 O R C H i C 1 9 a R 9 0 R 1 \large\begin{array}{c}&&9&R&0&0&C&5&O \\ +\ \ &9&O&R&C&H&i&C \\ \hline \ \ 1&9&a&R&9&0&R&1 \end{array}

We shift our attention to the fifth column, where 0 + C 0+C gives 9 9 . Since 9 9 is already exhausted, we can only let C C be 8 8 and conclude that there must be a carry over from the sixth column.

From the last column, clearly, O = 3 O=3 . What remains are the integers 2 , 4 , 6 , 7 2,4,6,7 . If we take a look at the third column, we can conclude that R = 7 R=7 in order for a carry over to the second column to be possible. An immediate consequence of this is that a = 0 a=0 .

The rest of the puzzle is now easy to complete. It can be easily seen that H = 2 H=2 and i = 1 i=1 , bearing in mind that there is a carry over from the last column.

A quick computation reveals that T R E E C K O T O R C H i C \overline{TREECKO}-\overline{TORCHiC}

= 9700853 9378218 =9700853-9378218

= 322635 =\boxed{322635}

Moderator note:

In a two row summation, the carry-on is at most 1, which restricts the possibilities that we're looking at.

Towards the end of the proof, when you say "From the first column, clearly, O = 3 O=3 .", you mean the last column.

Calvin Lin Staff - 5 years, 5 months ago

Log in to reply

Noted with thanks. Edited

ZK LIn - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...