### Abstract

We give very efficient Magma code for recursively computing the probability that an element of the symmetric group Sym(n) has order coprime to a given positive integer m.

Original language | English |
---|---|

Type | Magma computer code |

Number of pages | 2 |

Publication status | Published - 19 Apr 2019 |

## Cite this

Glasby, S., & Harper, S. (2019, Apr 19). Magma code for computing the probability that an element of Sym(n) has order coprime to m: arXiv:1807.10450.