How often is a permutation an n'th power?

dc.contributor.author	Larsen, Michael	eng
dc.date.issued	1997	eng
dc.description	http://arxiv.org/PS_cache/math/pdf/9712/9712223v1.pdf	eng
dc.description.abstract	We give a short argument that for any fixed n, the probability that a permutation on m letters is an n'th power is asymptotically C m^{phi(n)/n - 1}.	eng
dc.identifier.citation	arXiv:math/9712223v1	eng
dc.identifier.uri	http://hdl.handle.net/10355/5485	eng
dc.language	English	eng
dc.relation.ispartof	Mathematics publications (MU)	eng
dc.relation.ispartofcommunity	University of Missouri-Columbia. College of Arts and Sciences. Department of Mathematics	eng
dc.rights	OpenAccess.	eng
dc.rights.license	This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 License.
dc.subject	combinatorics	eng
dc.subject.lcsh	Combinatorial probabilities	eng
dc.title	How often is a permutation an n'th power?	eng
dc.type	Article	eng

Mathematics publications (MU)
The items in this collection are the scholarly output of the faculty, staff, and students of the Department of Mathematics.