Re: [R] Question about Distinguishable Permutation

2007-10-09 Thread Robin Hankin

On 6 Oct 2007, at 20:05, house-ball wrote:

> Hi,
>
>   How can I list all possilities of Distinguishable Permutation by  
> R? For example, N=6, n1=n2=n3=2, the total possible answers are 6!/ 
> (2!2!2!)=90.
>
>   Please help me.
>

Hello

packages "gregmisc", "combinat", and "partitions" include related  
functionality.
However,  none of these (AFAICS) solves your problem, which is now
on my Things To Do List [don't hold your breath].

What is your application?






>
>   Thank you So much.

--
Robin Hankin
Uncertainty Analyst
National Oceanography Centre, Southampton
European Way, Southampton SO14 3ZH, UK
  tel  023-8059-7743

__
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.


[R] Question about Distinguishable Permutation

2007-10-06 Thread house-ball
Hi,
   
  How can I list all possilities of Distinguishable Permutation by R? For 
example, N=6, n1=n2=n3=2, the total possible answers are 6!/(2!2!2!)=90.
   
  Please help me.
   
   
  Thank you So much.

   
¡A
[EMAIL PROTECTED]://tw.mobile.yahoo.com/texts/mail.php
[[alternative HTML version deleted]]

__
R-help@r-project.org mailing list
https://stat.ethz.ch/mailman/listinfo/r-help
PLEASE do read the posting guide http://www.R-project.org/posting-guide.html
and provide commented, minimal, self-contained, reproducible code.