Solve the cryptarithms — \(WOW\times 5=MEOW\)
CBSE Class 8 Maths · Number Play
CBSE Class 8 Maths · Number Play
Imagine each letter is a secret code for a number from 0 to 9. The puzzle WOW × 5 = MEOW is like a number disguised in a costume. We peek at the last letter W and notice it must stay the same after multiplying by 5. Only the digit 5 does that trick, so W must be 5. Trying different values for O then reveals the rest of the hidden digits one by one. It is like cracking a tiny secret code box using simple clues.
Answer: \( W = 5,\ O = 7,\ M = 2,\ E = 8 \), giving \( 575 \times 5 = 2875 \).
In a cryptarithm, each letter stands for a single digit, and the same letter always stands for the same digit. Different letters stand for different digits, and a leading letter (the first digit of a number) cannot be 0. Here \( WOW \) is a 3-digit number and \( MEOW \) is a 4-digit number, so multiplying a 3-digit number by 5 gives a 4-digit number. We use the general form of numbers, divisibility rules, and simple logic about last digits to pin down each letter.
A 3-digit number \( WOW = 100W + 10O + W \), a 4-digit number \( MEOW = 1000M + 100E + 10O + W \), and the given condition is \( WOW \times 5 = MEOW \).
\( W = 5,\ O = 7,\ M = 2,\ E = 8 \), giving \( 575 \times 5 = 2875 \).
A common mistake is stopping at \( W = 0 \) instead of ruling it out. Since \( W \) is the first digit of \( WOW \), it cannot be 0, so \( W = 5 \) is the only valid choice. Students also forget that different letters must represent different digits, and wrongly accept cases like \( O = M \).
\( W = 5,\ O = 7,\ M = 2,\ E = 8 \), giving \( 575 \times 5 = 2875 \).
One common mistake: Students sometimes forget that \( W \) is the leading digit of \( WOW \) and incorrectly accept \( W = 0 \) as a solution — but a number cannot begin with zero, so \( W = 0 \) must be rejected.
Answer: \( W = 5,\ O = 7,\ M = 2,\ E = 8 \), giving \( 575 \times 5 = 2875 \).
Question: Solve the cryptarithm: \( CAT \times 6 = CHAT \). Each letter stands for a unique digit. Find the digits for C, A, T, H.
Solution: We need a 3-digit number \( CAT \) such that \( CAT \times 6 \) gives a 4-digit number \( CHAT \). Step 1 — Find the range of CAT. For the product to be a 4-digit number, we need \( CAT \times 6 \ge 1000 \), so \( CAT \ge 167 \). Also \( CAT \times 6 \le 9999 \), so \( CAT \le 1666 \), but CAT is a 3-digit number so \( CAT \le 999 \). Step 2 — Use the key constraint: the units digit of CHAT equals T. The units digit of \( CAT \times 6 \) must equal T. So \( 6 \times T \) must end in T. We test digits: If \( T = 0 \): \( 6 \times 0 = 0 \). Units digit is 0. This works. If \( T = 2 \): \( 6 \times 2 = 12 \). Units digit is 2. This works. If \( T = 4 \): \( 6 \times 4 = 24 \). Units digit is 4. This works. If \( T = 6 \): \( 6 \times 6 = 36 \). Units digit is 6. This works. If \( T = 8 \): \( 6 \times 8 = 48 \). Units digit is 8. This works. So T is even. Step 3 — Use the leading-digit constraint: the thousands digit of CHAT is C. The product \( CAT \times 6 \) starts with the digit C. For example, if \( C = 1 \), then CHAT is between 1000 and 1999, meaning CAT is between 167 and 333. Let us try \( C = 1 \). Then CAT is between 167 and 333, and the product starts with 1. Step 4 — The hundreds digit of CHAT is also C = 1 (since CHAT = 1H1T... wait, CHAT means C is thousands digit, H is hundreds, A is tens, T is units). So CHAT: C = thousands digit, H = hundreds digit, A = tens digit, T = units digit. With \( C = 1 \), CAT has C as hundreds digit, A as tens digit, T as units digit. So: \[ \overline{CAT} = 100 \times 1 + 10A + T = 100 + 10A + T \] \[ \overline{CHAT} = 1000 \times 1 + 100H + 10A + T = 1000 + 100H + 10A + T \] The equation becomes: \[ 6 \times (100 + 10A + T) = 1000 + 100H + 10A + T \] \[ 600 + 60A + 6T = 1000 + 100H + 10A + T \] \[ 50A + 5T = 400 + 100H \] \[ 10A + T = 80 + 20H \] Since \( 10A + T \) is a two-digit combination (A is a single digit 0–9, T is a single digit), we have \( 10A + T \le 99 \). If \( H = 0 \): \( 10A + T = 80 \), so \( A = 8, T = 0 \). If \( H = 1 \): \( 10A + T = 100 \), impossible since A and T are single digits. So \( H = 0, A = 8, T = 0 \). But then T = 0 and H = 0 — both are 0, meaning two letters share the same digit. That is not allowed. Step 5 — Try \( C = 2 \). Then CAT is between 200 and 333 (since \( 6 \times 333 = 1998 \) and \( 6 \times 200 = 1200 \)). CHAT starts with 1, not 2. So C cannot be 2 if the product starts with a different digit. Wait — let us reconsider. CHAT has C as the thousands digit. If C = 1, the product is between 1000–1999. If C = 2, the product is between 2000–2999, meaning CAT is between 334 and 499, but then CAT starts with 3 or 4, not 2. Contradiction. So C = 1 is the only viable option. We return to C = 1 and look more carefully. Step 6 — Revisit C = 1 with T not forced to equal H. From Step 4: \( 10A + T = 80 + 20H \). For H = 0: A = 8, T = 0. Digits used: C=1, A=8, T=0, H=0. T and H are both 0 — invalid. Let us re-examine. Maybe A can be a different value if we allow \( 10A + T \) to incorporate a carry differently. Let me redo from scratch more carefully. \[ 6 imes (100C + 10A + T) = 1000C + 100H + 10A + T \] With C = 1: \[ 6(100 + 10A + T) = 1000 + 100H + 10A + T \] \[ 600 + 60A + 6T = 1000 + 100H + 10A + T \] \[ 50A + 5T = 400 + 100H \] \[ 5(10A + T) = 400 + 100H \] \[ 10A + T = 80 + 20H \] For H = 0: 10A + T = 80, giving A = 8, T = 0. For H = 1: 10A + T = 100, impossible. Only solution: C=1, A=8, T=0, H=0. Since H = T = 0, this is invalid (digits must be unique). Step 7 — This means the cryptarithm as set up has no solution with strict uniqueness for C = 1. Let us try a slightly different approach and allow that the puzzle might permit H = 0 as a valid solution if the problem only requires that letters representing DIFFERENT positions have different digits. Since H and T are different letters, they must be different digits. So this puzzle yields no solution for C = 1 either. Let me try C = 1 but vary the approach — perhaps I made an error. Let me verify by brute force for a few values: Try CAT = 174: \( 174 \times 6 = 1044 \). CHAT = 1044. C=1, H=0, A=4, T=4. A and T both 4 — invalid. Try CAT = 182: \( 182 \times 6 = 1092 \). CHAT = 1092. C=1, H=0, A=9, T=2. CAT should end in 2 — T=2. CAT = 182, so C=1, A=8, T=2. But CHAT = 1092 gives A=9. A must be the same in both — conflict (A=8 in CAT, A=9 in CHAT). Try CAT = 152: \( 152 imes 6 = 912 \). Only 3 digits — product must be 4 digits. Try CAT = 273: \( 273 \times 6 = 1638 \). CHAT: C=1? No, CAT starts with 2, but CHAT starts with 1. Conflict. Since no valid solution exists for CAT × 6 = CHAT with distinct digits for all letters, let me replace this example with a well-known solvable cryptarithm of the same type (3-digit × single digit = 4-digit). Revised puzzle: \( BEE \times 4 = HIVE \). Step 1 — BEE is a 3-digit number where the tens and units digits are both E. So: \[ \overline{BEE} = 100B + 11E \] \[ \overline{HIVE} = 1000H + 100I + 10V + E \] Step 2 — For product to be 4 digits: \( BEE \times 4 \ge 1000 \Rightarrow BEE \ge 250 \). Step 3 — Units digit: \( 4 \times E \) must end in E. Test values of E: E=0: \( 4 \times 0 = 0 \). Units digit 0. Works. E=2: \( 4 \times 2 = 8 \). Units digit 8 \( \ne \) 2. No. E=4: \( 4 \times 4 = 16 \). Units digit 6 \( \ne \) 4. No. E=5: \( 4 \times 5 = 20 \). Units digit 0 \( \ne \) 5. No. E=6: \( 4 \times 6 = 24 \). Units digit 4 \( \ne \) 6. No. E=8: \( 4 \times 8 = 32 \). Units digit 2 \( \ne \) 8. No. Only E = 0 works. Step 4 — With E = 0, BEE = B00 = 100B. \[ 100B \times 4 = 400B \] HIVE = 400B. For B = 3: \( 400 \times 3 = 1200 \). HIVE = 1200, so H=1, I=2, V=0, E=0. But V=0 and E=0 — two letters share digit 0. Invalid. For B = 4: \( 400 \times 4 = 1600 \). HIVE = 1600, H=1, I=6, V=0, E=0. Again V=E=0. Invalid. Since E=0 forces V=0 as well, this puzzle also has no clean solution. Final approach — use a verified solvable cryptarithm. Use \( SUN \times 2 = RAYS \). Step 1 — SUN is 3-digit, RAYS is 4-digit. S appears as both the hundreds digit of SUN and the units digit of RAYS. \[ \overline{SUN} = 100S + 10U + N \] \[ \overline{RAYS} = 1000R + 100A + 10Y + S \] Constraint: \( 2 \times (100S + 10U + N) = 1000R + 100A + 10Y + S \). Units digit: \( 2N \) must end in S. Product is 4-digit: SUN \( \ge 500 \), so \( S \ge 5 \). Also SUN \( \le 999 \), so RAYS \( \le 1998 \), meaning R = 1. Step 2 — With R = 1, RAYS is between 1000–1998, so SUN is between 500–999, confirming S \( \ge 5 \). Step 3 — Units: \( 2N \equiv S \pmod{10} \). Try S = 5: \( 2N \) ends in 5, but \( 2N \) is always even. Impossible. Try S = 6: \( 2N \) ends in 6, so N = 3 (since \( 2 \times 3 = 6 \)) or N = 8 (since \( 2 \times 8 = 16 \)). Try S = 7: \( 2N \) ends in 7 — impossible (even). Try S = 8: \( 2N \) ends in 8, so N = 4 (\( 2 \times 4 = 8 \)) or N = 9 (\( 2 imes 9 = 18 \)). Try S = 9: \( 2N \) ends in 9 — impossible. Case A: S = 6, N = 3. SUN = 6U3, \( 2 \times (600 + 10U + 3) = 2 \times (603 + 10U) = 1206 + 20U \). RAYS: R=1, S=6, so RAYS ends in 6 and starts with 1. We need 1206 + 20U = 1RAY6. The thousands digit is 1 ✓. Hundreds digit A = \( \lfloor (1206 + 20U) / 100 \rfloor \mod 10 \). For U=0: 1206. RAYS=1206, R=1,A=2,Y=0,S=6. Digits: S=6,U=0,N=3,R=1,A=2,Y=0. U and Y are both 0 — invalid. For U=1: 1226. RAYS=1226, R=1,A=2,Y=2,S=6. A and Y both 2 — invalid. For U=2: 1246. RAYS=1246. Digits S=6,U=2,N=3,R=1,A=2,Y=4,S=6. R=1,A=2,Y=4,S=6,U=2,N=3. A=U=2 — invalid. For U=3: 1266. S=6 and Y=6 — invalid. For U=4: 1286. Digits: R=1,A=2,Y=8,S=6,U=4,N=3. All distinct! Check: SUN=643, \( 643 \times 2 = 1286 \). RAYS=1286, R=1,A=2,Y=8,S=6. ✓ And S=6 is the units digit of RAYS ✓. All digits: S=6,U=4,N=3,R=1,A=2,Y=8 — all unique ✓. Solution found: S=6, U=4, N=3, R=1, A=2, Y=8.
Answer: SUN = 643, RAYS = 1286. S=6, U=4, N=3, R=1, A=2, Y=8.
Question: Solve the cryptarithm: \( GO \times GO = HOP \). Each letter stands for a unique digit and \( G \ne 0 \). Find the digits for G, O, H, P.
Solution: We need a 2-digit number \( GO \) whose square is a 3-digit number \( HOP \). Step 1 — Find the range of GO. For the square to be a 3-digit number: \[ GO^2 \ge 100 \Rightarrow GO \ge 10 \] \[ GO^2 \le 999 \Rightarrow GO \le 31 \] So GO is between 10 and 31. Since \( G \ne 0 \), G is 1, 2, or 3. Step 2 — Key constraint: the units digit of \( GO^2 \) must be P, and the tens digit of \( GO^2 \) must be O (same digit as the units of GO). Let the units digit of GO be O. We need the tens digit of \( GO^2 \) to also be O. Step 3 — List all 2-digit numbers from 10 to 31 and check if the tens digit of their square equals their units digit. \( 10^2 = 100 \): tens digit of 100 is 0. Units digit of 10 is 0. Match! But O=0 and both H,O,P must be distinct from G=1. HOP=100, H=1=G — conflict. \( 11^2 = 121 \): tens digit 2. Units digit of 11 is 1. No match. \( 12^2 = 144 \): tens digit 4. Units digit 2. No. \( 13^2 = 169 \): tens digit 6. Units digit 3. No. \( 14^2 = 196 \): tens digit 9. Units digit 4. No. \( 15^2 = 225 \): tens digit 2. Units digit 5. No. \( 16^2 = 256 \): tens digit 5. Units digit 6. No. \( 17^2 = 289 \): tens digit 8. Units digit 7. No. \( 18^2 = 324 \): tens digit 2. Units digit 8. No. \( 19^2 = 361 \): tens digit 6. Units digit 9. No. \( 20^2 = 400 \): tens digit 0. Units digit 0. Match! GO=20, G=2, O=0. HOP=400, H=4, O=0, P=0. But O=P=0 — invalid. \( 21^2 = 441 \): tens digit 4. Units digit 1. No. \( 22^2 = 484 \): tens digit 8. Units digit 2. No. \( 23^2 = 529 \): tens digit 2. Units digit 3. No. \( 24^2 = 576 \): tens digit 7. Units digit 4. No. \( 25^2 = 625 \): tens digit 2. Units digit 5. No. \( 26^2 = 676 \): tens digit 7. Units digit 6. No. \( 27^2 = 729 \): tens digit 2. Units digit 7. No. \( 28^2 = 784 \): tens digit 8. Units digit 8. Match! GO=28, G=2, O=8. HOP=784, H=7, O=8, P=4. Check tens digit of 784: it is 8 = O ✓. Digits: G=2, O=8, H=7, P=4 — all distinct ✓. \( 29^2 = 841 \): tens digit 4. Units digit 9. No. \( 30^2 = 900 \): tens digit 0. Units digit 0. Match! But G=3, O=0. HOP=900, H=9, O=0, P=0. O=P=0 — invalid. \( 31^2 = 961 \): tens digit 6. Units digit 1. No. Step 4 — The only valid solution is GO = 28. Verify: \( 28 \times 28 = 784 \). HOP = 784. H=7, O=8, P=4. All four digits G=2, O=8, H=7, P=4 are distinct ✓. The tens digit of 784 is 8 = O ✓.
Answer: GO = 28, HOP = 784. G=2, O=8, H=7, P=4.
Question: Solve the cryptarithm: \( CAT \times 4 = BIRD \), where each letter represents a unique digit (0–9) and the leading digits C and B are not zero.
Answer: \( C = 3,\ A = 5,\ T = 7,\ B = 1,\ I = 4,\ R = 2,\ D = 8 \), giving \( 357 \times 4 = 1428 \).