Mathematica 9 is now available
Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2006
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2006

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

Search the Archive

Recursion

  • To: mathgroup at smc.vnet.net
  • Subject: [mg70367] Recursion
  • From: "Susan" <priyapalmfield at gmail.com>
  • Date: Sat, 14 Oct 2006 03:07:26 -0400 (EDT)

Does any one know how to write a recursive procedure for n!n(n-1)/4
and also a recursive procedure to find all the permutations of degree n
with k cycles
For eg: There are 3 permutations of degree 3 with 2 cycles [1,3,2]
[2,1,3] and [3,2,1] 



Thanks for any help 

Susan Philip


  • Prev by Date: path for package
  • Next by Date: how to sum lists of unequal length?
  • Previous by thread: RE: path for package
  • Next by thread: how to sum lists of unequal length?