MathGroup Archive 2005

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

Search the Archive

Re: permutations


Hi Francisco,
The number of permutations can easily be calcultaed by n!. For n=20 this 
gives a number of the order of 10^18. You will certainly not be able to 
store this in the near future.

What can you do? Although I can not imagine what you want to do with so 
many permutations, you could still use: NextPermutation from the 
package: DiscreteMath`Combinatorica`. This will give you one permutation 
at a time. Of course, it will take some patience to go through all 
permutations!

Daniel

Francisco Gutierrez wrote:
> Dear Group:
>   If I do for example:
>   Permutations[{x1,x2,x3,x4,x5,x6,x7,x8,x9,x10,x11,x12}],
>   my computer runs out of memory.
>   This is not such a poor computer.  Actually, I would need to do permutations of lists of Length 20, perhaps 25.  I am aware these calculations are big (Length[x]!), but I wonder if there is some way around the problem. Compilating Permutations? But then how? Can somebody help me?
>   Francisco Gutiérrez
> 
> 		
> 


  • Prev by Date: Re: Re: Re: How to read a data file in text format?_from a new learner
  • Next by Date: Re: Timing of looping operators
  • Previous by thread: Re: permutations
  • Next by thread: Re: permutations