I recently sent a cryptarithm to The Cryptogram, the magazine for the American Cryptogram Association (ACA), but it was rejected as too hard. It is difficult to solve, especially for paper-and-pencil solvers, but it is solvable through anagramming and persistence. It makes an interesting exercise for computer programmers to write a solver. If you want to try it here it is:
Multiplication (3 words, 1-0) THE RAT
BERRY * I = ELANDS
In case you’re not familiar with the format for such problems, the * means multiply and the phrase in parentheses means that when correctly solved, the letters (i.e. their numerical equivalents) put in the order 1234567890 spell out three words. Each letter represents one digit and initial zeros are not allowed, so you know that the B, I, and E are not 0, and you know that also for the Y because the final digit of the product (S in this case) would also be Y.
I’m not going to post the solution, but you can put the puzzle into this website to get the solution.