MathGroup Archive 2010

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

Search the Archive

Re: 15! permutations

  • To: mathgroup at smc.vnet.net
  • Subject: [mg108651] Re: 15! permutations
  • From: "Sjoerd C. de Vries" <sjoerd.c.devries at gmail.com>
  • Date: Fri, 26 Mar 2010 05:35:45 -0500 (EST)
  • References: <hofgdo$fdg$1@smc.vnet.net>

I don't think any PC could do this in reasonable time.

Just assume that every comparison would take one clock cycle on a 4
GHz PC. The whole process would then take more than 7 million years.

Cheers -- Sjoerd

On Mar 25, 1:11 pm, bn77 <nayantara.bhatna... at gmail.com> wrote:
> Hi,
>
> I'm trying to write a program in mathematica that compares roughly (15!)^2 / 2 pairs of permutations of length 15. Can mathematica do this in a reasonable time? Any experience of this sort?
>
> TIA,
> bn77



  • Prev by Date: Mathematica starts badly 1 time over 5 in OSX
  • Next by Date: Re: Convert to lower Mathematica version
  • Previous by thread: 15! permutations
  • Next by thread: Re: 15! permutations