MathGroup Archive 2006

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

Search the Archive

Re: Re: Re: Arithmetic Puzzle (so simple it's hard)

  • To: mathgroup at
  • Subject: [mg71789] Re: [mg71748] Re: [mg71627] Re: Arithmetic Puzzle (so simple it's hard)
  • From: Bruce Colletti <vze269bv at>
  • Date: Wed, 29 Nov 2006 02:56:31 -0500 (EST)


All posts are welcome here, newbie and advanced.  Often times the newbie questions are VERY instructive because the basics (there are so many of them) can be slippery.

I've lost track of how many times a "simple" matter quickly led to something "advanced."  But as you say, these terms are subjective.  Two sides of the same coin.

MathGroup is for everyone.  Stephan Wolfram (if I recall his words correctly from October's Tech Conference) wanted this forum to be one of collaboration (in addition to its chief function of providing information).


From: =?ISO646-US?Q?J=3Fnos?= <janos.lobb at>
Date: 2006/11/28 Tue AM 05:04:02 CST
To: mathgroup at
Subject: [mg71789] [mg71748] Re: [mg71627] Re: Arithmetic Puzzle (so simple it's hard)


I am getting used to fun prog.  However the purpose of my post was to  
show that you can also get to a solution by not beating the beaten  
path :)

Simple and understandable are very subjective words.  Let me say  
this.  When one of my al-gebra teacher - who came to substitute Andor  
Kertész - open his mouth and emitted the word Permutation, I stood up  
and walked out from the lecture hall.  It sounded so gebrish that I  
could not stay a minute for it.  On the same time when my physics  
teacher told that:  Precessióra általában nutáció is superponálódik",  
I asked him in the break: "What does it mean:  "általában".
Well, if you are not getting it do not worry.

I am never concerned by the readability of my newbies.  They are like  
new houses, a few 2X4 here and there hanged together by some nails.   
I am posting it for fellow newbies.  Professionals are not needed to  
look at them.  When I am asking for help I am asking fellow newbies  
to reply.  Expert advise would be anyway to much to my brain and just  
would lay in my mailbox ununderstood.

May be this group should be bifurcated.  One for experts and one for  
newbies.  Anyone else should be quantum tunneling between the two.

Just skip my posts.  Do not even bother looking at them.  Then peace  
will be upon.



On Nov 25, 2006, at 5:37 AM, croddie at wrote:

> Janos: get used to functional programming!
> Simple program, not too slow; plus you can read and understand it:
> doesitwork[partition_] :=
>      Module[{b, u, t, a, s, k, f, e},
>                 {b, u, t, a, s, k, f, e} = partition;
>                 (100b + 10u +t)(100a + 10s + k) == 10000f + 1000e +
> 100a + 10s + t];
> Timing[Select [Permutations[{0, 1, 2, 4, 5, 6, 7, 9}], doesitwork]]
> Output:
> {1.578 Second, {{0, 5, 6, 4, 9, 1, 2, 7}, {6, 7, 0, 1, 4, 2, 9, 5}}}
> János wrote:
>> Any suggestions to make it faster would be highly appreciated.  /It
>> took 526 seconds to run with above parameters/
>> János
>> On Nov 14, 2006, at 5:06 AM, Bruce Colletti wrote:
>>> How would this problem be solved in Mathematica?

Trying to argue with a politician is like lifting up the head of a  
(S. Lem: His Master Voice)

  • Prev by Date: Re: Functional decomposition (solving f[f[x]] = g[x] for given g)
  • Next by Date: Use pattern to find minimum without using min
  • Previous by thread: Re: Arithmetic Puzzle (so simple it's hard)
  • Next by thread: RE: Re: Re: Re: Arithmetic Puzzle (so simple it's hard)