Unit 12 · Multi-Step Conditional Reasoning

Gabi and Luke's Cipher — Ambiguity Problem

Lesson 8 of 30

Premium

About this lesson

A substitution cipher maps 26 letters to only 10 digits — so several letters must share each digit. Gabi encodes four words. Luke decodes three with confidence. One word he can't be sure about. Why? Because its digit sequence also spells a different real word.

Chapters

0:00Introduction
0:22Question
1:33Strategy
2:20Step 1: DONE = NONE — the ambiguous word
3:24Step 2: Confirm TOOK, HIGH, SORT are unambiguous
4:39Correct answer

Question

Gabi and Luke want to use a code to send secret messages to each other. In the code, each letter of the alphabet is represented by a one-digit number, as follows:

ABCDEFGHIJ
1234567890
KLMNOPQRST
1234567890
UVWXYZ
123456

For example, the word BELL would be written in the code as 2-5-2-2.

To test the system, Gabi writes four words in the code and sends them to Luke. Luke tries to decode them, and gets the following answers:

TOOK

DONE

HIGH

SORT

Luke is confident that he has three of these words correct, but he is unsure about the other one.

Which word is Luke unsure about?

Free account · Selective

Take your Selective prep further

  • Sample questions & worked solutions across core Selective topics
  • Digital exam simulator with interactive practice sets
  • Personalised progress tracking across all your devices
Create free account

Already have an account? Log in here

No payment required. Compare Selective plans

0 of 30 lessons completed

0%

Give Your Child the Best Chance at Selective Entry

Join NSW families preparing their children for the Selective Schools Placement Test with the most realistic online Selective practice tests available. First tests free—no credit card required.

Claim Your Free Selective Practice Tests