Abstract

Why use magic for teaching combinatory, algorithms and finally informatics basis as tables, control structure, loops and recursive function? Magicians know that once the surprise has worn off, the audience will seek to understand how the trick works. The aim of every teacher is to interest their students, and a magic trick will lead them to ask ‘how?’ and ‘why?’ and ‘how can I create one myself?’ In this article we consider a project I presented in 2009, the subject of which was ‘How many riffle shuffles does exist from a N card deck? Find the composition of each possible riffle shuffle’. The aim of the paper is not only to describe the project scope, the students’ theoretical studies, their approach to this problem and their computer realizations, but also to give ideas for a course or project using pedagogy. That is why only remarkable students’ realizations are shown. In order to complete the given project, the students must answer three steps: the first one is to answer to the following question: “how can I find all possible riffle shuffles with few cards? (for exe*ample 3, 4 or 5 cards) the second one (to go further ) is to answer to the following question “how can I generalize this solution through an algorithm?” the last one (to obtain the results!) is to program the algorithm with a recursive and a non-recursive solution). Each step of the Matlab? solution code is associated with an informatics basis. Whatever the student's professional ambitions, they will be able to see the impact that originality and creativity have when combined with an interest in one’s work. That’s why, two ameliorations of the ‘basic’ algorithm are proposed and a study of the gain thanks to these ameliorations is done. The students know how to “perform” a magic trick for their family and friends thanks to the use of riffle shuffle in Gilbreath’s principles, a trick that they will be able to explain and so enjoy a certain amount of success with. Sharing a mathematical/informatics demonstration is not easy and the fact that they do so means that they will have worked on and understood and are capable of explaining this knowledge. Isn’t this the aim of all teaching?

Highlights

  • I am fascinated by magic and for many years I have used this way of teaching, both in my physics classes and as higher education teacher trainer.In this paper I present all the notions, a brief history of magic and the researchers who have used this art to teach and/ or to research.The aim of the magician is to hide the principles he uses by disguising the trick so that the audience has no way of discovering how it is done; allowing the magic to remain.The teacher can do exactly the opposite: unraveling a magic trick to highlight the principles used!A Brief History of MagicFrom the beginning of time people have feared what they don’t understand, and sought logical explanations for inexplicable phenomena

  • If we take an n card deck, how can we find the composition? It is humanly “impossible” if the number of cards is greater than 7 because the number of different riffle shuffles is: M n 2n n

  • We present alternately 2 improvements of the initial recursive algorithm

Read more

Summary

Introduction

I am fascinated by magic (or rather, conjuring) and for many years I have used this way of teaching, both in my physics classes and as higher education teacher trainer. In this paper I present all the notions, a brief history of magic and the researchers who have used this art to teach and/ or to research. The aim of the magician is to hide the principles he uses (using maths, physics, psychology, sleight of hand, etc.) by disguising the trick so that the audience has no way of discovering how it is done; allowing the magic to remain. The teacher can do exactly the opposite: unraveling a magic trick to highlight the principles used!

A Brief History of Magic
Summary
Findings
Synthesis and Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call