Download
PDF 497.76 KB
undergraduate thesis
12   1
Elmsley's Problem
Jurica Šućur (2018)
Josip Juraj Strossmayer University of Osijek
Department of Mathematics
Chair of Applied Mathematics
Computer Science Research Group
Cite this document...

Šućur, J. (2018). Elmsleyev problem (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:126:944292

Šućur, Jurica. "Elmsleyev problem." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2018. https://urn.nsk.hr/urn:nbn:hr:126:944292

Šućur, Jurica. "Elmsleyev problem." Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, 2018. https://urn.nsk.hr/urn:nbn:hr:126:944292

Šućur, J. (2018). 'Elmsleyev problem', Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, accessed 23 July 2019, https://urn.nsk.hr/urn:nbn:hr:126:944292

Šućur J. Elmsleyev problem [Undergraduate thesis]. Osijek: Josip Juraj Strossmayer University of Osijek, Department of Mathematics; 2018 [cited 2019 July 23] Available at: https://urn.nsk.hr/urn:nbn:hr:126:944292

J. Šućur, "Elmsleyev problem", Undergraduate thesis, Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Osijek, 2018. Available at: https://urn.nsk.hr/urn:nbn:hr:126:944292

Metadata
TitleElmsleyev problem
Title (english)Elmsley's Problem
AuthorJurica Šućur
MentorSnježana Majstorović (mentor)
GranterJosip Juraj Strossmayer University of Osijek
Department of Mathematics
(Chair of Applied Mathematics)
(Computer Science Research Group)
Osijek
Defense date and country2018-09-28, Croatia
Scientific / art field,
discipline and subdiscipline		NATURAL SCIENCES
Mathematics
Discrete and Combinatorial Mathematics
Abstract
Ovaj završni rad bavi se ulogom matematike u miješanju igraćih karata, konkretno Elmsleyevim problemom. Taj problem se odnosi na jedno od najtežih načina miješanja karata, popularno savršeno miješanje. Osim njega, detaljno ćemo objasniti i razne druge načine kako promiješati karte. Kod savršenog miješanja, pokušat ćemo odgovoriti na sljedeća pitanja: koliki je najmanji broj istovrsnih miješanja koje dovode karte do početne pozicije? Postoji li niz savršenih miješanja koji kartu s vrha špila dovode na odabranu poziciju u špilu? Za kraj ostavljamo glavno pitanje koje je postavio Elmsley: može li se nizom savršenih miješanja karta s pozicije p prebaciti na poziciju q? U radu ćemo ukratko opisati grupu generiranu savršenim miješanjima, a također ćemo spomenuti i neke od primjena koncepta savršenog miješanja.
Abstract (english)
This bachelor’s thesis considers the role of mathematics in shuffling playing cards, specifically with the Elmsley’s problem. This problem is concerned with one of the most difficult shuffle methods, the popular perfect shuffling. Besides this problem, we will explain in details various types of card shuffling. Concerning perfect shuffle, we will try to give an answer to the following questions: what is the smallest number of perfect shuffles of the same kind required to bring deck of cards in the initial position? Is there a sequence of perfect shuffles which bring top card to the given position in a deck? The last question is the famous Elmsley’s problem: is there a sequence of perfect shuffles that bring card at the position p to the position q? In this thesis we will also shortly describe group generated by the sequence of perfect shuffles and mention some applications of the concept of perfect shuffling.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:126:944292
Study programmeTitle: Matematika
Study programme type: sveučilišni
Study level: preddiplomski
Academic / professional title: sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike (sveučilišni/a prvostupnik/prvostupnica (baccalaureus/baccalaurea) matematike)
Type of resourceText
File originBorn digital
Access conditionsOpen access
Terms of usehttp://rightsstatements.org/vocab/InC/1.0/
Created on2018-10-17 06:03:44