Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

here is such theorem or axiom ,which states that

(*) Let $n$ be an odd number,The number of way to write the $n$-cycle $(1,2,.....n)$ in the form $uvu^{-1}v^{-1}$,is equal $2n\cdot n!/(n+1)$.

my question is what is $n$-cycle,when i have tried to search in google,it said that,it is nitrogen cycles, which is defined like this

The nitrogen cycle is the process by which nitrogen is converted between its various chemical forms

is it so?and what kind of application it has in numbers and permutations?thanks a lot

share|improve this question
3  
The n-cycle that google brought up is completely different to the type you are interested in. –  Ragib Zaman Sep 30 '11 at 5:08
    
Your search result is about chemistry, not mathematics. Instead, try lmgtfy.com/?q=n-cycle+permutation&l=1 –  Dan Brumleve Sep 30 '11 at 5:10
1  
The n-cycle looks like it's simply the permutation that 'cycles' the numbers like so: $$1\to2\to3\to\cdots n\to1.$$ The counting formula sounds like interesting in and of itself, though, so I'd like to know where you read it. –  anon Sep 30 '11 at 7:06
    
I've seen $k$-cycles, sure... –  J. M. Sep 30 '11 at 7:23
add comment

1 Answer

An $n$-cycle in this context is a particular [cyclic permutation][1] of length $n$ of $n$ elements, compare the comments to your post.

But note that the formula in your OP cannot be correct because for $n+1$ an odd prime it does not give an integer.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.