Volume : 2, Issue : 9, SEP 2016

HOW TO TEACH THE COMBINATORY PART OF DIGITAL ELECTRONICS BASIS WITH PROJECT PEDAGOGY ? THANKS TO A SELF-WORKING CARD TRICK NAMED “CYCLIC NUMBER”!

Pierre SCHOTT

Abstract

Why use Magic for teaching digital electronics theory and software? 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? 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. The students know how to “perform” a magic trick for their family and friends, a trick that they will be able to explain and so enjoy a certain amount of success. Sharing
a mathematical / informatics demonstration not easy and that they do so means that they will have worked on understood and are capable of explaining this knowledge. Isn't this the aim of all teaching? In this article I present a self-working magic card trick. Using this card trick to teach a full combinatorial and sequential digital electronic course is actually possible
using project pedagogy or classical top-down method. I present the global study in order to use a project pedagogy, then a part of the synthesis.
In fact, this trick can be used to teach: Binary number system and weighted codes, Transcoders : binary to weighted code, logic minimization using Karnaugh, seven segment displays with the associated encoders and decoders, multiplexers and demultiplexers, an open source software named “Logisim”.

Article : Download PDF

Cite This Article

Article No : 12

Number of Downloads : 672

References

1. Ammar, M. (1998). The Complete Cups & Balls. L&L Publishing.
2. Assaf, S., Soundararajan, K. & Diaconis, P. (2009). Riffle shuffles of a deck with
repeated cards. DMTCS Proceedings, 21st International Conference on Formal Power
Series and Algebraic Combinatorics (pp. 89-102), FPSAC 2009.
3. Boileau, N. (1740). La scolastique. Souchay, Paris.
4. Chardiny, N., Dupin, B. & Grosgeorge, S. (2010). Utiliser les mathématiques pour
créer un tour de Magie utilisant le mélange FARO. Mémoire de P.S.I, ESIEA.
5. Costa Aliago. (1953). The cyclic number 142857. Scripta Mathematica, Vol. 19,
pp181-184.
6. Diaconis, P., Graham, R. L. & Kantor, W.M. (1983). The Mathematics of Perfect Shuffles.
Advances in applied mathematics, Volume 4, pp 175-196..
43 International Educational Scientific Research Journal [IESRJ]
Research Paper E-ISSN No : 2455-295X | Volume : 2 | Issue : 9 | Sep 2016
7. Diaconis, P. (1998). From Shuffling Cards to Walking Around the Building. An Introduction
to Markov Chain Theory. Proc. Int. Congress, Berlin, Volume I, Plenary Lectures,
187-204.
8. Diaconis, P. (2003). Mathematical Developments from the Analysis of Riffle-
Shuffling. In A. Fuanou, M. Liebeck (eds.) Groups Combinatorics and Geometry,
pp.73-97, World Scientific, N.J.
9. Diaconis, P. & Graham, R. L. (2005). The solutions to Elmsley’s Problem. Mathematics
magazine.
10. Elmsley, A. (1957). Mathématics of the weave shuffle. The Pentagram 11, pp.70-71,
pp78-79, pp.85.
11. Erdnase, S. W. (1902). The Expert At The Card Table. Chicago.
12. Gardner, M. (1956). Mathematics, Magic and Mystery. Dover.
13. Gardner, M. (1992). Mathematical Circus. The mathematical association of America,
Washington, DC 1992, pp 111-114
14. Gardner, M. (2005). Martin Gardner's mathematical games : the entire collection of his
scientific American columns. Mathematical Association of America.
15. Gilbreath, N. L. (1958). Magnetic colors. The Linking Ring, Vol. 38, no. 5, page 60,
July 1958.
16. Gilbreath, N. L. (1966). Second Gilbreath Principle. Linking Ring, June 1966.
17. Gilbreath, N. L. (1989). Magic for an Audience. series of 3 articles in Genii, Vol. 52,
No. 9-10-11, March, April, May 1989.
18. Huet, G. (1991). The Gilbreath trick: A case study in axiomatisation and proof development
in the Coq Proof Assistant. Proceedings, Second Workshop on Logical Frameworks,
Edinburgh, May 1991.
19. Lachal, A. (2010). Quelques mélanges parfaits de cartes. Quadrature.
20. Lachal, A. & Schott, P. (2012). Cartomagie : principes de Gilbeath (II) – quelques applications.
Quadrature, Vol. 86, pp31-37
21. Lachal, A. & Schott, P. (2012). Cartomagie : principes de Gilbeath (III) – demonstrations.
Quadrature, Vol. 87.
22. Magid, A. (2005). Notices. American Mathematical Society, March 2005.
23. Mayol, H. (2000). La Magie des cordes Maestro, HBM Production.
24. Poincaré, H. (1912). Calcul des probabilités. Rédaction de A. Quiquet. Deuxième
édition, revue et augmentée par l’auteur, Gauthier-Villars, Paris.
25. Mulcahy, C. (2003). Fitch Cheney's Five Card Trick. Maths Horizon, Volume 10,
AMS, Feb. 2003.
26. Mulcahy, C. (2004). Top 5 Reasons to Like Mathematical Card Tricks. Volume 11,
AMS, Feb. 2004.
27. Mulcahy, C. (2007). An ESPeriment with Cards. Volume 14, AMS, Feb. 2007 .
28. Regnault, D. (1943) Les Calculateurs Prodiges. Payot, Paris, pp336-43.
29. Schott, P. (2009). The use of magic in mathematics: from primary school to higher education.
Proceedings of ICERI2009 Conference, Madrid, Spain, pp58-70, 16th-18th
Nov. 2009.
30. Schott, P. (2010). The Use of Magic in Optics in Higher Education. Creative Education,
Vol. 1, No. 1, pp11-17, June 2010.
31. Schott, P. (2009). How to Introduce the Cyclic Group and Its Properties Representation
with Matlab ? Thanks to Magic Using the Perfect Faro Shuffle. Creative Education,
Vol. 2, No. 1, pp27-40, March 2011.
32. Simon, W. (1964). A slate prediction trick based on 142,857. Mathematical magic,
Scribner’s,pp31-35
33. Sheynin, O. B. (1991). H. Poincaré’s work on probability. Archive for History of Exact
Sciences, Volume 42, Number 2. Springer Berlin.