Search in the English dictionary the words that complete the alphametic sequences + sequences = ?
in such a way the solution is unique.

There are several possible solutions,- provide the one with a minimal value of s+e+q+u+n+c.

0123456789   mv   SEQUENCES  SEQUENCES + SEQUENCES
ENQSHFRCU.   21   302801703  605603406 = REFRESHER
EINUSRCQD.   22   407302604  814605208 = DISCERNED
NTUSQEGIC.   22   354250853  708501706 = INCENTING
ECSQD.OFUN   23   203809102  407618204 = DEFOCUSED
DSECRNUGQ.   25   128625321  257250642 = ENGENDURE
EOQUS.PCRN   25   402309704  804619408 = RESPONSER
.SNTCQU.AE   27   195692491  391384982 = TESTACEAN

Though the title hinted at 9-letter words, I checked for the possibility that a 10-letter word was a possible solution, yet I did not find any such word.

The alphametic solution of minimal value (as yet discovered) is REFRESHER.

---
To not be deceiving, REFRESHER had been added post Ady's post, though the alphametic still required solving.

I've rated this problem as a 2 as the number of permutations that must be checked reasonably requires the power of a computer, though there are some reductions to the number of possibilities due to logic. A good problem, to be rated 3 or higher, should not rely on a computer.

Edited on December 20, 2015, 12:53 am

Posted by Dej Mar on 2015-12-18 04:38:21