Lean meat: Difference between revisions
Jump to navigation
Jump to search
Oscarlevin (talk | contribs) Created page with 'Solve the cryptarithmetic: LEAN + MEAT = LLAMA. There are two solutions. (Each letter represents a unique single digit 0-9). Category: Cryptarithmetic' |
Oscarlevin (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
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== | |||
{{Hint| First determine what L should be. M should be easy after that.}} | |||
{{Needs answer}} | |||
{{Needs solution}} | |||
[[Category: Cryptarithmetic]] | [[Category: Cryptarithmetic]] | ||
Revision as of 09:04, 12 May 2010
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.