This trick relies on three nice ideas from discrete mathematics: pigeonhole principle 5 pigeons (cards) in 4 holes (suits) means at least two pigeons are.

Slides:



Advertisements
Similar presentations
Probability and Conditional Probability. Probability Four balls What is the probability of choosing the ball in the red box? Since there are four balls.
Advertisements

Combinations Examples
Counting and Gambling Section 4Objectives: Understand how to use the fundamental counting principle to analyze counting problems that occur in gambling.
God Alone.com Advocating the worship of God Alone.
Copyright © 2002 by Radhika Nagpal and Charles E. Leiserson. All rights reserved. October 30, L9-2.1 Mathematics for Computer Science MIT 6.042J/18.062J.
Mock Objects. Unit-testing and TDD are challenging They require some effort to: – Write a test for a small functionality – Refactor production code and.
EXIT NEXT Click one of the buttons below or press the enter key BACKTOPICS Probability The MEnTe Program Math Enrichment through Technology Title V East.
Index Student Activity 1: Questions to familiarise students with the
4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Application: The Pigeonhole Principle Lecture 37 Section 7.3 Wed, Apr 4, 2007.
The Neatest Trick of All Times Terry Schoppenhorst Springfield Southeast High School NCTM Central Region Conference Oklahoma City, OK.
Counting for Fun Lecture 18: Nov 21 (based on slides in MIT 6.042)
NUMBER TRICKS.
16.4 Probability Problems Solved with Combinations.
Math 221 Integrated Learning System Week 2, Lecture 1
Functions, Pigeonhole Principle Lecture 14: Nov 4 A B f( ) =
Discrete Structures Chapter 5 Pigeonhole Principle Nurul Amelina Nasharuddin Multimedia Department.
CSE115/ENGR160 Discrete Mathematics 04/10/12
UNR, MATH/STAT 352, Spring Radar target detection How reliable is the signal on the screen? (Is it a target of a false alarm?)
Laws of Probability What is the probability of throwing a pair of dice and obtaining a 5 or a 7? These are mutually exclusive events. You can’t throw.
VOCABULARY  Deck or pack  Suit  Hearts  Clubs  Diamonds  Spades  Dealer  Shuffle  Pick up  Rank  Draw  Set  Joker  Jack 
7.3 Probabilities when Outcomes are Equally Likely.
Functions A B f( ) =. This Lecture We will define a function formally, and then in the next lecture we will use this concept in counting. We will also.
Probability & Statistics
Fall 2015 COMP 2300 Discrete Structures for Computation
Do Now: Make a tree diagram that shows the number of different objects that can be created. T-shirts: Sizes: S, M, L and T-shirts: Sizes: S, M, L and Type:
Combinations Problems Problem 1: Sometimes we can use several counting techniques in the same problem, such as combinations and the addition principle.
Introduction to Counting Discrete Structures. A Multiplication Principle.
Counting. Product Rule Example Sum Rule Pigeonhole principle If there are more pigeons than pigeonholes, then there must be at least one pigeonhole.
Chapter 11: Counting Methods
Algebra II 10.2: Use Combinations Quiz : Friday, 12/13.
Chapter 10: Counting Methods
Do Now: Review 10.4 Multiple Choice 1.) What does mean? a.) b.) c.) Short Answer 2.) Find the number of arrangements of 3 #’s for a locker with a total.
15.3 Counting Methods: Combinations ©2002 by R. Villar All Rights Reserved.
Elements of Combinatorics (Continuation) 1. Pigeonhole Principle Theorem. If pigeons are placed into pigeonholes and there are more pigeons than pigeonholes,
Homework Homework due now. Reading: relations
Using Videogame Poker to Learn Probability Adam Carberry April 27, 2005   
Review Homework pages Example: Counting the number of heads in 10 coin tosses. 2.2/
5.2 The Pigeonhole Principle
Draw 3 cards without replacement from a standard 52 card deck. What is the probability that: 1.They are all red ? 2.At least one is black ? 3.They are.
Warm Up May 7 1. A card is drawn from a well-shuffled deck of 52 cards. Find the probability that the card is: a) A 7 b) Red c) A red 8 d) A spade e) A.
Lesson Objective: Understand how to make and use Algorithms Learning Outcome: Design your own algorithms and flowcharts. Algorithms and Flowcharts.
PROBABILITY What is the probability of flipping a head? There is a 1 in 2 chance – ½ = 0.5.
Introduction Suppose that a password on a computer system consists of 6, 7, or 8 characters. Each of these characters must be a digit or a letter of the.
L14: Permutations, Combinations and Some Review EECS 203: Discrete Mathematics.
Pigeonhole Principle – Page 1CPTR311 – Discrete Structures CPTR311 Discrete Structures Pigeonhole Principle Reading: Kolman, Section 3.3.
Pigeonhole Principle. If n pigeons fly into m pigeonholes and n > m, then at least one hole must contain two or more pigeons A function from one finite.
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
6/9/2016MATH 106, Section 51 Section 5 Combinations Questions about homework? Submit homework!
Quiz: Draw the unit circle: Include: (1)All “nice” angles in degrees (2) All “nice” angles in radians (3) The (x, y) pairs for each point on the unit circle.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
Probability and statistics - overview Introduction Basics of probability theory Events, probability, different types of probability Random variable, probability.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Example A standard deck of 52 cards has 13 kinds of cards, with four cards of each of kind, one in each of the four suits, hearts, diamonds, spades, and.
Permutations & Combinations
L14: Permutations, Combinations and Some Review
The Pigeonhole Principle
Discrete Structures for Computer Science
Random Sampling Playing cards are our participants
The Pigeonhole Principle
Unit 4 – Combinatorics and Probability Section 4
Chapter 10: Counting Methods
Permutation – The number of ways to ARRANGE ‘n’ items ‘r’ at
The Pigeonhole Principle
Probability Problems Solved with
Section 6.4 Counting and Combinations with Multiple Cases
Applied Combinatorics, 4th Ed. Alan Tucker
Homework Due Friday.
Math is Magic!!!! Everyone pick a number – any number you want!
Presentation transcript:

This trick relies on three nice ideas from discrete mathematics: pigeonhole principle 5 pigeons (cards) in 4 holes (suits) means at least two pigeons are in the same hole - i.e., at least two of same suit. mod arithmetic Arrange cards on 13-position clock. One of the same-suit pair can be used as a base card occurring at most 6 cards before the other card, which is chosen to be the hidden card. permutations There are 6 distinct arrangements of the 3 remaining cards - the one chosen indicates whether to add 1, 2, 3,4, 5, or 6 to the base card. Math Card Coding Mindreading Trick 1. Accomplice leaves room. 2. Audience picks out 5 arbitrary playing cards from deck. 3. Presenter arranges 4 (carefully chosen) face-up, and one face down. 4. Accomplice returns to the room, and announces the face-down card Permutation is fifth possible (123,132,213,231,312,321) +5 Base card gives suit of hidden card, and starting rank on card clock

Idea #1 pigeonhole principle + = at least two of same corollaries: socks others among five cards, at least two have same suit

Using Idea # 1 = Base card gives suit of hidden card. Idea #2: Card Clock (mod arithmetic) +5 Base card also gives starting point on card clock. Now only need to signal ADD 5

Idea #3: permutations There are exactly 6 permutations of 3 objects There are 3 objects to be ordered (3 middle cards) I can order the permutations systematically perm-1, perm-2, perm-3, perm-4, perm-5, perm-6 Depending on which permutation, I can indicate to add 1, 2, 3, 4, 5, or 6, to the base card = +1 = +2 = +3 = +4 = +5 = +6 if first card is the lowest, then add 1 or 2, depending on whether the remaining two cards are in or out of order if first card is the mikddle, then add 3 or 4, depending on whether the remaining two cards are in or out of order if first card is the highest, then add 5 or 6, depending on whether the remaining two cards are in or out of order

Additional Considerations (a)What if two of the three middle cards are the same rank? Answer: Use a natural ordering on suits, with clubs < diamonds < hearts < spades, so that 7D 7H 7C would indicate add 4, for example. (b)What if the base card is J and hidden card is 5? You cant reach 5 from J in 6 or fewer steps. But then this means you can reach J from 5 in 6 or fewer steps. Choose 5 as the base card, J as hidden. This is the job of the main presenter - from the two cards of the same suit chosen, figure out which card should be the base, from which the hidden card can be reached in at most 6 steps. Notes The first page is a summary page that can be printed out for handy reference. The next four pages are useful for a presentation of the trick to an audience. This trick has been around in the recreational mathematics and teacher communities for a while, and I do not know the origin. This presentation prepared by Lenny Pitt,