Download presentation

Presentation is loading. Please wait.

Published byAlan Harper Modified about 1 year ago

1
March 2014

2
PATTERNS vs INVARIANTS

3
142857

4
2 × =

5
× = × =

6
× = × = × =

7
× = × = × = × =

8
× = × = × = × = × =

9
× = × = × = × = × = × =

10

11
Black Holes Give me any whole number (# of even digits)(# of odd digits)(total number of digits) Repeat process For Example:

12

13
WHY ?

14
ooe –––> 123 oeo –––> 123 eoo –––> 123 eee –––> 303 –––> 123

15
→ 7512 → 134 → 123

16
Take any 3-digit number. Rearrange it: Largest – Smallest 674: 764 – 467 = : 330 – 033 = : 972 – 279 = : 963 – 369 = : 954 – 459 = 495

17
738 873 – 378 = – 459 = 512 – 125 = – 369 = – 459 = 321 – 123 = – 189 = – 279 = – 369 = – 459 = 495

18
1.What is so special about 495? 2.Is there any 3–digit number does not fall into this black hole? 3.Is there an upper limit of number of steps to get to this black hole? 4.Is there any type of numbers require more steps than other types? 5.Is there a black hole for 2–digit numbers?

19
What about 4-digit numbers? What about 5-digit numbers? What about 6-digit numbers? Is there a pattern?

20
Take 2–digit numbers. 87: 87 – 78 = 9 90: 90 – 09 = – 18 = – 36 = – 27 = – 45 = 9 80: 80 – 08 = – 27 = – 45 = 9

21
Is “9” a Black Hole? Is there any other Black Hole for 2–digit numbers? Which 2–digit number takes the longest to reach the Black Hole?

22
What about 4–digit numbers? 2341: 4321 – 1234 = – 0378 = – 2358 = – 1467 = 6174 Is 6174 the Black Hole for 4–digit numbers?

23
What about 5–digit numbers? 12345: – = – = – = – = – = – = Is the Black Hole for 5–digit numbers?

24
Try : – = – = – = – = – = – = – = – = What happened? No Black Hole for 5–digit numbers?

25
22220: – = – = – = – = – = – = – = – = – = However, is different from Could it be that 5–digit numbers have more than one Black Holes?

26
What about 6–digit, 7–digit, …, n–digit numbers?

27
…

28
…

29
…

30
… … … … …

31
… … … … … … … … …

32
Can you generalize this process and extend it? Is it same true for 5 th power or 6 th power or nth power?

33
Give me any number n. Use the following process: n = odd 3 n +1 n = even n /2

34
Give me any number n. Use the following process: n = odd 3n+1 n = even n/2 n=13…40, 20, 10, 5, 16, 8, 4, 2, 1 n=37…112, 56, 28, 14, 7, 22, 11, 34, 17, 52, 26, 13,…,1 n=101…304, 152, 76, 38, 19, 58, 29, 88, 44, 22, 11,…,1

35
1.Does it always go to 1? 2.In how many steps? 3.What kind of numbers require more step? 4.Is there a maximum number of steps? 5.Is there a pattern to the number of steps required?

36
1 = 0 2 = 1 3 = 7 4 = 2 5 = 5 6 = 8 7 = 16 8 = 3 9 = = 6

37
1 = 011 = 1421 = 6 2 = 112 = 922 = 15 3 = 713 = 923 = ? 4 = 214 = 1724 = 10 5 = 515 = ?25 = ? 6 = 816 = 426 = 10 7 = 1617 = 1227 = ? 8 = 318 = 2028 = 18 9 = 1919 = ?29 = = 620 = 730 = ?

38
199 is a prime Rearrange 199 into 919 (a prime). Rearrange 199 into 991 (a prime). 199 is called a “Permutable” or “Absolute” prime

39
How many permutable primes? 1-digit: 2-digit: 3-digit :

40
1-digit: 4 (2, 3, 5, 7) 2-digit: 9 (11, 13, 17, 31, 37, 71, 73, 79, 97) 5 (11, 13, 17, 37, 79) 3-digit: 8 (113, 131, 199, 311, 337, 733, 919, 991) 3 (113, 199, 337) 19-digit: 1 (R 19 = 11111…111) 23-digit: 1 (R 23 ) 317-digit: 1 (R 317 ) 1031-digit: 1 (R 1031 )

41
Facts about Permutable Primes: 1. Must compose from digits 1, 3, 7, and 9 if it is not 1-digit. 2. There are no permutable primes with number of digits3 < n < 6× except those that are composed all 1’s. (Not Proven) 3. There are no permutable primes with only digit 1 other than what are listed in the previous slide.(Not Proven)

42
Facts about Permutable Primes: 4. No permutable prime exists which contains 3 different numbers of the 4 digits 1, 3, 7, 9. (For example: 731 = 17 × 43) 5. No permutable primes that are composed of 2 or more of each of the 4 digits 1, 3, 7, 9.

43
“Unprimable” Numbers = A composite number that changes any digit and still composite. What is the smallest “unprimable” number? Example: 200

44
For many generations, prime numbers have always had mystical and magical appeals to mathematicians. Dating back to Euclid’s days, he had already proved that there are infinitely many prime numbers. However, from what we had seen before, it is very difficult to prove even some of the simple properties about prime numbers.

45
1.There are infinitely many prime numbers (Proved by Euclid about 2000 years ago). 2.There are infinitely many twin prime numbers (still not yet proved).

46
3.There is always at least one prime number exists between n and 2n where n is a natural number larger than 1. (Proved in 1850 by Chebyshev but he used very difficult and deep mathematics in his proof. However, Erdos, the second most prolific mathematicians in history, used a very simply proof to prove this result when he was a freshman in college.)

47
There are some numbers that are comparable to prime numbers. The great late Indian mathematician Ramanujan had considered some numbers called “highly composite” numbers.

48
Prime numbers have the minimum number of factors…only two…1 and itself. Highly composite numbers have the maximum number of factors.

49
Prime numbers have the minimum number of factors…only two…1 and itself. Highly composite numbers have the maximum number of factors. A composite number is Highly Composite if it has more distinct factors than any composite numbers before it.

50
4 has 3 distinct factors. 6 has 4 distinct factors. 8 has 4 distinct factors. 9 has 3 distinct factors. 10 has 4 distinct factors.

51
4 has 3 distinct factors…. Yes 6 has 4 distinct factors…. Yes 8 has 4 distinct factors…. No 9 has 3 distinct factors…. No 10 has 4 distinct factors…. No

52
What about 12?

53
12 has 6 distinct factors …. Yes What is the next highly composite number?

54
24 has 8 distinct factors …. Yes What is the next highly composite number?

55
36 has 9 distinct factors …. Yes Ramanujan made a list of all highly composite numbers up to 6,746,328,388,800. He examined the highly composite numbers expressed as product of primes.

56
For instance: 4 = = 2 1 x = 2 2 x = 2 3 x = 2 2 x 3 2

57
4 = = 2 1 x = 2 2 x = 2 3 x = 2 2 x 3 2 He discovered that the final exponent of all highly composite numbers, except for 4 and 36, is 1. Also, in the prime factorization of any highly composite number, the first exponent always equals or exceeds the second exponent and the second always equals or exceeds the third, and so on.

58
For example: 332,640 = 2 5 x 3 3 x 5 1 x 7 1 x ,243,200 = 2 6 x 3 3 x 5 2 x 7 1 x 11 1 x ,248,776,129,600 = 2 6 x 3 3 x 5 2 x 7 2 x 11 1 x 13 1 x 17 1 x 19 1 x 23 1 He wrote his thesis on the proof of this to get his college degree from Cambridge.

59
Pythagoras had considered a category of numbers with very interesting properties that are either very difficult to prove or not yet proven….“friendly numbers”.

60
220 and 284

61
Factors of 220 = 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110 with a sum of 284. Factors of 284 = 1, 2, 4, 71, 142 with a sum of 220.

62
This was discovered about 2000 years ago by Greeks. The next pair did not get discovered until 1636 by Fermat. 17,296 and 18,416.

63
The second smallest pair of friendly numbers was not discovered until 1866 by a 16 years old Italian schoolboy and 1210.

64
Now, with the help of some powerful computers, hundreds of pair of friendly numbers had been discovered. Question: Are there infinitely many pairs of friendly numbers existed? Not yet proven.

65
More Patterns. What is so important about n 2 +n+17 ?

66
n 2 +n+17 n= = 19 a prime n= = 23 a prime n= = 29 a prime n= = 37 a prime

67
n= = 47 a prime n= = 59 a prime n= = 73 a prime n= = 89 a prime n= = 107 a prime n= = 127 a prime n= = 149 a prime n= = 173 a prime

68
You may be tempted to think that you have found a formula that produces only prime numbers. n= = 199 a prime n= = 227 a prime n= = 257 a prime n= = 289 a prime??? n= = 323 a prime???

69
Of course, if you use logic plus patterns, you will see that n 2 +n+17 = (17m) 2 +(17m)+17 = = 17(17m 2 +m+1) not a prime when n is a multiple of 17 such as 17m. So 323 = (17)(19)

70
Euler came up with another formula n 2 +n+41. It produces prime numbers from n=1 to 39 but it fails at n = 40 and 41. However, people proved that this formula is actually quite good generating prime numbers under 10 million a respectable 47.5% of the time.

71
28 ÷ 7 = ?

72
28 ÷ 7 = 13

73
13 7 |

74
Check: 13 x

75
Another check by adding:

76
Peasant’s Multiplication 37 × 28 = × 28 = = 1036

77
Why does it work? 28 = = 1× × × × × = = 1× × × × × ×2 0 = × × × × 28 = ( ) × 28 = ( ) × 28 = ) = 1036

78
What is the sum of all three angles of any triangle?

79
180°

80
What is the sum of all four angles of any quadralateral?

81
360°

82
What is the sum of all five angles of any pentagon?

83
540°

84
In general, what is the sum of all n angles of any n-polygon?

85
In general, what is the sum of all n angles of any n-polygon?

86
In general, what is the sum of all n angles of any n-polygon? 180(n–2)°

87
How do you prove that? 180(n–2)°

88
Interior angle vs Exterior angle

89
What is the sum of all three exteror angles of any triangle?

90
What is the sum of all n exterior angles of any n-polygon?

91
New Project: Best way to build a high speed rail train to go from San Francisco to New York.

92
It takes about 42 minutes to go from anywhere to anywhere.

93
Suppose there are 2 points on a plane. Can you find a line that separates these two points? Suppose there are 3 points on a plane. Can you find a line that has the same number of points on either side? Suppose there are 10 points. Suppose there are 11 points.

94
What if there are 2,000,000 points?

95
What if there are 2,000,000 points in 3–space? Can we find a plane that separates them into 2 sets of 1,000,000 each?

96
Monte Hall’s “Let’s Make a Deal” Problem

97
Behind three doors. One of them has a car and each of the other two has a goat. You chose Door #1.

98
If the host asks you if you want to change your mind and switch your choice to another door, would you?

99
If the host opens the other two doors and shows you that there is a goat behind each of these two doors and asks you if you want to change your mind and switch your choice to another door, would you?

100
If the host opens the one of the other two doors and shows you that there is a goat behind that door and asks you if you want to change your mind and switch your choice to another door, would you?

101
Not Switch #1 #2 #3 Outcome CarGoatGoatWin GoatCarGoatLose GoatGoatCarLose Probability of winning = 1/3

102
Switch #1 #2 #3 Outcome CarGoatGoatLose GoatCarGoatWin GoatGoatCarWin Probability of winning = 2/3

103
Another problem. During the old days, when people look up on the sky and see 8 stars lining up on a straight line, they think that special phenomenon must be set up artificially on purpose. The former great astronomer Carl Sagan said that this is really nothing special about it. He pointed out that, actually, if you have looked at larger enough of a sample, that phenomenon of 8 stars lining up happens everywhere. He is actually speaking of a very special topic in mathematics (one which is very popular among math competition problems).

104
Example. Pick any two students here. You may find one boy and one girl. As you keep picking out two students many times and suddenly you see both of the students are of the same sex. You are so amazed about this find that you proclaimed that someone must have done this for a purpose.

105
However, upon examining this, you find that if you widen your pick … picking 3 students at a time, then the phenomenon of having two students of the same gender is nothing special. In fact, every time you do your pick of 3 students, two students of the same gender are among your pick.

106
So picking 3 students at a time is the smallest number of students you can pick to guarantee this phenomenon happened. The first person who formalize this theory and process is Frank Ramsey who died in 1930 at the age of 26. We now called this theory the Ramsey Theory in honor of him. It turns out problems from Ramsey Theory are some of the most difficult problems in mathematics.

107
Here is a classical Ramsey problem. What is the minimum number of guests that need to be invited so that either at least 3 guests will know each other or at least 3 will be mutual strangers?

108
Obviously a party of 3 is not enough.

109
A – B C

110
A party of 4 is also not enough.

111
A – B – C – D

112
A party of 5 is not enough.

113
A – B – D \ / C – E

114
A party of 6 is enough. Either A knows at least three of the other five or A does not know at least three of the other five.

115
/ B Assume A knows B and C and D. A –– C \ D If B–C or C–D or B–D, then either ABC or ACD or ABD know each other. If not, then B, C, and D are total strangers.

116
Assume A does not know B and C and D. If B does not know C or C does not know D or B does not know D, then ABC or ACD or ABD are totally strangers. If B knows C and D and C knows D, BCD know each other. If B knows C and D but C does not know D, then ACD are totally strangers.

117
Another way to prove this is to list and examine all the combinations of relationships between those 6 people. It turns out these are a total of 32,768 possibilities. This brute force method does not provide any insight. Now if we increase the number of 3 persons to 4, brute force method is impossible to do because the large number of possibilities.

118
It has been proved that at least 18 people need to be invited to guarantee at least 4 persons all know each other or all strangers. What about 5? Nobody knows. People think the least number is between 43 and 49. What about 6? People think the least number is between 102 and 165.

119
One of the largest doing with computers to solve math problems occurred in 1993 involving 110 computers running simultaneously to show that the minimum number of guests to invite to a party to guarantee at least 4 mutual friends or at least 5 mutually strangers is 25.

120
π π ≈ …

121
π Pi Day: March 14, :26:53 morning.

122
Facts About π 1.π was calculated to over 10 trillion digits (10 13 ). 2.Record for most number of digits memorized is over 67, π is irrational (1761). 4.π is transcendental (1882). 5.π is NOT normal – all possible sequence of digits appear equally often. That means one can use the digits from π to form random numbers (not proven). 6.A sequence of six consecutive 9’s appeared begins at the 762 nd decimal place (Feynman Point).

123
Facts About π Six 9’s starts at 762. Next six 9’s starts at 193,034. Six 8’s starts at 222,299. Six 0’s starts at 1,699,927. Six 6’s starts at 45,681,781. One 9 – 5 Two 9’s – 44 Three 9’s – 762 Four 9’s – 762 Five 9’s – 762 Six 9’s – 762 Seven 9’s – 1,722,776 Eight 9’s – 36,356,642 Nine 9’s – 564,665,206

124
Joe’s Accomplishments Joe lived over 1550 years ago. Joe calculated < π < Joe used two fractions to approximate π 22/7 = … as coarse ratio 355/113 = … as refined ratio 22/7 was used 2000 years ago by Greek’s Archimedes Archimedes also calculated 223/72 < π < 22/ … < π < … By slight increase to the denominators from 7 and 72 to Joe’s 113, π’s accuracy increases from 2 to 6 decimals

125
What So Good About 355/113? 1. | / – π| < gets 7 decimal accuracy / = / gets only 1 more decimal accuracy than 355/113, but 5,000,000 is so much larger than Any fraction with denominator less than 113 cannot get a better approximation of π. 3. Any fractional approximation of π with denominator less than 1000 cannot get better estimate than 113

126
What So Good About 355/113? 4. Even denominator less than cannot get better estimate than In fact, any denominator less than cannot be better. What so good about 355/113?

127
Why 113 Is So Good? Let us try to find a fraction q/p ≠ 355/113 but gives about the same or better estimate. 0 < 355/113 – π < – < π – q/p < Add – < 355/113 – q/p < 2× |355/113 – q/p| = |(355p–113q)/113p| < 2×

128
Since q/p ≠ 355/113, so |355p – 113q| > 0. But p & q are integers, so |355p–113q| > 1. So, 1/113p ≤ |(355p–113q)/113p| < 2× p > 1/(113×2× ) >

129
In fact, 52163/16604 = … 355/113 = … π = … Using gives us 6 decimal accuracy just like 113 but is more than 100 times larger than 113

130
How Did Joe Get 355/113? It is a mystery since Joe did not write it down or publish it on internet. Let us find one possible way that he could have done it. Remember: We are not trying to get a good estimate for π. We are trying to find a good fraction to estimate π.

131
π = … = 3 + a 1 = 3 + 1/(1/ a 1 ) 1/a 1 = 1/ = … = 7 + a 2 So, π = 3 + a 1 = 3 + 1/(1/ a 1 ) = 3 + 1/(7+a 2 ) ≈ 3 + 1/7 = 22/7

132
1/a 2 = 1/ = …= 15 + a 3 So, π = 3 + 1/(7+(1/(15+a 3 ))) ≈ 3 + 1/(7+1/15) = 333/106 1/a 3 = 1/ = …= 1 + a 4 So, π = 3 + 1/(7+(1/(15+1/(1+a 4 )))) ≈ 3 + 1/(7+1/(15+1)) = 355/113

133
One More Step: 1/a 4 = 1/ = …= a 5 So, π = 3 + 1/(7+(1/(15+1/(1+(292+a 5 ))))) ≈ 3 + 1/(7+1/(15+1/(1+1/292))) = /33102

134
However, /33102 = … and π = … which is 9 decimals accuracy but is almost 300 times larger than 113. Also, 355/113 is easy to remember: 113|355

135
Note that = … =

136
And the Golden Ratio is: = = … =

137
What would be good fractions to approximate and

138
Note that = … = 1, 4/3, 10/7, 24/17, 58/41, 140/99, 338/239, 816/577, …

139
1+1 = 2

140
= … = 1, 3/2, 5/3, 8/5, 13/8, 21/13, 34/21, 55/34, 89/55, …

141
1+1 = 2

142
1729

143
Hardy–Ramanujan Number

144
1729 = =

145
(1)1729 is the smallest natural number that has this property. (2)1729 is a “near–miss” for z n = x n + y n = =

146
Is there a number that can be written as the sum of 4 cubes in at least 10 different ways?

147
It is hard to find such number but it is relatively easy to show that this number exists.

148
Note: There are 1000 cubes that are less than or equal to 1,000,000,000. Is there a number that can be written as the sum of 4 cubes in at least 10 different ways?

149
Order the first thousand cubes as a 1, a 2, a 3, a 4, …, a There are 1000 C 4 = 1000×999×998×997/24 > 40×1,000,000,000 ways to pick out any 4 cubes from this sequence. Any sum of 4 cubes from this sequence cannot exceed 4 ×1,000,000,000. So there are at the most 4,000,000,000 values to choose from by these more than 40,000,000,000 sets of sum of 4 cubes. Therefore, there is at least one value (among these 4,000,000,000) that is equal to 10 or more sets of sum of four cubes.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google