CTK Exchange
Front Page
Movie shortcuts
Personal info
Awards
Reciprocal links
Privacy Policy

Interactive Activities

Cut The Knot!
MSET99 Talk
Games & Puzzles
Arithmetic/Algebra
Geometry
Probability
Eye Opener
Analog Gadgets
Inventor's Paradox
Did you know?...
Proofs
Math as Language
Things Impossible
My Logo
Math Poll
Other Math sit's
Guest book
News sit's

Recommend this site

Manifesto: what CTK is about |Store| Search CTK Buying a book is a commitment to learning Table of content Things you can find on CTK Chronology of updates Email to Cut The Knot Recommend this page

CTK Exchange

Subject: "Math/Word Puzzles"     Previous Topic | Next Topic
Printer-friendly copy     Email this topic to a friend    
Conferences The CTK Exchange High school Topic #213
Reading Topic #213
Rachel
guest
Nov-14-02, 03:57 PM (EST)
 
"Math/Word Puzzles"
 
   I have a problem to do in which letters represent numbers. The specific one I don't understand is SEND + MORE = MONEY. The "E's" are the same number in each word, as are the "N's" and "M's" and "O's". I figured out what the highest and lowest possible numbers SEND and MORE could be, but I don't know how to go about figuring the problem out, except for guess-and-check. If anyone has any ideas, please respond and give me some clues. Thanks.

Rachel


  Alert | IP Printer-friendly page | Edit | Reply | Reply With Quote | Top
Whymme
guest
Nov-14-02, 08:00 PM (EST)
 
1. "RE: Math/Word Puzzles"
In response to message #0
 
   One convention in these puzzles is that the numbers given don't start with a zero. So the S and the M cannot be zero.

You shouldn't have to guess what the "M" stands for. Logical thinking is all that is required. Once you know that one, you can reason what the S is, and what the O must stand for.

You have three equations with an E;
D+E=(10+)Y
N+R=(10+)E
E+O=(10+)N
Two of these contain an N as well. By comparing those relations you can make some more educated guesses as to what the E and the N cannot stand for.

Continue from there.

Whymme


  Alert | IP Printer-friendly page | Edit | Reply | Reply With Quote | Top

Conferences | Forums | Topics | Previous Topic | Next Topic

You may be curious to visit the old CTK Exchange archive.

|Front page| |Contents| |Store|

Copyright © 1996-2018 Alexander Bogomolny

[an error occurred while processing this directive]
 Advertise