Before trying the problem "note your opinion as to whether the observed pattern is known to continue, known not to continue, or not known at all."
For integers greater than 1,
2n is never congruent to 1 (mod n)
2n is congruent to 2 (mod n) whenever n is prime, and sometimes when it isn't,
is 2n ever congruent to 3 (mod n)?
Upon returning from Las Vegas my BOY
friend quipped, grinning from ear to ear:
"it was a wonderful vacation!
Nobody actually KNOWS
, how 2
oney he WON
but you can easily find out by solving the simple alphametic using the bolded part of this puzzle text.
The resulting product will give you the dollar value of his "reward".