Very Very Scary!

Logic Level 2

V E R Y + V E R Y S C A R Y \begin{array}{ccccc} & & & V & E &R&Y\\ + & & & V& E &R& Y \\ \hline & & S & C& A &R &Y\\ \hline \end{array}

Jon and Ron are discussing about the cryptogram above:

Ron: Each letter represents a distinct non-negative integer. Jon, Let's try to solve for S C A R Y ‾ \overline{SCARY}

Jon: Yeah, let's do it!.

Ron: I think it has only one solution. Jon, what do you think?

Jon: There are no solutions.

Who is correct?

Both of them Jon Neither of them Ron

View wiki
Munem Shahriar by Munem Shahriar , 18, Bangladesh

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

Francis Kong
Nov 9, 2017

Given R Y ‾ + R Y ‾ ≡ R Y ‾ m o d 100 \overline{RY} + \overline{RY} \equiv \overline{RY} \mod 100 , the only possibly is R = Y = 0 R=Y=0 which contradicts R ≠ Y R \neq Y and thus there are no solutions that will be consistent with the statement "Each letter represents a distinct non-negative integer."

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...