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

 Two sums of digits (Posted on 2017-09-02)
asd+fgh=jkl

Believe me - there are numerous solutions of the above alphametic.

I. What is the minimal possible sum of participating digits?
ii. Same question for as+df=gh

 No Solution Yet Submitted by Ady TZIDON No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re: Both at once - solutions Comment 5 of 5 |
(In reply to Both at once? by Brian Smith)

I found 10 solutions for solving both alphametics simultaneously (x is the unused digit):

`asdfghjklx1627439052192645837024153978063145768902394281675041529370864613598207514293807654136790825712698403`
To minimize the sum of the used digits, the unused digit must be as large as possible.  This leaves the 7th solution as the solution with the smallest sum of digits used. 461+359=820 46+13=59

 Posted by Brian Smith on 2017-09-03 12:53:57

 Search: Search body:
Forums (0)