Lean meat: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) No edit summary |
Oscarlevin (talk | contribs) No edit summary |
||
(3 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
==Puzzle== | |||
Solve the cryptarithmetic: LEAN + MEAT = LLAMA. There are two solutions. (Each letter represents a unique single digit 0-9). | Solve the cryptarithmetic: LEAN + MEAT = LLAMA. There are two solutions. (Each letter represents a unique single digit 0-9). | ||
==Help== | ==Help== | ||
{{Hint| First determine what L should be. M should be easy after that.}} | {{Hint| First determine what L should be. M should be easy after that.}} | ||
==See also== | |||
*[[GO ON BOB]] | |||
{{Needs answer}} | {{Needs answer}} | ||
{{Needs solution}} | {{Needs solution}} | ||
[[Category: Cryptarithmetic]] | [[Category: Cryptarithmetic puzzles]] |
Current revision as of 09:36, 13 July 2013
Puzzle
Solve the cryptarithmetic: LEAN + MEAT = LLAMA. There are two solutions. (Each letter represents a unique single digit 0-9).
Help
Hint
First determine what L should be. M should be easy after that.