Did I find the right examples for you? yes no

All Samples(2)  |  Call(2)  |  Derive(0)  |  Import(0)
Computes the order of a permutation.

When the permutation is raised to the power of its
order it equals the identity permutation.

Examples
========

>>> from sympy.combinatorics.permutations import Permutation
>>> Permutation.print_cyclic = False(more...)

src/s/y/sympy-0.7.5/sympy/combinatorics/tests/test_permutations.py   sympy(Download)
    assert rmul(p, ~p).signature() == 1
 
    assert p.order() == 6
    assert q.order() == 10
    assert (p**(p.order())).is_Identity

src/s/y/sympy-HEAD/sympy/combinatorics/tests/test_permutations.py   sympy(Download)
    assert rmul(p, ~p).signature() == 1
 
    assert p.order() == 6
    assert q.order() == 10
    assert (p**(p.order())).is_Identity