congruences Shanghai, July 2013 Simple proofs of Ramanujan s partition congruences Michael D. Hirschhorn
|
|
- Jean Hamilton
- 6 years ago
- Views:
Transcription
1 s s m.hirschhorn@unsw.edu.au
2 Let p(n) be the number of s of n. For example, p(4) = 5, since we can write 4 = 4 = 3+1 = 2+2 = = and there are 5 such representations. It was known to Euler that p(n)q n = 1 E(q) s
3 where E(q) = (1 q)(1 q 2 )(1 q 3 ), and by convention, p(0) = 1. Euler also knew that E(q) = 1 q q 2 +q 5 +q 7 q 12 q 15 +q 22 +q = ( 1) n q (3n2 +n)/2. It follows that (1 q q 2 +q 5 +q 7 q 12 q 15 +q 22 +q ) p(n)q n = 1, s from which it follows that for n > 0, p(n) = p(n 1)+p(n 2) p(n 5) p(n 7) +p(n 12)+p(n 15)++.
4 Thus, p(1) = p(0) = 1, p(2) = p(1)+p(0) = 2, p(3) = p(2)+p(1) = 3, p(4) = p(3)+p(2) = 5, and so on. P. MacMahon, in 1917, calculated p(n) for n up to 200, and presented his results thus: Look at the bottom row. Ramanujan did, and made the exciting discovery that p(5n +4) 0 (mod 5). s
5 He also discovered that p(7n+5) 0 (mod 7) and p(11n+6) 0 (mod 11). And these were just the simplest of his conjectures. (There is nothing quite so simple for other primes.) Ramanujan proved these three s, but his proof of the mod 11 is much deeper than his proofs of the mod 5 and mod 7 s. The purpose of this talk is to give simple proofs of all three s. The proofs of the mod 5 and mod 7 s are simpler versions of proofs, and the proof of the mod 11 is new. s
6 2 Two proofs of the mod 5 We start with two well known identities, proofs of which can be found in Hardy & Wright, to the Theory of Numbers, for example. Euler s identity s E = (1 q)(1 q 2 )(1 q 3 ) = 1 q q 2 +q 5 +q 7 q 12 q 15 +q 22 +q = ( 1) n q (3n2 +n)/2 and Jacobi s identity J = E 3 = 1 3q +5q 3 7q 6 +9q 10 11q q 21 15q q 36 19q 45 + = ( 1) n (2n +1)q (n2 +n)/2.
7 First we notice that the exponents in the series for E, namely 0, 1, 2, 5, 7, 12, 15 and so on are all congruent to 0, 1 or 2 modulo 5. So we can write E E 0 +E 1 +E 2, where for i = 0, 1, 2, E i comprises those terms in E in which the exponent is congruent to i (mod 5). Similarly, we notice that, modulo 5, J J 0 +J 1, where J i comprises terms in which the exponent is congruent to i (mod 5), since (n 2 +n)/2 0,1 or 3 (mod 5), but 2n+1 0 (mod 5) precisely when (n 2 +n)/2 3 (mod 5). s
8 Also, it is easy to check that so (1 q) 5 1 q 5 (mod 5) E 5 = (1 q) 5 (1 q 2 ) 5 (1 q 3 ) 5 (1 q 5 )(1 q 10 )(1 q 15 ) = E(q 5 ). So now we have, modulo 5, p(n)q n = 1 E = E4 E 5 E4 E(q 5 ) EJ E(q 5 ) (E 0 +E 1 +E 2 )(J 0 +J 1 ) E(q 5 ) E 0J 0 +E 0 J 1 +E 1 J 0 +E 1 J 1 +E 2 J 0 +E 2 J 1 E(q 5, ) s
9 and if we look for terms in which the exponent is congruent to 4 (mod 5), we find p(5n+4)q 5n+4 0 and the mod 5 is proved! (This is a simplified version of proof.) s
10 An alternative proof using only J goes as follows. Modulo 5, so p(n)q n = 1 E = E9 E 10 = (E3 ) 3 (E 5 ) 2 J3 E(q 5 ) 2 (J 0 +J 1 ) 3 E(q 5 ) 2 J3 0 +3J2 0 J 1 +3J 0 J 2 1 +J3 1 E(q 5 ) 2, p(5n+4)q 5n+4 0. s
11 3 Proof of the mod 7 We have E = E 0 +E 1 +E 2 +E 5, where E i comprises those terms of E in which the exponent is congruent to i (mod 7), and, modulo 7, J J 0 +J 1 +J 3, where J i comprises those terms of J in which the exponent is congruent to i (mod 7). Note that 2n+1 0 (mod 7) whenever (n 2 +n)/2 6 (mod 7). s
12 It follows that, modulo 7, p(n)q n = 1 E = E6 E 7 = (E3 ) 2 E 7 = J2 E 7 (J 0 +J 1 +J 3 ) 2 E(q 7 ) = J2 0 +2J 0J 1 +J J 0J 3 +2J 1 J 3 +J 2 3 E(q 7 ) So if we look for those terms in which the exponent is 5 (mod 7), we find p(7n+5)q 7n+5 0., s
13 4 Proof of the mod 11 We have and, modulo 11, E = E 0 +E 1 +E 2 +E 5 +E 7 +E 15 J J 0 +J 1 +J 3 +J 6 +J 10, since 2n+1 0 (mod 11) whenever (n 2 +n)/2 4 (mod 11). So we have p(n)q n = 1 E = E21 E 22 = (E3 ) 7 (E 11 ) 2 = J7 (E 11 ) 2 J 7 E(q 11 ) 2 (J 0 +J 1 +J 3 +J 6 +J 10 ) 7 E(q 11 ) 2. s
14 If we now extract those terms in which the exponent is congruent to 6 (mod 11), we find p(11n +6)q 11n+6 P E(q 11 ) 2, where P is a polynomial in J 0, J 1, J 3, J 6 and J 10 of degree 7. s
15 Indeed, modulo 11, P 7J0 6 J 6 +10J0 5 J2 3 +J4 0 J 1J 6 J 10 +8J0 3 J3 1 J 3 +2J0 3 J 1J3 2 J 10 +8J0J 3 6J J0J 2 1J 2 3 J6 2 +3J0J 2 1J 2 6 J J0J 2 3J 2 6J J0J 2 3 J 6 J J)0 2 J J 0 J1 6 +J 0 J1J 4 3 J 10 +2J 0 J1J 2 3J J 0 J1J 2 3J J 0 J 1 J 3 J6 4 +2J 0 J 1 J6J J 0 J3J 4 6 J 10 +8J 0 J3 3 J J5 1 J2 6 +2J3 1 J 3J6 2 J 10 +8J1 3 J 6J J2 1 J5 3 +8J 1 J3 3 J3 6 +3J 1J3 2 J2 6 J2 10 +J 1J 3 J 6 J J 1J J6 3 J 10 +7J 3 J J6J We want to show that P 0. s
16 The crucial idea We have J 4 = E 12 = E 11 E E(q 11 )(E 0 +E 1 +E 2 +E 5 +E 7 +E 15 ). That is, (J 0 +J 1 +J 3 +J 6 +J 10 ) 4 E(q 11 )(E 0 +E 1 +E 2 +E 5 +E 7 +E 15 ). If we extract those terms in which the exponents are 3, 6, 8, 9 and 10 (mod 11), we find J 3 0 J 3 +J 0 J J 0J 1 J 3 J 6 +7J 2 1 J2 6 +3J 3J 2 6 J 10 +J 6 J , J 3 0 J 6 +7J 2 0 J2 3 +6J 0J 1 J 6 J 10 +J 3 1 J 3 +3J 1 J 2 3 J 10 +J 3 6 J 10 0, 3J 0 J 2 1J 6 +6J 0 J 3 J 6 J 10 +J 0 J J 2 1J 2 3 +J 1 J 3 6 +J 3 3J 10 0, 3J 2 0J 3 J 6 +7J 2 0J J 0 J J 1 J 3 J 6 J 10 +J 3 1J 6 +J 1 J , J 3 0J 10 +6J 0 J 1 J 3 J 6 +3J 0 J 1 J J 1 J 3 3 +J 3 J J 2 6J s
17 Now we make the observation that P (7J 1 J 3 J 10 +5J0 2 J 3 +7J1 3 ) (J0J 3 3 +J 0 J1 3 +6J 0 J 1 J 3 J 6 +7J1J J 3 J6J J 6 J10) 3 +(7J0 3 +7J 0 J 1 J 10 +5J6J 2 10 ) (J0J J0J J 0 J 1 J 6 J 10 +J1J J 1 J3J J6J 3 10 ) +(7J 0 J 3 J 6 +5J 0 J J3 3 ) (3J 0 J1 2 J 6 +6J 0 J 3 J 6 J 10 +J 0 J J2 1 J2 3 +J 1J6 3 +J3 3 J 10) +(5J1J J 3 J 6 J 10 +7J10) 3 (3J0J 2 3 J 6 +7J0J J 0 J3 3 +6J 1 J 3 J 6 J 10 +J1J 3 6 +J 1 J10) 3 +(7J 0 J 1 J 6 +5J 1 J3 2 +7J6) 3 (J0 3 J 10 +6J 0 J 1 J 3 J 6 +3J 0 J 1 J10 2 +J 1J3 3 +J 3J6 3 +7J2 6 J2 10 ) s and so P 0.
Part II. The power of q. Michael D. Hirschhorn. A course of lectures presented at Wits, July 2014.
m.hirschhorn@unsw.edu.au most n 1(1 q n ) 3 = ( 1) n (2n+1)q (n2 +n)/2. Note that the power on q, (n 2 +n)/2 0, 1 or 3 mod 5. And when (n 2 +n)/2 3 (mod 5), n 2 (mod 5), and then the coefficient, (2n+1)
More informationPartition Congruences in the Spirit of Ramanujan
Partition Congruences in the Spirit of Ramanujan Yezhou Wang School of Mathematical Sciences University of Electronic Science and Technology of China yzwang@uestc.edu.cn Monash Discrete Mathematics Research
More informationRAMANUJAN S MOST BEAUTIFUL IDENTITY
RAMANUJAN S MOST BEAUTIFUL IDENTITY MICHAEL D. HIRSCHHORN Abstract We give a simple proof of the identity which for Hardy represented the best of Ramanujan. On the way, we give a new proof of an important
More informationCongruence Properties of Partition Function
CHAPTER H Congruence Properties of Partition Function Congruence properties of p(n), the number of partitions of n, were first discovered by Ramanujan on examining the table of the first 200 values of
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationCongruences of Restricted Partition Functions
Rose-Hulman Institute of Technology Rose-Hulman Scholar Mathematical Sciences Technical Reports (MSTR) Mathematics 6-2002 Congruences of Restricted Partition Functions Matthew Culek Amanda Knecht Advisors:
More informationArithmetic Relations for Overpartitions
Arithmetic Relations for Overpartitions Michael D. Hirschhorn School of Mathematics, UNSW, Sydney 2052, Australia m.hirschhorn@unsw.edu.au James A. Sellers Department of Mathematics The Pennsylvania State
More informationELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS
Bull Aust Math Soc 81 (2010), 58 63 doi:101017/s0004972709000525 ELEMENTARY PROOFS OF PARITY RESULTS FOR 5-REGULAR PARTITIONS MICHAEL D HIRSCHHORN and JAMES A SELLERS (Received 11 February 2009) Abstract
More informationa = mq + r where 0 r m 1.
8. Euler ϕ-function We have already seen that Z m, the set of equivalence classes of the integers modulo m, is naturally a ring. Now we will start to derive some interesting consequences in number theory.
More informationJacobi s Two-Square Theorem and Related Identities
THE RAMANUJAN JOURNAL 3, 153 158 (1999 c 1999 Kluwer Academic Publishers. Manufactured in The Netherlands. Jacobi s Two-Square Theorem and Related Identities MICHAEL D. HIRSCHHORN School of Mathematics,
More informationMa/CS 6a Class 2: Congruences
Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts
More informationFactoring Algorithms Pollard s p 1 Method. This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors.
Factoring Algorithms Pollard s p 1 Method This method discovers a prime factor p of an integer n whenever p 1 has only small prime factors. Input: n (to factor) and a limit B Output: a proper factor of
More information= i 0. a i q i. (1 aq i ).
SIEVED PARTITIO FUCTIOS AD Q-BIOMIAL COEFFICIETS Fran Garvan* and Dennis Stanton** Abstract. The q-binomial coefficient is a polynomial in q. Given an integer t and a residue class r modulo t, a sieved
More informationElementary Number Theory
Elementary Number Theory 21.8.2013 Overview The course discusses properties of numbers, the most basic mathematical objects. We are going to follow the book: David Burton: Elementary Number Theory What
More informationMa/CS 6a Class 2: Congruences
Ma/CS 6a Class 2: Congruences 1 + 1 5 (mod 3) By Adam Sheffer Reminder: Public Key Cryptography Idea. Use a public key which is used for encryption and a private key used for decryption. Alice encrypts
More informationHomework #2 solutions Due: June 15, 2012
All of the following exercises are based on the material in the handout on integers found on the class website. 1. Find d = gcd(475, 385) and express it as a linear combination of 475 and 385. That is
More informationNumber Theory Math 420 Silverman Exam #1 February 27, 2018
Name: Number Theory Math 420 Silverman Exam #1 February 27, 2018 INSTRUCTIONS Read Carefully Time: 50 minutes There are 5 problems. Write your name neatly at the top of this page. Write your final answer
More information67. An identity of Ramanujan, and applications. Dedicated to Dick Askey on the occasion of his 65th Birthday. 1. Introduction
67 An identity of Ramanujan, and applications Dedicated to Dick Askey on the occasion of his 65th Birthday 1 Introduction The identity of the title is, in modern notation, 1) = q 25 ) Rq 5 ) q q 2 Rq 5
More informationOn the Ordinary and Signed Göllnitz-Gordon Partitions
On the Ordinary and Signed Göllnitz-Gordon Partitions Andrew V. Sills Department of Mathematical Sciences Georgia Southern University Statesboro, Georgia, USA asills@georgiasouthern.edu Version of October
More informationSQUARE PATTERNS AND INFINITUDE OF PRIMES
SQUARE PATTERNS AND INFINITUDE OF PRIMES KEITH CONRAD 1. Introduction Numerical data suggest the following patterns for prime numbers p: 1 mod p p = 2 or p 1 mod 4, 2 mod p p = 2 or p 1, 7 mod 8, 2 mod
More informationINFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS
December 1, 2009 INFINITE FAMILIES OF STRANGE PARTITION CONGRUENCES FOR BROKEN 2-DIAMONDS PETER PAULE AND SILVIU RADU Dedicated to our friend George E. Andrews on the occasion of his 70th birthday Abstract.
More informationDiscrete Logarithms. Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set
Discrete Logarithms Let s begin by recalling the definitions and a theorem. Let m be a given modulus. Then the finite set Z/mZ = {[0], [1],..., [m 1]} = {0, 1,..., m 1} of residue classes modulo m is called
More informationApplications of modular forms to partitions and multipartitions
Applications of modular forms to partitions and multipartitions Holly Swisher Oregon State University October 22, 2009 Goal The goal of this talk is to highlight some applications of the theory of modular
More informationInteger Partitions. Student ID: Tutor: Roman Kotecky\Neil O Connell April 22, 2015
Integer Partitions Student ID: 35929 Tutor: Roman Kotecky\Neil O Connell April 22, 205 My study of Integer partitions came from a particular algebra assignment in which we were asked to find all the isomorphism
More informationRAMANUJAN'S LOST NOTEBOOKIN FIVE VOLUMESS SOME REFLECTIONS
RAMANUJAN'S LOST NOTEBOOK IN FIVE VOLUMES SOME REFLECTIONS PAULE60 COMBINATORICS, SPECIAL FUNCTIONS AND COMPUTER ALGEBRA May 17, 2018 This talk is dedicated to my good friend Peter Paule I. BACKGROUND
More information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
More informationQ 2.0.2: If it s 5:30pm now, what time will it be in 4753 hours? Q 2.0.3: Today is Wednesday. What day of the week will it be in one year from today?
2 Mod math Modular arithmetic is the math you do when you talk about time on a clock. For example, if it s 9 o clock right now, then it ll be 1 o clock in 4 hours. Clearly, 9 + 4 1 in general. But on a
More informationSome congruences for Andrews Paule s broken 2-diamond partitions
Discrete Mathematics 308 (2008) 5735 5741 www.elsevier.com/locate/disc Some congruences for Andrews Paule s broken 2-diamond partitions Song Heng Chan Division of Mathematical Sciences, School of Physical
More informationRamanujan-type congruences for overpartitions modulo 16. Nankai University, Tianjin , P. R. China
Ramanujan-type congruences for overpartitions modulo 16 William Y.C. Chen 1,2, Qing-Hu Hou 2, Lisa H. Sun 1,2 and Li Zhang 1 1 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P.
More informationOn a certain vector crank modulo 7
On a certain vector crank modulo 7 Michael D Hirschhorn School of Mathematics and Statistics University of New South Wales Sydney, NSW, 2052, Australia mhirschhorn@unsweduau Pee Choon Toh Mathematics &
More informationSolving the general quadratic congruence. y 2 Δ (mod p),
Quadratic Congruences Solving the general quadratic congruence ax 2 +bx + c 0 (mod p) for an odd prime p (with (a, p) = 1) is equivalent to solving the simpler congruence y 2 Δ (mod p), where Δ = b 2 4ac
More informationDIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS
DIVISIBILITY AND DISTRIBUTION OF PARTITIONS INTO DISTINCT PARTS JEREMY LOVEJOY Abstract. We study the generating function for (n), the number of partitions of a natural number n into distinct parts. Using
More informationARITHMETIC CONSEQUENCES OF JACOBI S TWO SQUARES THEOREM. Michael D. Hirschhorn (RAMA126-98) Abstract.
ARITHMETIC CONSEQUENCES OF JACOBI S TWO SQUARES THEOREM Michael D. Hirschhorn RAMA126-98) Abstract. There is a well-known formula due to Jacobi for the number r 2 n) of representations of the number n
More informationFermat s Little Theorem. Fermat s little theorem is a statement about primes that nearly characterizes them.
Fermat s Little Theorem Fermat s little theorem is a statement about primes that nearly characterizes them. Theorem: Let p be prime and a be an integer that is not a multiple of p. Then a p 1 1 (mod p).
More informationNumber Theory Homework.
Number Theory Homewor. 1. The Theorems of Fermat, Euler, and Wilson. 1.1. Fermat s Theorem. The following is a special case of a result we have seen earlier, but as it will come up several times in this
More informationDIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (008), #A60 DIVISIBILITY PROPERTIES OF THE 5-REGULAR AND 13-REGULAR PARTITION FUNCTIONS Neil Calkin Department of Mathematical Sciences, Clemson
More informationArithmetic Properties for Ramanujan s φ function
Arithmetic Properties for Ramanujan s φ function Ernest X.W. Xia Jiangsu University ernestxwxia@163.com Nankai University Ernest X.W. Xia (Jiangsu University) Arithmetic Properties for Ramanujan s φ function
More informationA PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES
A PERIODIC APPROACH TO PLANE PARTITION CONGRUENCES MATTHEW S. MIZUHARA, JAMES A. SELLERS, AND HOLLY SWISHER Abstract. Ramanujan s celebrated congruences of the partition function p(n have inspired a vast
More informationARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3
ARITHMETIC OF THE 13-REGULAR PARTITION FUNCTION MODULO 3 JOHN J WEBB Abstract. Let b 13 n) denote the number of 13-regular partitions of n. We study in this paper the behavior of b 13 n) modulo 3 where
More informationPolynomial analogues of Ramanujan congruences for Han s hooklength formula
Polynomial analogues of Ramanujan congruences for Han s hooklength formula William J. Keith CELC, University of Lisbon Email: william.keith@gmail.com Detailed arxiv preprint: 1109.1236 Context Partition
More informationCHARACTERIZING THE NUMBER OF m ARY PARTITIONS MODULO m Mathematics Subject Classification: 05A17, 11P83
CHARACTERIZING THE NUMBER OF m ARY PARTITIONS MODULO m GEORGE E. ANDREWS, AVIEZRI S. FRAENKEL, AND JAMES A. SELLERS Abstract. Motivated by a recent conjecture of the second author related to the ternary
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationCombinatorics, Modular Forms, and Discrete Geometry
Combinatorics, Modular Forms, and Discrete Geometry / 1 Geometric and Enumerative Combinatorics, IMA University of Minnesota, Nov 10 14, 2014 Combinatorics, Modular Forms, and Discrete Geometry Peter Paule
More informationWilson s Theorem and Fermat s Little Theorem
Wilson s Theorem and Fermat s Little Theorem Wilson stheorem THEOREM 1 (Wilson s Theorem): (p 1)! 1 (mod p) if and only if p is prime. EXAMPLE: We have (2 1)!+1 = 2 (3 1)!+1 = 3 (4 1)!+1 = 7 (5 1)!+1 =
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
More informationNumerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n
Numerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n This article is dedicated to the memory of George Mackiw June 7, 2004 Introduction In this article we explore
More informationInteger partitions into Diophantine pairs
Availaible on line at http://www.liforce.usthb.dz bulletin-liforce@usthb.dz Bulletin du Laboratoire 04 (015) 8-35 Integer partitions into Diophantine pairs Zahra YAHI 1, Nesrine BENYAHIA TANI, Sadek BOUROUBI
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More information(Primes and) Squares modulo p
(Primes and) Squares modulo p Paul Pollack MAA Invited Paper Session on Accessible Problems in Modern Number Theory January 13, 2018 1 of 15 Question Consider the infinite arithmetic progression Does it
More informationParity Results for Certain Partition Functions
THE RAMANUJAN JOURNAL, 4, 129 135, 2000 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Parity Results for Certain Partition Functions MICHAEL D. HIRSCHHORN School of Mathematics, UNSW,
More informationRAMANUJAN-TYPE CONGRUENCES MODULO POWERS OF 5 AND 7. D. Ranganatha
Indian J. Pure Appl. Math., 83: 9-65, September 07 c Indian National Science Academy DOI: 0.007/s36-07-037- RAMANUJAN-TYPE CONGRUENCES MODULO POWERS OF 5 AND 7 D. Ranganatha Department of Studies in Mathematics,
More information11-Dissection and Modulo 11 Congruences Properties for Partition Generating Function
Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 1, 1-10 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.310116 11-Dissection and Modulo 11 Congruences Properties for Partition Generating
More informationDEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS. George E. Andrews and Ken Ono. February 17, Introduction and Statement of Results
DEDEKIND S ETA-FUNCTION AND ITS TRUNCATED PRODUCTS George E. Andrews and Ken Ono February 7, 2000.. Introduction and Statement of Results Dedekind s eta function ηz, defined by the infinite product ηz
More informationA Generalization of the Euler-Glaisher Bijection
A Generalization of the Euler-Glaisher Bijection p.1/48 A Generalization of the Euler-Glaisher Bijection Andrew Sills Georgia Southern University A Generalization of the Euler-Glaisher Bijection p.2/48
More informationArithmetic properties of overcubic partition pairs
Arithmetic properties of overcubic partition pairs Bernard L.S. Lin School of Sciences Jimei University Xiamen 3101, P.R. China linlsjmu@13.com Submitted: May 5, 014; Accepted: Aug 7, 014; Published: Sep
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationConstruction of latin squares of prime order
Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo
More informationCounting Prime Numbers with Short Binary Signed Representation
Counting Prime Numbers with Short Binary Signed Representation José de Jesús Angel Angel and Guillermo Morales-Luna Computer Science Section, CINVESTAV-IPN, Mexico jjangel@computacion.cs.cinvestav.mx,
More informationPartitioning of Positive Integers
Partitioning of Positive Integers By Hossam Shoman Supervised by Dr. Ayman Badawi A thesis presented to the American University of Sharjah in the partial fulfillment of the requirements for the degree
More informationCongruences for Fishburn numbers modulo prime powers
Congruences for Fishburn numbers modulo prime powers Partitions, q-series, and modular forms AMS Joint Mathematics Meetings, San Antonio January, 205 University of Illinois at Urbana Champaign ξ(3) = 5
More informationA mod p 3 analogue of a theorem of Gauss on binomial coefficients
A mod p 3 analogue of a theorem of Gauss on binomial coefficients Dalhousie University, Halifax, Canada ELAZ, Schloß Schney, August 16, 01 Joint work with John B. Cosgrave Dublin, Ireland We begin with
More informationPerfect numbers among polynomial values
Perfect numbers among polynomial values Oleksiy Klurman Université de Montréal June 8, 2015 Outline Classical results Radical of perfect number and the ABC-conjecture Idea of the proof Let σ(n) = d n d.
More informationCool theorems proved by undergraduates
Cool theorems proved by undergraduates Ken Ono Emory University Child s play... Child s play... Thanks to the, Child s play... Thanks to the, undergrads and I play by... Child s play... Thanks to the,
More informationNumber Theory. CSS322: Security and Cryptography. Sirindhorn International Institute of Technology Thammasat University CSS322. Number Theory.
CSS322: Security and Cryptography Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 29 December 2011 CSS322Y11S2L06, Steve/Courses/2011/S2/CSS322/Lectures/number.tex,
More information198 VOLUME 46/47, NUMBER 3
LAWRENCE SOMER Abstract. Rotkiewicz has shown that there exist Fibonacci pseudoprimes having the forms p(p + 2), p(2p 1), and p(2p + 3), where all the terms in the products are odd primes. Assuming Dickson
More informationCOMPUTING THE INTEGER PARTITION FUNCTION
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 005-578(XX)0000-0 COMPUTING THE INTEGER PARTITION FUNCTION NEIL CALKIN, JIMENA DAVIS, KEVIN JAMES, ELIZABETH PEREZ, AND CHARLES SWANNACK
More informationIn fact, 3 2. It is not known whether 3 1. All three problems seem hard, although Shor showed that one can solve 3 quickly on a quantum computer.
Attacks on RSA, some using LLL Recall RSA: N = pq hard to factor. Choose e with gcd(e,φ(n)) = 1, where φ(n) = (p 1)(q 1). Via extended Euclid, find d with ed 1 (mod φ(n)). Discard p and q. Public key is
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationThis theorem allows us to describe all integer solutions as follows:
On the Diophantine equation a 3 + b 3 + c 3 + d 3 = 0 by RACHEL GAR-EL and LEONID VASERSTEIN (University Park, PA) Introduction. The equation a 3 + b 3 + c 3 + d 3 = 0 (1) has been studied by many mathematicians
More informationNORTHWESTERN UNIVERSITY Thrusday, Oct 6th, 2011 ANSWERS FALL 2011 NU PUTNAM SELECTION TEST
Problem A1. Let a 1, a 2,..., a n be n not necessarily distinct integers. exist a subset of these numbers whose sum is divisible by n. Prove that there - Answer: Consider the numbers s 1 = a 1, s 2 = a
More informationTHE LIND-LEHMER CONSTANT FOR 3-GROUPS. Stian Clem 1 Cornell University, Ithaca, New York
#A40 INTEGERS 18 2018) THE LIND-LEHMER CONSTANT FOR 3-GROUPS Stian Clem 1 Cornell University, Ithaca, New York sac369@cornell.edu Christopher Pinner Department of Mathematics, Kansas State University,
More informationINFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3
INFINITELY MANY CONGRUENCES FOR BROKEN 2 DIAMOND PARTITIONS MODULO 3 SILVIU RADU AND JAMES A. SELLERS Abstract. In 2007, Andrews and Paule introduced the family of functions k n) which enumerate the number
More informationCOMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES. James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 19383, USA
COMBINATORICS OF RAMANUJAN-SLATER TYPE IDENTITIES James McLaughlin Department of Mathematics, West Chester University, West Chester, PA 9383, USA jmclaughl@wcupa.edu Andrew V. Sills Department of Mathematical
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationThe security of RSA (part 1) The security of RSA (part 1)
The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 The modulus n and its totient value φ(n) are known φ(n) = p q (p + q) + 1 = n (p + q) + 1 i.e. q = (n φ(n) + 1)
More informationAbstract In this paper I give an elementary proof of congruence identity p(11n + 6) 0(mod11).
An Elementary Proof that p(11n + 6) 0(mod 11) By: Syrous Marivani, Ph.D. LSU Alexandria Mathematics Department 8100 HWY 71S Alexandria, LA 71302 Email: smarivani@lsua.edu Abstract In this paper I give
More informationDIVISIBILITY OF BINOMIAL COEFFICIENTS AT p = 2
DIVISIBILITY OF BINOMIAL COEFFICIENTS AT p = 2 BAILEY SWINFORD Abstract. This paper will look at the binomial coefficients divisible by the prime number 2. The paper will seek to understand and explain
More informationChapter 8. Introduction to Number Theory
Chapter 8 Introduction to Number Theory CRYPTOGRAPHY AND NETWORK SECURITY 1 Index 1. Prime Numbers 2. Fermat`s and Euler`s Theorems 3. Testing for Primality 4. Discrete Logarithms 2 Prime Numbers 3 Prime
More informationCombinatorics, Modular Functions, and Computer Algebra
Combinatorics, Modular Functions, and Computer Algebra / 1 Combinatorics and Computer Algebra (CoCoA 2015) Colorado State Univ., Fort Collins, July 19-25, 2015 Combinatorics, Modular Functions, and Computer
More informationTHE CYCLOTOMIC EQUATION AND ITS SIGNIFICANCE TO SOLVING THE QUINTIC EQUATION
THE CYCLOTOMIC EQUATION AND ITS SIGNIFICANCE TO SOLVING THE QUINTIC EQUATION Jay Villanueva Florida Memorial University Miami, FL 33055 jvillanu@fmuniv.edu ICTCM 2013 I. Introduction A. The cyclotomic
More informationA field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties:
Byte multiplication 1 Field arithmetic A field F is a set of numbers that includes the two numbers 0 and 1 and satisfies the properties: F is an abelian group under addition, meaning - F is closed under
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationNOTES ON SIMPLE NUMBER THEORY
NOTES ON SIMPLE NUMBER THEORY DAMIEN PITMAN 1. Definitions & Theorems Definition: We say d divides m iff d is positive integer and m is an integer and there is an integer q such that m = dq. In this case,
More informationThe Kth M-ary Partition Function
Indiana University of Pennsylvania Knowledge Repository @ IUP Theses and Dissertations (All) Fall 12-2016 The Kth M-ary Partition Function Laura E. Rucci Follow this and additional works at: http://knowledge.library.iup.edu/etd
More informationof Classical Constants Philippe Flajolet and Ilan Vardi February 24, 1996 Many mathematical constants are expressed as slowly convergent sums
Zeta Function Expansions of Classical Constants Philippe Flajolet and Ilan Vardi February 24, 996 Many mathematical constants are expressed as slowly convergent sums of the form C = f( ) () n n2a for some
More informationPartition Identities
Partition Identities Alexander D. Healy ahealy@fas.harvard.edu May 00 Introduction A partition of a positive integer n (or a partition of weight n) is a non-decreasing sequence λ = (λ, λ,..., λ k ) of
More informationSolutions to Section 2.1 Homework Problems S. F. Ellermeyer
Solutions to Section 21 Homework Problems S F Ellermeyer 1 [13] 9 = f13; 22; 31; 40; : : :g [ f4; 5; 14; : : :g [3] 10 = f3; 13; 23; 33; : : :g [ f 7; 17; 27; : : :g [4] 11 = f4; 15; 26; : : :g [ f 7;
More informationWhat is the crank of a partition? Daniel Glasscock, July 2014
What is the crank of a partition? Daniel Glasscock, July 2014 These notes complement a talk given for the What is...? seminar at the Ohio State University. Introduction The crank of an integer partition
More informationEULER S THEOREM KEITH CONRAD
EULER S THEOREM KEITH CONRAD. Introduction Fermat s little theorem is an important property of integers to a prime modulus. Theorem. (Fermat). For prime p and any a Z such that a 0 mod p, a p mod p. If
More informationThe Man Who Knew Infinity
The Man Who Knew Infinity Edmund Y. M. Chiang November 9, 2016 Capstone Project course Department of Mathematics Outline A strange genius G. H. Hardy Fermat s integral Partitions Rogers-Ramanujan identities
More informationA MODULAR IDENTITY FOR THE RAMANUJAN IDENTITY MODULO 35
A MODULAR IDENTITY FOR THE RAMANUJAN IDENTITY MODULO 35 Adrian Dan Stanger Department of Mathematics, Brigham Young University, Provo, Utah 84602, USA adrian@math.byu.edu Received: 3/20/02, Revised: 6/27/02,
More informationCOMPUTATIONAL PROOFS OF CONGRUENCES FOR 2-COLORED FROBENIUS PARTITIONS
IJMMS 29:6 2002 333 340 PII. S0161171202007342 http://ijmms.hindawi.com Hindawi Publishing Corp. COMPUTATIONAL PROOFS OF CONGRUENCES FOR 2-COLORED FROBENIUS PARTITIONS DENNIS EICHHORN and JAMES A. SELLERS
More informationSOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ω(q) AND ν(q) S.N. Fathima and Utpal Pore (Received October 13, 2017)
NEW ZEALAND JOURNAL OF MATHEMATICS Volume 47 2017), 161-168 SOME CONGRUENCES FOR PARTITION FUNCTIONS RELATED TO MOCK THETA FUNCTIONS ωq) AND νq) S.N. Fathima and Utpal Pore Received October 1, 2017) Abstract.
More informationGENERAL FAMILY OF CONGRUENCES MODULO LARGE POWERS OF 3 FOR CUBIC PARTITION PAIRS. D. S. Gireesh and M. S. Mahadeva Naika
NEW ZEALAND JOURNAL OF MATEMATICS Volume 7 017, 3-56 GENERAL FAMILY OF CONGRUENCES MODULO LARGE POWERS OF 3 FOR CUBIC PARTITION PAIRS D. S. Gireesh and M. S. Mahadeva Naika Received May 5, 017 Abstract.
More informationDiscrete Math. Instructor: Mike Picollelli. Day 10
Day 10 Fibonacci Redux. Last time, we saw that F n = 1 5 (( 1 + ) n ( 5 2 1 ) n ) 5. 2 What Makes The Fibonacci Numbers So Special? The Fibonacci numbers are a particular type of recurrence relation, a
More information6.5 Elliptic Curves Over the Rational Numbers
6.5 Elliptic Curves Over the Rational Numbers 117 FIGURE 6.5. Louis J. Mordell 6.5 Elliptic Curves Over the Rational Numbers Let E be an elliptic curve defined over Q. The following is a deep theorem about
More informationRepeated Values of Euler s Function. a talk by Paul Kinlaw on joint work with Jonathan Bayless
Repeated Values of Euler s Function a talk by Paul Kinlaw on joint work with Jonathan Bayless Oct 4 205 Problem of Erdős: Consider solutions of the equations ϕ(n) = ϕ(n + k), σ(n) = σ(n + k) for fixed
More informationA MATRIX GENERALIZATION OF A THEOREM OF FINE
A MATRIX GENERALIZATION OF A THEOREM OF FINE ERIC ROWLAND To Jeff Shallit on his 60th birthday! Abstract. In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients ( n, for m
More information