|
[Date Index]
[Thread Index]
[Author Index]
Arithmetic Puzzle (so simple it's hard)
- To: mathgroup at smc.vnet.net
- Subject: [mg71301] Arithmetic Puzzle (so simple it's hard)
- From: Bruce Colletti <vze269bv at verizon.net>
- Date: Tue, 14 Nov 2006 05:06:17 -0500 (EST)
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)
|