Download presentation

Presentation is loading. Please wait.

Published byBo Linville Modified over 3 years ago

2
Mathematical Puzzles and Not So Puzzling Mathematics C. L. Liu National Tsing Hua University

3
It all begins with a chessboard

4
Covering a Chessboard 8 8 chessboard 2 1 domino Cover the 8 8 chessboard with thirty-two 2 1 dominoes

5
A Truncated Chessboard 2 1 domino Cover the truncated 8 8 chessboard with thirty-one 2 1 dominoes Truncated 8 8 chessboard

6
Proof of Impossibility 2 1 domino Truncated 8 8 chessboard Impossible to cover the truncated 8 8 chessboard with thirty-one dominoes.

7
Proof of Impossibility Impossible to cover the truncated 8 8 chessboard with thirty-one dominoes. There are thirty-two white squares and thirty black squares. A 2 1 domino always covers a white and a black square.

8
An Algebraic Proof 1 x x 2....................... x 7 y7............y2y1y7............y2y1 (1+x) x i y j (1+y) x i y j (1+x+x 2 +... x 7 ) (1+y+y 2 +... y 7 ) – 1 - x 7 y 7 = (1+x) x i y j + (1+y) x i y j x i y j Impossible ! Let x = -1 y = -1 -2 = 0

9
Modulo-2 Arithmetic 1 2 3 4 5 6 ….. odd even odd even odd even….. oddeven oddevenodd evenoddeven 01 001 110

10
Coloring the Vertices of a Graph vertex edge

11
2 - Colorability A necessary and sufficient condition : No circuit of odd length vertex edge

12
2 - Colorability Necessity : If there is a circuit of odd length, Sufficiency : If there is no circuit of odd length, use the “contagious” coloring algorithm.

13
3 - Colorability The problem of determining whether a graph is 3-colorable is NP-complete. ( At the present time, there is no known efficient algorithm for determining whether a graph is 3-colorable.)

14
4 - Colorability : Planar Graphs All planar graphs are 4-colorable. How to characterize non-planar graphs ? Genus, Thickness, … Kuratowski’s subgraphs

15
A Defective Chessboard Triomino Any 8 8 defective chessboard can be covered with twenty-one triominoes

16
Defective Chessboards Any 2 n 2 n defective chessboard can be covered with 1/3(2 n 2 n -1) triominoes Any 8 8 defective chessboard can be covered with twenty-one triominoes Prove by mathematical induction

17
Principle of Mathematical Induction To show that a statement p (n) is true 1.Basis : Show the statement is true for n = n 0 2.Induction step : Assuming the statement is true for n = k, ( k n 0 ), show the statement is true for n = k + 1

18
Proof by Mathematical Induction Basis : n = 1 Induction step : 2 n+1 2 n Any 2 n 2 n defective chessboard can be covered with 1/3(2 n 2 n -1) triominoes

19
If there are n wise men wearing white hats, then at the n th hour all the n wise men will raise their hands. The Wise Men and the Hats Basis : n =1 At the 1 st hour. The only wise man wearing a white hat will raise his hand. Induction step : Suppose there are n+1 wise men wearing white hats. At the n th hour, no wise man raises his hand. At the n+1 th hour, all n+1 wise men raise their hands. ……

20
Principle of Strong Mathematical Induction To show that a statement p (n) is true 1.Basis : Show the statement is true for n = n 0 2.Induction step : Assuming the statement is true for n = k, ( k n 0 ), show the statement is true for n = k + 1 n 0 n k,

21
Another Hat Problem Design a strategy so that as few men will die as possible. No strategy In the worst case, all men were shot. Strategy 1 In the worst case, half of the men were shot.

22
Another Hat Problem x n x n-1 x n-2 x n-3 ……………… x 1 ……….. x n-1 x n-2 x n-3 ……… x 1 x n-2 x n-3 ……… x 1 x n-1 x n-3 ……… x 1 x n-2

23
Yet, Another Hat Problem A person may say, 0, 1, or P(Pass) Winning : No body is wrong, at least one person is right Losing : One or more is wrong Strategy 1 : Everybody guesses Probability of winning = 1/8 Strategy 2 : First and second person always says P. Third person guesses Probability of winning = 1/2

24
Strategy 3 : observecall 00 01 10 11 1PP01PP0 patterncall 000 001 010 011 100 101 110 111 PP1 P1P 0PP 1PP P0P PP0 000 Probability of winning = 3/4 More people ? Best possible ? Generalization : 7 people, Probability of winning = 7/8 Application of Algebraic Coding Theory

25
A Coin Weighing Problem Twelve coins, possibly one of them is defective ( too heavy or too light ). Use a balance three times to pick out the defective coin.

26
1 2 3 4 5 6 7 8 G 9 10 G G 11 12 G 10 9 Step 1 Step 3 Step 2 Balance Step 3 BalanceImbalance

27
7 G 1 2 3 4 5 6 7 8 1 3 4 5 2 6 Step 1 Step 2 Imbalance Step 3 Balance 2 1 Step 3 Imbalance

28
1 2 3 4 5 6 7 8 1 3 4 5 2 6 Step 1 Step 2 Imbalance 4 3 Step 3 Imbalance

29
Another Coin Weighing Problem Application of Algebraic Coding Theory Adaptive Algorithms Non-adaptive Algorithms Thirteen coins, possibly one of them is defective ( too heavy or too light ). Use a balance three times to pick out the defective coin. However, an additional good coin is available for use as reference.

30
Yet, Another Hat Problem Hats are returned to 10 people at random, what is the probability that no one gets his own hat back ?

31
Apples and Oranges ApplesOranges Oranges Apples Take out one fruit from one box to determine the contents of all three boxes.

32
Derangements ABC abc acb bac bca cab cba

33
Derangement of 10 Objects Number of derangements of n objects Probability

34
Permutation 1234 a b c d Positions Objects

35
Placement of Non-taking Rooks 1234 a b c d Positions Objects

36
Permutation with Forbidden Positions 1234 a b c d Positions Objects 1234 a b c d Positions Objects

37
Placement of Non-taking Rooks 1234 a b c d Positions Objects 1234 a b c d Positions Objects

38
Placement of Non-taking Rooks 1234 a b c d Positions Objects Rook Polynomial : R (C) = r 0 + r 1 x + r 2 x 2 + … r i = number of ways to place i non-taking rooks on chessboard C R (C) = 1 + 6x + 10x 2 + 4x 3

39
At Least One Way to Place Non-taking Rooks 1234 a b c d Positions Objects 1234 a b c d Positions Objects Theory of Matching !

40
Conclusion Mathematics is about finding connections, between specific problems and more general results, and between one concept and another seemingly unrelated concept that really is related.

Similar presentations

OK

The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.

The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on layer 3 switching protocols Ppt on acid-base titration experiment Ppt on review writing assignment Ppt on peak load pricing definition Ppt on stock exchange Ppt on eia reporting Ppt on c language fundamentals emc Ppt on metabolism of drugs Ppt on holographic technology videos Ppt on importance of ict in education