BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

In a certain coding scheme

This topic has expert replies
Post new topic Post Reply
Previous Topic Next Topic
Senior | Next Rank: 100 Posts
Posts: 75
Joined: Tue Feb 10, 2009 11:30 pm

In a certain coding scheme

by nhai2003 » Mon Jul 13, 2009 7:29 am
In a certain coding scheme, each word is encoded by replacing each letter in the word with another letter. The same code is used for all words, so that the same letter replaces a given letter each time the given letter occurs. What code will result when the word TAME is encoded by this scheme?
(1) When the word MAT is encoded, the result is DLX.
(2) When the word TEA is encoded, the result is XRL.

Please help guys
Such a difficult question, I don't even understand the wording of the question.
Top
Source: — Data Sufficiency |
Master | Next Rank: 500 Posts
Posts: 379
Joined: Wed Jun 03, 2009 3:05 am
Thanked: 19 times
Followed by:1 members
GMAT Score:690

by sreak1089 » Mon Jul 13, 2009 8:36 am
Even though this Qn looks complex, its quite simple in my opinion.
we need to find encoding for TAME.

stm# 1: MAT is encoded, the result is DLX

=> M=D, A=L, T=X, but we dont have encoding for E in the word 'TAME'

stm# 2 is NOT sufficient.

stm# 2: TEA is encoded, the result is XRL.

=> T=X, E=R, A=L, but we dont have encoding for M in the word 'TAME'.

Together we have encoding for TAME which is 'XLDR'.
Top
Post new topic Post Reply
• Page 1 of 1