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.