Bunuel
Code letters X, Y, and Z each represent one digit in the three-digit prime number XYZ. If both X and Y are even integers, and if the sum of the three digits is 7, how many different three-digit numbers could XYZ represent?
Two things here:
- The letters here are just letters. I don't know what it could even mean to call them "code letters";
- Testing even modestly large numbers to see if they're prime is an inordinately time-consuming process. To properly verify that, say, 601 is prime, you need to confirm that you can't divide it by any prime up to √601. So you need to check if you can divide 601 by 2, 3, 5, 7, 11, 13, 17, 19 and 23. That's already far more tedious computational work than any GMAT question would ever require, but in this problem, we also need to do a similar amount of work for four other candidate answers (we can quickly rule out 205, but need to check 223, 241, 403, 421), so the GMAT could never ask a question like this.
There's no fast way to tell if a number like 223 or 601 is prime, and memorizing primes that large would never be helpful on a real GMAT question.