All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Logic
The smallest sum (Posted on 2008-08-08) Difficulty: 2 of 5
In each of the three additions below, each letter represents a different digit; however, each letter does not necessarily represent the same digit in one addition as it does in another addition.
          G  A  L  E       E  L  S  A        N  E  A  L  
       +  N  E  A  L    +  G  A  L  E     +  E  L  S  A
       -------------    -------------     -------------
          E  L  S  A       N  E  A  L        G  A  L  E
Which addition has the smallest sum?

See The Solution Submitted by pcbouhid    
Rating: 3.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: Solution | Comment 3 of 4 |
(In reply to Solution by Dej Mar)

Dej Mar presents three of my seven cases, but misses the lowest sum (5297) although we agree that the first addition leads to the lowest sum.  Am I overlooking some condition?

I just generated all three sums for each combination of values, A, L, and S from 0 thru 9; E, G, N from 1 thru 9 (since in all three additions, those letters are the leading digit of one of the lines).  I read the problem to mean that the three additions are totally independent of each other, i.e. that assignments are the same for the three lines of each addition, but unrelated to the other two additions.


  Posted by ed bottemiller on 2008-08-08 16:25:24
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information