Read the given information carefully and answer the related questions: In a…

Concept

In a code-language pairing problem each word maps to one code-token, but the tokens within a sentence are listed in scrambled order. To pin a single word to a single token, compare sentences: a token shared by two sentences must stand for a word those sentences share, and a token that appears only when a particular word appears (and never otherwise) must be that word's code. Find each code by the intersection of the sentences that contain the word, minus every token from sentences that do not.

Application

The four statements are:

• Play the same game = us ud ut uk

• Seen in the play = uk ua ud um

• The jar is seen = ud ua uh uw

• The same game played = ut ud ub us

Work out the words needed for 'is played':

1. 'the' appears in statements 1, 2, 3 and 4; the only token common to all four is ud, so the = ud.

2. 'seen' appears in statements 2 and 3 but not 1 or 4; the token left after removing the others is ua, so seen = ua.

3. Statement 3 (The jar is seen = ud ua uh uw) now reduces to {the=ud, seen=ua}, leaving {jar, is} = {uh, uw}.

4. The clue states jar = uh, so the remaining token gives is = uw.

5. 'played' appears in statement 4 but not statement 1; statement 1 shares the words the, same and game with statement 4, so removing their codes ud, ut, us leaves ub, giving played = ub.

Therefore is played = uw ub.

Cross-check

Substituting back, statement 4 'The same game played' = the(ud) + same/game(us,ut) + played(ub) = ud ut ub us, which matches the given ut ud ub us. The pairing is consistent, confirming is played = uw ub.