Show simple item record

dc.rights.licenseIn Copyrighten_US
dc.creatorParsons, Kyle Jacob
dc.date.accessioned2011-09-07T14:33:00Z
dc.date.created2011
dc.identifierWLURG38_Parsons_MATH_2011
dc.identifier.urihttp://hdl.handle.net/11021/23093
dc.descriptionThesis; [FULL-TEXT FREELY AVAILABLE ONLINE]en_US
dc.descriptionKyle Jacob Parsons is a member of the Class of 2011 of Washington and Lee University.en_US
dc.description.abstractIn this thesis we will examine progressions in permutations. We will analyze regular and circular permutations with progressions either modular or regular with rise one or two. We will calculate the number of permutations on the numbers 0 through n - 1 containing x progressions. This is based largely on work by Riordan [1] and Dymacek and Lambert [2].en_US
dc.description.statementofresponsibilityKyle Parsons
dc.format.extent14 pagesen_US
dc.language.isoen_USen_US
dc.rightsThis material is made available for use in research, teaching, and private study, pursuant to U.S. Copyright law. The user assumes full responsibility for any use of the materials, including but not limited to, infringement of copyright and publication rights of reproduced materials. Any materials used should be fully credited with the source.en_US
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en_US
dc.subject.otherWashington and Lee University -- Honors in Mathematicsen_US
dc.titleArithmetic Progressions in Permutations (thesis)en_US
dc.typeTexten_US
dcterms.isPartOfRG38 - Student Papers
dc.rights.holderParsons, Kyle Jacob
dc.subject.fastPermutationsen_US
dc.subject.fastSeries, Arithmeticen_US
local.departmentMathematicsen_US
local.scholarshiptypeHonors Thesisen_US


Files in this item

Thumbnail
Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record