ChatterBank1 min ago
Sunday Times Teaset 2712
2 Answers
Re this problem: I looked at it for over an hour today and had no idea how to begin to solve it! It is a word sum problem, wherein
SIT +
WALK +
TALK =
----------
CRAWL
We are told that each word represents an odd number, so T K and L are odd, and I deduced that C = 1. After that I was stumped. I would like to get into this sort of puzzle but can't see a way to continue! (I also deduced, rightly or wrongly, that K cannot be 5!
Could someone give me a clue on how to solve these, or a website address (I searched to no avail).
Thanks in advance
SIT +
WALK +
TALK =
----------
CRAWL
We are told that each word represents an odd number, so T K and L are odd, and I deduced that C = 1. After that I was stumped. I would like to get into this sort of puzzle but can't see a way to continue! (I also deduced, rightly or wrongly, that K cannot be 5!
Could someone give me a clue on how to solve these, or a website address (I searched to no avail).
Thanks in advance
Answers
Best Answer
No best answer has yet been selected by RSDonovan. Once a best answer has been selected, it will be shown here.
For more on marking an answer as the "Best Answer", please visit our FAQ.These puzzles are known as Alphametics and if you Google that you should find sites to help you solve it (or indeed solve it for you if you wish).
I think you are right in your assumptions so far. C=1 because CRAWL must be at least 10000 and can't be as much as 20000 because the highest W & T can be is 8 & 9. K cannot be 5 because K+K would equal 10 which would mean T=L which is not allowed.
Good Luck!
I think you are right in your assumptions so far. C=1 because CRAWL must be at least 10000 and can't be as much as 20000 because the highest W & T can be is 8 & 9. K cannot be 5 because K+K would equal 10 which would mean T=L which is not allowed.
Good Luck!
Related Questions
Sorry, we can't find any related questions. Try using the search bar at the top of the page to search for some keywords, or choose a topic and submit your own question.