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

Re: Google's aptitude test equation

• To: mathgroup at smc.vnet.net
• Subject: [mg55060] Re: Google's aptitude test equation
• From: "Lorenzo Castelli" <gcastelli at NOSPAMracine.ra.it>
• Date: Fri, 11 Mar 2005 04:20:34 -0500 (EST)
• References: <200503091134.GAA06997@smc.vnet.net> <d0p814$j56$1@smc.vnet.net>
• Sender: owner-wri-mathgroup at wolfram.com

"DrBob" <drbob at bigfoot.com> wrote in message 
news:d0p814$j56$1 at smc.vnet.net...
> Here's a minor rewrite:
> [...]

Much nicer solution, thanks.

> As for Reduce, it can't check even ONE of the 449 solutions:

Yeah, it looks like the evaluation time grows exponentially with the number 
of variables in the inequality:

Table[ First@Timing@Reduce[First@sol && Unequal @@ Take[vars, i]], {i, 2, 
8} ]
ListPlot[% /. Second -> 1, PlotJoined -> True]

{0.016 Second, 0. Second, 0. Second, 0.031 Second, 0.141 Second, 1.515 
Second,15.532 Second}

-- 
Lorenzo Castelli
E-Mail: gcastelli at racine.ra.it 

• References:
  • Google's aptitude test equation
    • From: "Lorenzo Castelli" <gcastelli@NOSPAMracine.ra.it>