MathGroup Archive 2006

[Date Index] [Thread Index] [Author Index]

Search the Archive

Arithmetic Puzzle (so simple it's hard)


How would this problem be solved in Mathematica?

BUT * ASK = FEAST, where each letter is a 1-digit number, no two letters may stand for the same number, and the letters are in {0,1,2,4,5,6,7,9}.

Thankx.

Bruce


  • Prev by Date: replacement rule and sparsearray question
  • Next by Date: Re: Re: Efficiency of repeatedly appending to a List
  • Previous by thread: Re: replacement rule and sparsearray question
  • Next by thread: Re: Arithmetic Puzzle (so simple it's hard)