November 28, Western Washington University. Ramanujan s Congruences. Bryan Clark, Lesley Lowery, Nhan Nguyen. Introduction. History.
|
|
- Myles French
- 5 years ago
- Views:
Transcription
1 Western Washington University November 28, 2012
2 Srinivasa Ramanujan Srinivasa Ramanujan (22 December April 1920)
3 Srinivasa Ramanujan Considered to have no formal training in pure mathematics
4 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College
5 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy
6 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy Known for
7 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy Known for Landau - Ramanujan constant lim x N(x) ln(x) x
8 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy Known for Landau - Ramanujan constant N(x) ln(x) lim x x Ramanujan theta function f (a, b) = a n(n+1)/2 b n(n 1)/2 n=
9 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy Known for Landau - Ramanujan constant N(x) ln(x) lim x x Ramanujan theta function f (a, b) = a n(n+1)/2 b n(n 1)/2 n= Rogers - Ramanujan identities
10 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy Known for Landau - Ramanujan constant N(x) ln(x) lim x x Ramanujan theta function f (a, b) = a n(n+1)/2 b n(n 1)/2 n= Rogers - Ramanujan identities Ramanujan conjecture
11 Srinivasa Ramanujan Considered to have no formal training in pure mathematics Education Government Arts College Pachaiyappa s College Influenced by G. H. Hardy Known for Landau - Ramanujan constant N(x) ln(x) lim x x Ramanujan theta function f (a, b) = a n(n+1)/2 b n(n 1)/2 n= Rogers - Ramanujan identities Ramanujan conjecture q sum c q (n) = a=1 (a,q)=1 e 2πi a q n
12 The of - Ramanujan first postulates his congruences, inspired when he examined a table of the values of p(n) for values of n from 1 to 200.
13 The of - Ramanujan first postulates his congruences, inspired when he examined a table of the values of p(n) for values of n from 1 to 200. of mod 5, mod 7 congruences Uses Theta functions, f (a, b) = a n(n+1)/2 b n(n 1)/2, n= to sketch proofs of the congruences: p(25n 1) 0 (mod 25) p(49n 2) 0 (mod 49).
14 The of - After death in 1920, G. H. Hardy edits and publishes one of manuscripts which contains new proofs.
15 The of - After death in 1920, G. H. Hardy edits and publishes one of manuscripts which contains new proofs. First published proof of the mod 11 congruence s make use of Eisenstein series
16 Statement of the Theorem Theorem Let n N then p(5n + 4) 0 (mod 5)
17 . We are looking for p(5n + 4) so we are interested in [z 5n+4] p(n)z n n 0 So it suffices to look at [z ( ) 5n] z i 1 (1 zi ) (*)
18 Continued. To get at star, look at 3 z i 1(1 z i ) (1 z i ) i 1 Through some algebra we find that this equals: ( 1) r+s r(r+1) 1+ + (2r + 1)z s(3s+1) 2 2 ( ) r 0 s Z
19 Continued. If the exponent of ( ) is a multiple of 5 We see that Therefore 1 + r(r + 1) 2 + s(3s + 1) 2 0 (mod 5) (2r + 1) 2 + 2(s + 1) 2 0 (mod 5) (2r + 1) 0 (mod 5)
20 Continued. From the last slide [z 5n ] z i 1(1 z i ) 0 (mod 5) (**)
21 Continued. To get ( ) let s now consider [z 5n] We multiply by 1, [z 5n] z i 1 (1 zi ) (1 z 5i ). 4 z i 1(1 z i ) i 1 i 1 (1 z5i ) ( i 1 ((1 zi ) 5. )
22 Continued. By binomial expansion (1 z i ) 5 (1 z 5i ) (mod 5) z i 1(1 i ) 5 (1 z 5i ) (mod 5) i 1 i 1 (1 z5i ) i 1 (1 1 (mod 5). ( ) zi ) 5
23 Continued. From ( ) and ( ) we have [z 5n] 4 z i 1(1 z i ) [z 5n] i 1 (1 z5i ) ( i 1 ((1 zi ) 5 0 (mod 5) ) z i 1 (1 zi ) (1 z 5i ) 0 (mod 5) i 1
24 Continued. Finally [z ( ) 5n] z i 1 (1 zi ) (*)
25 (mod 7) Case Theorem Let n N then p(7n + 5) 0 (mod 7)
26 . Similar to the (mod 5) proof
27 (mod 11) Case Theorem Let n N then p(11n + 6) 0 (mod 11)
28 We will show that the style of proof used to prove the (mod 5) and the (mod 7) cases will not work for the (mod 11) case.
29 We will show that the style of proof used to prove the (mod 5) and the (mod 7) cases will not work for the (mod 11) case.
30 Attempt. We are looking for p(11n + 6) so we are interested in [z 11n+6] p(n)z n n 0 It would be sufficient to look at [z ( 11n] z 5 ) i 1 (1 zi ) ( )
31 Continued. To get at, look at z 5 9 i 1(1 z i ) (1 z i ) i 1 Through some algebra we find that this equals: ( 1) r+s+t+u (2r + 1)(2s + 1)(2t + 1)z α Where α = 5 + r(r+1)+s(s+1)+t(t+1)+u(3u+1) 2 The summations extending form 0 < r <, 0 < s <, 0 < t <, and u Z ( )
32 continued. If the exponent of ( ) is a multiple of r(r + 1) 2 We see that + s(s + 1) 2 + t(t + 1) 2 + u(3u + 1) 2 0 (mod 11) (2r + 1) 2 + (2s + 1) 2 + (2t + 1) 2 + (u + 2) 2 0 (mod 11)
33 continued. (2r + 1) 2 0, 1, 3, 4, 5, 9 (mod 11) (2s + 1) 2 0, 1, 3, 4, 5, 9 (mod 11) (2t + 1) 2 0, 1, 3, 4, 5, 9 (mod 11) (u + 2) 2 0, 1, 3, 4, 5, 9 (mod 11) This implies that there are multiple ways to make (2r + 1) 2 + (2s + 1) 2 + (2t + 1) 2 + (u + 2) 2 0 (mod 11) thus we can not proceed with this style of proof.
34
35 New Directions: Dyson - Freeman Dyson, then an undergraduate at Cambridge, looks for a combinatorial proof of the congruences. To do this, he defines the rank r of a partition π as follows: Let l(π) be the largest part of π. Let ν(π) be the number of parts of π. Then r(π) := l(π) ν(π).
36 New Directions: Dyson - Freeman Dyson, then an undergraduate at Cambridge, looks for a combinatorial proof of the congruences. To do this, he defines the rank r of a partition π as follows: Let l(π) be the largest part of π. Let ν(π) be the number of parts of π. Then r(π) := l(π) ν(π). Rank can be easily visualized using Ferrers Diagrams.
37 New Directions: Dyson Dyson also comes up with generating functions related to the rank, by defining N(m, n) as the number of partitions of n with rank m, and N(m, q, n) as the number of partitions of n with a rank congruent to m (mod q).
38 New Directions: Dyson Dyson also comes up with generating functions related to the rank, by defining N(m, n) as the number of partitions of n with rank m, and N(m, q, n) as the number of partitions of n with a rank congruent to m (mod q). Dyson claims that for n = 5k + 4, N(0, 5, 5k + 4) = N(1, 5, 5k + 4) = N(2, 5, 5k + 4) = N(3, 5, 5k + 4) = N(4, 5, 5k + 4) = p(5k + 4), 5 and that a similar relationship exists for the mod 7 congruence.
39 New Directions: Dyson Dyson also comes up with generating functions related to the rank, by defining N(m, n) as the number of partitions of n with rank m, and N(m, q, n) as the number of partitions of n with a rank congruent to m (mod q). Dyson claims that for n = 5k + 4, N(0, 5, 5k + 4) = N(1, 5, 5k + 4) = N(2, 5, 5k + 4) = N(3, 5, 5k + 4) = N(4, 5, 5k + 4) = p(5k + 4), 5 and that a similar relationship exists for the mod 7 congruence. He creates tables of calculated values to back up his claims, but does not provide a proof.
40 Let n = 4. n = 5(0) + 4. The partitions of n are:
41 Let n = 4. n = 5(0) + 4. The partitions of n are: : r(π) = 3 2 (mod 5) : r(π) = 1 4 (mod 5) : r(π) = 0 0 (mod 5) : r(π) = 1 1 (mod 5) 4 : r(π) = 3 3 (mod 5)
42 Let n = 4. n = 5(0) + 4. The partitions of n are: : r(π) = 3 2 (mod 5) : r(π) = 1 4 (mod 5) : r(π) = 0 0 (mod 5) : r(π) = 1 1 (mod 5) 4 : r(π) = 3 3 (mod 5) We have one partition in each group, modulo 5! Great!
43 Let n = 4. n = 5(0) + 4. The partitions of n are: : r(π) = 3 2 (mod 5) : r(π) = 1 4 (mod 5) : r(π) = 0 0 (mod 5) : r(π) = 1 1 (mod 5) 4 : r(π) = 3 3 (mod 5) We have one partition in each group, modulo 5! Great! Exercise: Try this with n = 5 = 7(0) + 5.
44 Let n = 6. n = 11(0) + 6. The partitions of n are: : r(π) = 5 6 (mod 11) : r(π) = 3 8 (mod 11) : r(π) = 2 9 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 0 0 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 2 2 (mod 11) : r(π) = 3 3 (mod 11) 6 : r(π) = 5 5 (mod 11)
45 Let n = 6. n = 11(0) + 6. The partitions of n are: : r(π) = 5 6 (mod 11) : r(π) = 3 8 (mod 11) : r(π) = 2 9 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 0 0 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 2 2 (mod 11) : r(π) = 3 3 (mod 11) 6 : r(π) = 5 5 (mod 11)
46 Let n = 6. n = 11(0) + 6. The partitions of n are: : r(π) = 5 6 (mod 11) : r(π) = 3 8 (mod 11) : r(π) = 2 9 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 0 0 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 2 2 (mod 11) : r(π) = 3 3 (mod 11) 6 : r(π) = 5 5 (mod 11)
47 Let n = 6. n = 11(0) + 6. The partitions of n are: : r(π) = 5 6 (mod 11) : r(π) = 3 8 (mod 11) : r(π) = 2 9 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 1 10 (mod 11) : r(π) = 0 0 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 1 1 (mod 11) : r(π) = 2 2 (mod 11) : r(π) = 3 3 (mod 11) 6 : r(π) = 5 5 (mod 11) So rank doesn t give us 11 equal groupings!
48
49 New Directions: Dyson Once again, the mod 11 case proves to be difficult!
50 New Directions: Dyson Once again, the mod 11 case proves to be difficult! Dyson postulates that some other statistic of a partition exists that will divide the 5k + 4, 7k + 5, and 11k + 6 partitions into equally-sized classes, and thus prove the congruences combinatorially. He names this statistic the crank, since he believes it is similar to the rank.
51 New Directions: Dyson Once again, the mod 11 case proves to be difficult! Dyson postulates that some other statistic of a partition exists that will divide the 5k + 4, 7k + 5, and 11k + 6 partitions into equally-sized classes, and thus prove the congruences combinatorially. He names this statistic the crank, since he believes it is similar to the rank. He leaves the finding of the crank, and the proof of his rank postulates to others...
52 New Directions: Atkin, Swinerton-Dyer - A. O. L. Atkin and P. Swinnerton-Dyer prove Dyson s rank postulate for the mod 5 and mod 7 congruences works. Several new congruences and partition identities come from their work.
53 New Directions: Andrews, Garvan - Andrews and Garvan find the elusive crank!
54 New Directions: Andrews, Garvan - Andrews and Garvan find the elusive crank! Crank is similar to rank, as Dyson thought. Crank divides p(5k + 4) into classes, based on its residue mod 5 - just like rank did.
55 New Directions: Andrews, Garvan - Andrews and Garvan find the elusive crank! Crank is similar to rank, as Dyson thought. Crank divides p(5k + 4) into classes, based on its residue mod 5 - just like rank did. Andrews and Garvan prove that by using the crank, the classes of partitions are equal in size - for all three congruences!
56 Crank definition Let π be a partition of n. Let l(π) be the largest part of π. Let ω(π) be the number of ones in π. Let µ(π) be the number of parts of (π) which are > ω(π).
57 Crank definition Let π be a partition of n. Let l(π) be the largest part of π. Let ω(π) be the number of ones in π. Let µ(π) be the number of parts of (π) which are > ω(π). Then the crank is defined as { l(π), if ω(π) = 0 c(π) = µ(π) ω(π), if ω(π) > 0
58 Let n = 4. n = 5(0) + 4. The partitions of n are:
59 Let n = 4. n = 5(0) + 4. The partitions of n are: : c(π) = 4 1 (mod 5) : c(π) = 2 3 (mod 5) : c(π) = 2 2 (mod 5) : c(π) = 0 0 (mod 5) 4 : c(π) = 4 4 (mod 5)
60 Let n = 4. n = 5(0) + 4. The partitions of n are: : c(π) = 4 1 (mod 5) : c(π) = 2 3 (mod 5) : c(π) = 2 2 (mod 5) : c(π) = 0 0 (mod 5) 4 : c(π) = 4 4 (mod 5) So crank gives us one partition in each group, modulo 5, just like rank did. So far, so good.
61 Let n = 4. n = 5(0) + 4. The partitions of n are: : c(π) = 4 1 (mod 5) : c(π) = 2 3 (mod 5) : c(π) = 2 2 (mod 5) : c(π) = 0 0 (mod 5) 4 : c(π) = 4 4 (mod 5) So crank gives us one partition in each group, modulo 5, just like rank did. So far, so good. Exercise: Try this with n = 5 = 7(0) + 5.
62 Let n = 6. n = 11(0) + 6. The partitions of n are: : c(π) = 6 5 (mod 11) : c(π) = 4 7 (mod 11) : c(π) = 2 9 (mod 11) : c(π) = 2 2 (mod 11) : c(π) = 3 8 (mod 11) : c(π) = 1 1 (mod 11) : c(π) = 3 3 (mod 11) : c(π) = 1 10 (mod 11) : c(π) = 4 4 (mod 11) : c(π) = 0 0 (mod 11) 6 : c(π) = 6 6 (mod 11)
63 Let n = 6. n = 11(0) + 6. The partitions of n are: : c(π) = 6 5 (mod 11) : c(π) = 4 7 (mod 11) : c(π) = 2 9 (mod 11) : c(π) = 2 2 (mod 11) : c(π) = 3 8 (mod 11) : c(π) = 1 1 (mod 11) : c(π) = 3 3 (mod 11) : c(π) = 1 10 (mod 11) : c(π) = 4 4 (mod 11) : c(π) = 0 0 (mod 11) 6 : c(π) = 6 6 (mod 11) So crank works for the troublesome mod 11 congruence!
64 Q : Why do motorcycle gang members use their motorcycles to get to work?
65 Q : Why do motorcycle gang members use their motorcycles to get to work? A : Because members of cyclical groups commute.
66 for listening. Thanks for a fun quarter, Stephanie!! Have a great break.
67 Aigner, Martin. A Course in enumeration. Berlin: Springer, Andrews, George E., and Garvan, F. G., Dyson s crank of a partition. Bulletin of the AMS., 18 (April 1988), no. 2, Atkin, A.O.L. and Swinnerton-Dyer, P., Some properties of partitions. Proc. London Math. Soc., (3) 4 (), F. J. Dyson, Some guesses in the theory of partitions. Eureka (Cambridge). 8 (), Ramanujan, Srinivasa, Congruence properties of partitions. In Collected Papers of Srinivasa Ramanujan. G. H. Hardy, P.V. Seshu Aiyar, and B. M. Wilson, Eds. Providence, RI: AMS Chelsea, , Some properties of p(n), the number of partitions of n. In Collected Papers of Srinivasa Ramanujan. G. H. Hardy, P.V. Seshu Aiyar, and B. M. Wilson, Eds. Providence, RI: AMS Chelsea, Srinivasa Ramanujan. 20 November 2012, 23:37 UTC. In Wikipedia: The Free Encyclopedia. Wikimedia Foundation Inc. Encyclopedia on-line. Available from ramanujan. Internet. Retrieved 25 November 2012.
50. ON THE EXPANSION OF RAMANUJAN S CONTINUED FRACTION. Dedicated to George E. Andrews on the occasion of his 60th Birthday.
50 ON THE EXPANSION OF RAMANUJAN S CONTINUED FRACTION Dedicated to George E Andrews on the occasion of his 60th Birthday Introduction The continued fraction R( = 1 + 2 3 1+ 1+ 1+ has become known as Ramanujan
More informationCongruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017), Article 17.4.3 Congruences Modulo Small Powers of 3 for Partitions into Odd Designated Summs B. Hemanthkumar Department of Mathematics M. S. Ramaiah
More informationTwo congruences involving 4-cores
Two congruences involving 4-cores ABSTRACT. The goal of this paper is to prove two new congruences involving 4- cores using elementary techniques; namely, if a 4 (n) denotes the number of 4-cores of n,
More informationAn interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,
Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence
More informationSome Fine Combinatorics
Some Fine Combinatorics David P. Little Department of Mathematics Penn State University University Park, PA 16802 Email: dlittle@math.psu.edu August 3, 2009 Dedicated to George Andrews on the occasion
More informationRamanujan-type Congruences for Overpartitions Modulo 5. Nankai University, Tianjin , P. R. China
Ramanujan-type Congruences for Overpartitions Modulo 5 William Y.C. Chen a,b, Lisa H. Sun a,, Rong-Hua Wang a and Li Zhang a a Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.
More informationModular Arithmetic. claserken. July 2016
Modular Arithmetic claserken July 2016 Contents 1 Introduction 2 2 Modular Arithmetic 2 2.1 Modular Arithmetic Terminology.................. 2 2.2 Properties of Modular Arithmetic.................. 2 2.3
More informationApplications of Fermat s Little Theorem and Congruences
Applications of Fermat s Little Theorem and Congruences Definition: Let m be a positive integer. Then integers a and b are congruent modulo m, denoted by a b mod m, if m (a b). Example: 3 1 mod 2, 6 4
More informationCongruence properties of the binary partition function
Congruence properties of the binary partition function 1. Introduction. We denote by b(n) the number of binary partitions of n, that is the number of partitions of n as the sum of powers of 2. As usual,
More informationMATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005
MATH 324 Elementary Number Theory Solutions to Practice Problems for Final Examination Monday August 8, 2005 Deartment of Mathematical and Statistical Sciences University of Alberta Question 1. Find integers
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 10 1 of 17 The order of a number (mod n) Definition
More informationA Study of Relationship Among Goldbach Conjecture, Twin prime and Fibonacci number
A Study of Relationship Among Goldbach Conjecture, Twin and Fibonacci number Chenglian Liu Department of Computer Science, Huizhou University, China chenglianliu@gmailcom May 4, 015 Version 48 1 Abstract
More informationSOLUTIONS TO PROBLEM SET 5. Section 9.1
SOLUTIONS TO PROBLEM SET 5 Section 9.1 Exercise 2. Recall that for (a, m) = 1 we have ord m a divides φ(m). a) We have φ(11) = 10 thus ord 11 3 {1, 2, 5, 10}. We check 3 1 3 (mod 11), 3 2 9 (mod 11), 3
More informationTHE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul LXI, 2015, f.2 THE NUMBER OF PERMUTATIONS WHICH FORM ARITHMETIC PROGRESSIONS MODULO m BY FLORIAN LUCA and AUGUSTINE O.
More informationModular arithmetic Math 2320
Modular arithmetic Math 220 Fix an integer m 2, called the modulus. For any other integer a, we can use the division algorithm to write a = qm + r. The reduction of a modulo m is the remainder r resulting
More informationSolutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00
18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?
More information#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS. Thomas A. Plick
#A3 INTEGERS 17 (2017) A NEW CONSTRAINT ON PERFECT CUBOIDS Thomas A. Plick tomplick@gmail.com Received: 10/5/14, Revised: 9/17/16, Accepted: 1/23/17, Published: 2/13/17 Abstract We show that out of the
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More informationPrimitive Roots. Chapter Orders and Primitive Roots
Chapter 5 Primitive Roots The name primitive root applies to a number a whose powers can be used to represent a reduced residue system modulo n. Primitive roots are therefore generators in that sense,
More informationPractice Midterm 2 Solutions
Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s
More informationThe Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes
The Strong Finiteness of Double Mersenne Primes and the Infinity of Root Mersenne Primes and Near-square Primes of Mersenne Primes Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper
More informationPractice Test (page 201) 1. A. This is not true because 64 has these factors: 1, 2, 4, 8, 16, 32, and 64 So, A is the correct answer.
Practice Test (page 201) 1. A. This is not true because 64 has these factors: 1, 2, 4, 8, 16, 32, and 64 So, A is the correct answer. 2. Expand each product until the trinomial matches the given trinomial.
More informationRESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel
RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined
More informationWarm-Up Up Exercises. 1. Find the value of x. ANSWER 32
Warm-Up Up Exercises 1. Find the value of x. ANSWER 32 2. Write the converse of the following statement. If it is raining, then Josh needs an umbrella. ANSWER If Josh needs an umbrella, then it is raining.
More informationMATH 135 Algebra, Solutions to Assignment 7
MATH 135 Algebra, Solutions to Assignment 7 1: (a Find the smallest non-negative integer x such that x 41 (mod 9. Solution: The smallest such x is the remainder when 41 is divided by 9. We have 41 = 9
More information132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers
132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers arxiv:math/0205206v1 [math.co] 19 May 2002 Eric S. Egge Department of Mathematics Gettysburg College Gettysburg, PA 17325
More informationGoldbach conjecture (1742, june, the 7 th )
Goldbach conjecture (1742, june, the 7 th ) We note P the prime numbers set. P = {p 1 = 2, p 2 = 3, p 3 = 5, p 4 = 7, p 5 = 11,...} remark : 1 P Statement : Each even number greater than 2 is the sum of
More informationAsymptotic Results for the Queen Packing Problem
Asymptotic Results for the Queen Packing Problem Daniel M. Kane March 13, 2017 1 Introduction A classic chess problem is that of placing 8 queens on a standard board so that no two attack each other. This
More informationA tournament problem
Discrete Mathematics 263 (2003) 281 288 www.elsevier.com/locate/disc Note A tournament problem M.H. Eggar Department of Mathematics and Statistics, University of Edinburgh, JCMB, KB, Mayeld Road, Edinburgh
More informationMODULAR ARITHMETIC II: CONGRUENCES AND DIVISION
MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION MATH CIRCLE (BEGINNERS) 02/05/2012 Modular arithmetic. Two whole numbers a and b are said to be congruent modulo n, often written a b (mod n), if they give
More informationQuotients of the Malvenuto-Reutenauer algebra and permutation enumeration
Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration Ira M. Gessel Department of Mathematics Brandeis University Sapienza Università di Roma July 10, 2013 Exponential generating functions
More information18.204: CHIP FIRING GAMES
18.204: CHIP FIRING GAMES ANNE KELLEY Abstract. Chip firing is a one-player game where piles start with an initial number of chips and any pile with at least two chips can send one chip to the piles on
More informationSYMMETRIES OF FIBONACCI POINTS, MOD m
PATRICK FLANAGAN, MARC S. RENAULT, AND JOSH UPDIKE Abstract. Given a modulus m, we examine the set of all points (F i,f i+) Z m where F is the usual Fibonacci sequence. We graph the set in the fundamental
More informationPRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma
PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement
More informationRestricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers
Restricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers arxiv:math/0109219v1 [math.co] 27 Sep 2001 Eric S. Egge Department of Mathematics Gettysburg College 300 North Washington
More informationA theorem on the cores of partitions
A theorem on the cores of partitions Jørn B. Olsson Department of Mathematical Sciences, University of Copenhagen Universitetsparken 5,DK-2100 Copenhagen Ø, Denmark August 9, 2008 Abstract: If s and t
More informationParallel Line Converse Theorems. Key Terms
A Reversed Condition Parallel Line Converse Theorems.5 Learning Goals Key Terms In this lesson, you will: Write parallel line converse conjectures. Prove parallel line converse conjectures. converse Corresponding
More informationMassachusetts Institute of Technology 6.042J/18.062J, Spring 04: Mathematics for Computer Science April 16 Prof. Albert R. Meyer and Dr.
Massachusetts Institute of Technology 6.042J/18.062J, Spring 04: Mathematics for Computer Science April 16 Prof. Albert R. Meyer and Dr. Eric Lehman revised April 16, 2004, 202 minutes Solutions to Quiz
More informationMAT Modular arithmetic and number theory. Modular arithmetic
Modular arithmetic 1 Modular arithmetic may seem like a new and strange concept at first The aim of these notes is to describe it in several different ways, in the hope that you will find at least one
More informationON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey
ON MODULI FOR WHICH THE FIBONACCI SEQUENCE CONTAINS A COMPLETE SYSTEM OF RESIDUES S. A. BURR Belt Telephone Laboratories, Inc., Whippany, New Jersey Shah [1] and Bruckner [2] have considered the problem
More informationGeometry Unit 2 Review Day 1 What to expect on the test:
Geometry Unit 2 Review Day 1 What to expect on the test: Conditional s Converse Inverse Contrapositive Bi-conditional statements Today we are going to do more work with Algebraic Proofs Counterexamples/Instances
More information6. Find an inverse of a modulo m for each of these pairs of relatively prime integers using the method
Exercises Exercises 1. Show that 15 is an inverse of 7 modulo 26. 2. Show that 937 is an inverse of 13 modulo 2436. 3. By inspection (as discussed prior to Example 1), find an inverse of 4 modulo 9. 4.
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationTilings with T and Skew Tetrominoes
Quercus: Linfield Journal of Undergraduate Research Volume 1 Article 3 10-8-2012 Tilings with T and Skew Tetrominoes Cynthia Lester Linfield College Follow this and additional works at: http://digitalcommons.linfield.edu/quercus
More informationLUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS
LUCAS-SIERPIŃSKI AND LUCAS-RIESEL NUMBERS DANIEL BACZKOWSKI, OLAOLU FASORANTI, AND CARRIE E. FINCH Abstract. In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More informationIntroduction to Modular Arithmetic
1 Integers modulo n 1.1 Preliminaries Introduction to Modular Arithmetic Definition 1.1.1 (Equivalence relation). Let R be a relation on the set A. Recall that a relation R is a subset of the cartesian
More informationWeek 1. 1 What Is Combinatorics?
1 What Is Combinatorics? Week 1 The question that what is combinatorics is similar to the question that what is mathematics. If we say that mathematics is about the study of numbers and figures, then combinatorics
More informationON MULTIPLICATIVE SEMIGROUPS OF RESIDUE CLASSES
ON MULTIPLICATIVE SEMIGROUPS OF RESIDUE CLASSES E. T. PARKER1 The set of residue classes, modulo any positive integer, is commutative and associative under the operation of multiplication. The author made
More informationTo be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we. The first (and most delicate) case concerns 2
Quadratic Reciprocity To be able to determine the quadratic character of an arbitrary number mod p (p an odd prime), we need to be able to evaluate q for any prime q. The first (and most delicate) case
More informationNumber Theory. Applications of Congruences. Francis Joseph Campena Mathematics Department De La Salle University-Manila
Number Theory Applications of Congruences Francis Joseph Campena Mathematics Department De La Salle University-Manila Introduction Divisibility Test In this section, we discuss some divisibility rules
More informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
More informationLatin Squares for Elementary and Middle Grades
Latin Squares for Elementary and Middle Grades Yul Inn Fun Math Club email: Yul.Inn@FunMathClub.com web: www.funmathclub.com Abstract: A Latin square is a simple combinatorial object that arises in many
More informationPermutation group and determinants. (Dated: September 19, 2018)
Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter
More informationALGEBRA: Chapter I: QUESTION BANK
1 ALGEBRA: Chapter I: QUESTION BANK Elements of Number Theory Congruence One mark questions: 1 Define divisibility 2 If a b then prove that a kb k Z 3 If a b b c then PT a/c 4 If a b are two non zero integers
More informationMultiple : The product of a given whole number and another whole number. For example, some multiples of 3 are 3, 6, 9, and 12.
1.1 Factor (divisor): One of two or more whole numbers that are multiplied to get a product. For example, 1, 2, 3, 4, 6, and 12 are factors of 12 1 x 12 = 12 2 x 6 = 12 3 x 4 = 12 Factors are also called
More informationPower = 36² mod 99 Power = 9 5 a 5 = 0 x = 81 Power = 9² mod 99 Power = 81 6 a 6 = 1 x = 81 x 81 mod 99 x = 27 7 a 7 = 1 x = 27 x 27 mod 99 x = 36
Question 1 Section 4.1 11. What time does a 12-hour clock read a) 80 hours after it reads 11:00? b) 40 hours before it reads 12:00? c) 100 hours after it reads 6:00? I don't really understand this question
More informationCarmen s Core Concepts (Math 135)
Carmen s Core Concepts (Math 135) Carmen Bruni University of Waterloo Week 7 1 Congruence Definition 2 Congruence is an Equivalence Relation (CER) 3 Properties of Congruence (PC) 4 Example 5 Congruences
More information2.1 inductive reasoning and conjecture ink.notebook. September 07, Page 55. Ch 2. Reasoning. Page 56. and Proofs. 2.1 Inductive.
2.1 inductive reasoning and conjecture ink.notebook Page 55 Ch 2 Reasoning and Proofs Page 56 2.1 Inductive Reasoning Lesson Objectives Page 57 Standards Lesson Notes Page 58 2.1 Inductive Reasoning and
More informationGoldbach Conjecture (7 th june 1742)
Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition
More informationSquare Involutions. Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini Siena, Italy
3 47 6 3 Journal of Integer Sequences, Vol. 4 (0), Article.3.5 Square Involutions Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini 44 5300 Siena,
More informationThe number of mates of latin squares of sizes 7 and 8
The number of mates of latin squares of sizes 7 and 8 Megan Bryant James Figler Roger Garcia Carl Mummert Yudishthisir Singh Working draft not for distribution December 17, 2012 Abstract We study the number
More informationThe Unreasonably Beautiful World of Numbers
The Unreasonably Beautiful World of Numbers Sunil K. Chebolu Illinois State University Presentation for Math Club, March 3rd, 2010 1/28 Sunil Chebolu The Unreasonably Beautiful World of Numbers Why are
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationName: Date: Chapter 2 Quiz Geometry. Multiple Choice Identify the choice that best completes the statement or answers the question.
Name: Date: Chapter 2 Quiz Geometry Multiple Choice Identify the choice that best completes the statement or answers the question. 1. What is the value of x? Identify the missing justifications.,, and.
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationRational Points On Elliptic Curves - Solutions. (i) Throughout, we ve been looking at elliptic curves in the general form. y 2 = x 3 + Ax + B
Rational Points On Elliptic Curves - Solutions (Send corrections to cbruni@uwaterloo.ca) (i) Throughout, we ve been looking at elliptic curves in the general form y 2 = x 3 + Ax + B However we did claim
More informationNUMBER THEORY AMIN WITNO
NUMBER THEORY AMIN WITNO.. w w w. w i t n o. c o m Number Theory Outlines and Problem Sets Amin Witno Preface These notes are mere outlines for the course Math 313 given at Philadelphia
More informationSolutions for the 2nd Practice Midterm
Solutions for the 2nd Practice Midterm 1. (a) Use the Euclidean Algorithm to find the greatest common divisor of 44 and 17. The Euclidean Algorithm yields: 44 = 2 17 + 10 17 = 1 10 + 7 10 = 1 7 + 3 7 =
More informationOn repdigits as product of consecutive Fibonacci numbers 1
Rend. Istit. Mat. Univ. Trieste Volume 44 (2012), 33 37 On repdigits as product of consecutive Fibonacci numbers 1 Diego Marques and Alain Togbé Abstract. Let (F n ) n 0 be the Fibonacci sequence. In 2000,
More informationUniversity of British Columbia. Math 312, Midterm, 6th of June 2017
University of British Columbia Math 312, Midterm, 6th of June 2017 Name (please be legible) Signature Student number Duration: 90 minutes INSTRUCTIONS This test has 7 problems for a total of 100 points.
More informationNumbers (8A) Young Won Lim 6/21/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationReceived: 10/24/14, Revised: 12/8/14, Accepted: 4/11/15, Published: 5/8/15
#G3 INTEGERS 15 (2015) PARTIZAN KAYLES AND MISÈRE INVERTIBILITY Rebecca Milley Computational Mathematics, Grenfell Campus, Memorial University of Newfoundland, Corner Brook, Newfoundland, Canada rmilley@grenfell.mun.ca
More informationArithmetic Properties of Combinatorial Quantities
A tal given at the National Center for Theoretical Sciences (Hsinchu, Taiwan; August 4, 2010 Arithmetic Properties of Combinatorial Quantities Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China
More informationNumbers (8A) Young Won Lim 5/24/17
Numbers (8A Copyright (c 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationPrinciple of Inclusion-Exclusion Notes
Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.
More informationIs 1 a Square Modulo p? Is 2?
Chater 21 Is 1 a Square Modulo? Is 2? In the revious chater we took various rimes and looked at the a s that were quadratic residues and the a s that were nonresidues. For examle, we made a table of squares
More informationGenerating trees and pattern avoidance in alternating permutations
Generating trees and pattern avoidance in alternating permutations Joel Brewster Lewis Massachusetts Institute of Technology jblewis@math.mit.edu Submitted: Aug 6, 2011; Accepted: Jan 10, 2012; Published:
More informationPRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES. Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania
#A52 INTEGERS 17 (2017) PRIMES IN SHIFTED SUMS OF LUCAS SEQUENCES Lenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania lkjone@ship.edu Lawrence Somer Department of
More informationTopics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
More informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
More information14th Bay Area Mathematical Olympiad. BAMO Exam. February 28, Problems with Solutions
14th Bay Area Mathematical Olympiad BAMO Exam February 28, 2012 Problems with Solutions 1 Hugo plays a game: he places a chess piece on the top left square of a 20 20 chessboard and makes 10 moves with
More informationPartizan Kayles and Misère Invertibility
Partizan Kayles and Misère Invertibility arxiv:1309.1631v1 [math.co] 6 Sep 2013 Rebecca Milley Grenfell Campus Memorial University of Newfoundland Corner Brook, NL, Canada May 11, 2014 Abstract The impartial
More informationSolutions to Exercises Chapter 6: Latin squares and SDRs
Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,
More informationREU 2006 Discrete Math Lecture 3
REU 006 Discrete Math Lecture 3 Instructor: László Babai Scribe: Elizabeth Beazley Editors: Eliana Zoque and Elizabeth Beazley NOT PROOFREAD - CONTAINS ERRORS June 6, 006. Last updated June 7, 006 at :4
More informationNumber Theory. Konkreetne Matemaatika
ITT9131 Number Theory Konkreetne Matemaatika Chapter Four Divisibility Primes Prime examples Factorial Factors Relative primality `MOD': the Congruence Relation Independent Residues Additional Applications
More informationPROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES
PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES MARK SHATTUCK AND TAMÁS WALDHAUSER Abstract. We give combinatorial proofs for some identities involving binomial sums that have no closed
More information2 Reasoning and Proof
www.ck12.org CHAPTER 2 Reasoning and Proof Chapter Outline 2.1 INDUCTIVE REASONING 2.2 CONDITIONAL STATEMENTS 2.3 DEDUCTIVE REASONING 2.4 ALGEBRAIC AND CONGRUENCE PROPERTIES 2.5 PROOFS ABOUT ANGLE PAIRS
More information2Reasoning and Proof. Prerequisite Skills. Before VOCABULARY CHECK SKILLS AND ALGEBRA CHECK
2Reasoning and Proof 2.1 Use Inductive Reasoning 2.2 Analyze Conditional Statements 2.3 Apply Deductive Reasoning 2.4 Use Postulates and Diagrams 2.5 Reason Using Properties from Algebra 2.6 Prove Statements
More informationIntroduction. and Z r1 Z rn. This lecture aims to provide techniques. CRT during the decription process in RSA is explained.
THE CHINESE REMAINDER THEOREM INTRODUCED IN A GENERAL KONTEXT Introduction The rst Chinese problem in indeterminate analysis is encountered in a book written by the Chinese mathematician Sun Tzi. The problem
More informationCorners in Tree Like Tableaux
Corners in Tree Like Tableaux Pawe l Hitczenko Department of Mathematics Drexel University Philadelphia, PA, U.S.A. phitczenko@math.drexel.edu Amanda Lohss Department of Mathematics Drexel University Philadelphia,
More informationAn improvement to the Gilbert-Varshamov bound for permutation codes
An improvement to the Gilbert-Varshamov bound for permutation codes Yiting Yang Department of Mathematics Tongji University Joint work with Fei Gao and Gennian Ge May 11, 2013 Outline Outline 1 Introduction
More information8.2 Slippery Slopes. A Solidify Understanding Task
7 8.2 Slippery Slopes A Solidify Understanding Task CC BY https://flic.kr/p/kfus4x While working on Is It Right? in the previous module you looked at several examples that lead to the conclusion that the
More informationarxiv: v1 [math.co] 30 Nov 2017
A NOTE ON 3-FREE PERMUTATIONS arxiv:1712.00105v1 [math.co] 30 Nov 2017 Bill Correll, Jr. MDA Information Systems LLC, Ann Arbor, MI, USA william.correll@mdaus.com Randy W. Ho Garmin International, Chandler,
More informationMATH302: Mathematics & Computing Permutation Puzzles: A Mathematical Perspective
COURSE OUTLINE Fall 2016 MATH302: Mathematics & Computing Permutation Puzzles: A Mathematical Perspective General information Course: MATH302: Mathematics & Computing Permutation Puzzles: A Mathematical
More informationNumber Theory and Security in the Digital Age
Number Theory and Security in the Digital Age Lola Thompson Ross Program July 21, 2010 Lola Thompson (Ross Program) Number Theory and Security in the Digital Age July 21, 2010 1 / 37 Introduction I have
More informationPublic Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014
7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical
More information