MathGroup Archive 2010

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

Search the Archive

Re: 15! permutations

  • To: mathgroup at smc.vnet.net
  • Subject: [mg108657] Re: 15! permutations
  • From: Bill Rowe <readnews at sbcglobal.net>
  • Date: Fri, 26 Mar 2010 05:36:52 -0500 (EST)

On 3/25/10 at 6:11 AM, nayantara.bhatnagar at gmail.com (bn77) wrote:

>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?

Forget execution time for a moment. Have you considered how much
memory would be needed to hold these pairs?

In[1]:= Log[10, (15!)^2] // N

Out[1]= 24.233

I am absolutely certain you don't have access to a machine with
any where near 10^25 bytes.

You very much need to consider a different approach to whatever
problem you are trying to solve.



  • Prev by Date: Re: Convert to lower Mathematica version
  • Next by Date: Re: 15! permutations
  • Previous by thread: Re: 15! permutations
  • Next by thread: Re: 15! permutations