# On m-ary Overpartitions

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 On m-ary Overpartitions Øystein J. Rødseth Department of Mathematics, University of Bergen, Johs. Brunsgt. 1, N 5008 Bergen, Norway James A. Sellers Department of Mathematics, Penn State University, University Park, Pennsylvania January 17, 005 Abstract Presently there is a lot of activity in the study of overpartitions, objects that were discussed by MacMahon, and which have recently proven useful in several combinatorial studies of basic hypergeometric series. In this paper we study some similar objects, which we name m- ary overpartitions. We consider divisibility properties of the number of m-ary overpartitions of a natural number, and we prove a theorem which is a lifting to general m of the well-known Churchhouse congruences for the binary partition function. Keywords: overpartition, m-ary overpartition, generating function, partition 000 Mathematics Subject Classification: 05A17, 11P83 1

2 1 Introduction Presently there is a lot of activity in the study of the objects named overpartitions by Corteel and Lovejoy []. According to Corteel and Lovejoy, these objects were discussed by MacMahon and have recently proven useful in several combinatorial studies of basic hypergeometric series. In this paper we study some similar objects, which we name m-ary overpartitions. Let m be an integer. An m-ary partition of a natural number n is a non-increasing sequence of non-negative integral powers of m whose sum is n. An m-ary overpartition of n is a non-increasing sequence of non-negative integral powers of m whose sum is n, and where the first occurrence of a power of m may be overlined. We denote the number of m-ary overpartitions of n by b m (n). The overlined parts form an m-ary partition into distinct parts, and the non-overlined parts form an ordinary m-ary partition. Thus, putting b m (0) = 1, we have the generating function F m (q) = b m (n)q n = 1 + q mi 1 q mi. For example, for m =, we find b (n)q n = 1 + q + 4q + 6q q q , where the 10 binary overpartitions of 4 are , , , , , , +, +, 4, 4. The main object of this paper is to prove the following theorem. Theorem 1 For each integer r 1, we have b m (m r+1 n) b m (m r 1 n) 0 (mod 4m 3r/ /c (r 1)/ ), where c = gcd(3, m).

3 Putting m = in Theorem 1, we get (1) b ( r+1 n) b ( r 1 n) 0 (mod 3r/ + ) for r 1. Writing b (n) for the number of binary partitions of n, we have, as noted in the next section, that b (n) = b (n). Thus (1) can be written as () b ( r+ n) b ( r n) 0 (mod 3r/ + ) for r 1. This result was conjectured by Churchhouse [1]. A number of proofs of () have been given by several authors; cf. [4]. Families of congruences also appear in the literature for the m-ary partition function which are valid for any m ; cf. [3]. But as far as we know, none of these m-ary results give the Churchhouse congruences when m =. So, Theorem 1 seems to be the first known lifting to general m of the Churchhouse congruences for the binary partition function. We prove Theorem 1 by adapting the technique used in [3]. In Section below we introduce some tools and prove three lemmata. In Section 3 we complete the proof of Theorem 1. Finally, in Section 4 we state a theorem which generalizes Theorem 1 and sketch its proof. Auxiliaries Although many of the objects below depend on m or q (or both), such dependence will sometimes be suppressed by the chosen notation. The power series in this paper will be elements of Z[[q]], the ring of formal power series in q with coefficients in Z. We define a Z-linear operator U : Z[[q]] Z[[q]] by U n a(n)q n = n a(mn)q n. 3

4 Notice that if f(q), g(q) Z[[q]], then (3) U(f(q)g(q m )) = (Uf(q))g(q). Moreover, if f(q) = n a(n)qn Z[[q]], and M is a positive integer, then we have if and only if, for all n, f(q) 0 (mod M) (in Z[[q]]) a(n) 0 (mod M) (in Z). At this point, a note is in order on the relationship between the binary partition function b (n) and the binary overpartition function b (n). Since each natural number has a unique representation as a sum of distinct nonnegative powers of, we have (1 + q i ) = so that (4) b (n)q n = 1 1 q q n = 1 1 q, 1 1 q i. For the binary partition function b (n), we have b (n)q n 1 = = q i 1 q 1 q i+1 Applying the U-operator with m =, we get ( ) b (n)q n 1 1 = U 1 q 1 q i+1 ( = U 1 ) 1 by (3) 1 q 1 q i 1 1 = 1 q 1 q i = b (n)q n by (4), 4

5 so that b (n) = b (n), as mentioned in the Introduction. Alternatively, it is rather easy to construct a bijection between the set of binary overpartitions of n and the set of binary partitions of n: Consider a binary overpartition of n. Multiply each part by. Write the overlined parts as sums of 1s. Then we have a binary partition of n. On the other hand, let a binary partition of n be given. The number of 1s is even, and the sum of 1s can in a unique way be written as a sum of distinct positive powers of. Overline these powers of. Divide all parts by. Then we have a binary overpartition of n. For example, starting with a binary overpartition of 11, we get = , which is a binary partition of. Conversely, starting with this binary partition of, we find = , which is the original binary overpartition of 11. We shall use the following result for binomial coefficients. Lemma 1 For each positive integer r there exist unique integers α r (i), such that for all n, (5) ( ) mn + r 1 = r r ( ) n + i 1 α r (i). i 5

6 Proof. See the proof of [3, Lemma 1]. Comparing the coefficients of n r in (5), we get α r (r) = m r, and comparing the coefficients of m r 1, we get so that (6) α r (r 1) = 1 (r 1)(m 1)mr 1, α r 1 (r 1) α r (r 1) = (rm m r + )m r 1. We also note that by setting n = j in (5), we get Then (7) ( ) mj j 1 ( 1) j α r (j) = ( 1) r r Next, we put so that h i = h i (q) = h i = Uh r = ( 1) i ( j i q (1 q) i+1 for i 0. ( ) n + i 1 q n, i ( ) mn + r 1 q n. r It follows from Lemma 1 and (7) that (8) In particular, Uh r = r α r (i)h i for r 1. ) α r (i), j = 1,,..., r. (9) (10) Uh 1 = mh 1, Uh = m h 1 (m 1)mh 1, Uh 3 = m 3 h 3 (m 1)m h (m )(m 1)mh 1. 6

7 Let Then M 1 = 4mh 1 and M i+1 = U ( ) 1 + q 1 q M i (( ) ) M = U 1 q 1 4mh 1 = 4m(Uh Uh 1 ) = 4m(m h m h 1 ) by (9) and (10) = 3 m 3 h m M 1. for i 1. Similarly, we find M 3 = 4 m 6 h 3 m 3 M 1 3 (m 1)(m + 1)m3 M 1. Lemma For each positive integer r there exist integers µ r (i) such that (11) where (1) M r = r+1 m r(r+1)/ h r µ r (i)m i, 3µ r (i) 0 (mod m (3(r i)+1)/ ) for i = 1,,..., r 1. Note. In the following we set µ r (r) = 1 and µ r (0) = 0 for r 1. Notice that these values of µ satisfy (1). Proof. We use induction on r. The lemma is true for r = 1. Suppose that for some r > 1, we have j 1 (13) M j = j+1 m j(j+1)/ h j µ j (i)m i for j = 1,,..., r 1, where all the µ j (i) are integers satisfying 3µ j (i) 0 (mod m (3(j i)+1)/ ), i = 1,,..., j 1. 7

8 Then, using (13) with j = r 1, we get ( ) 1 + q M r = U 1 q M r 1 (( ) ) = r m r(r 1)/ U 1 q 1 r h r 1 µ r 1 (i)u r ( ) 1 + q 1 q M i = r+1 m r(r 1)/ Uh r r m r(r 1)/ Uh r 1 µ r 1 (i)m i+1. By (8), we further get r M r = r+1 m r(r 1)/ α r (i)h i r m r(r 1)/ α r 1 (i)h i Moreover, by (13), r µ r 1 (i)m i+1 = r+1 m r(r+1)/ h r µ r 1 (i 1)M i i= r m r(r 1)/ (α r 1 (j) α r (j))h j. j=1 M r = r+1 m r(r+1)/ h r µ r 1 (i 1)M i i= r 1 j m r(r 1)/ j(j+1)/ (α r 1 (j) α r (j)) j=1 = r+1 m r(r+1)/ h r µ r 1 (i 1)M i i= j µ j (i)m i r 1 j m r(r 1)/ j(j+1)/ (α r 1 (j) α r (j))µ j (i)m i. j=i Thus (11) holds with (14) µ r (i) = µ r 1 (i 1) 8

9 r 1 j m r(r 1)/ j(j+1)/ (α r 1 (j) α r (j))µ j (i), r 1 + j=i so that µ r (i) Z. We continue to show that (1) holds. Since (1) is true for r = 1,, 3, we can assume that r > 3. With exponents of m in mind, we have 1 r(r 1) 1 j(j + 1) + 3(j i) + 1 3(r i) + 1 for j r. Thus we get by (14), (6), and the induction hypothesis, 3µ r (i) 3µ r 1 (i 1) + (α r 1 (r 1) α r (r 1)) 3µ r 1 (i) (rm m r + )m r 1 3µ r 1 (i) (mod m (3(r i)+1)/ ). Now, looking at exponents of m, we have 3(r 1 i) + 1 3(r i) + 1 r 1 + >, and (1) follows. We notice that by putting i = r 1 in (14), we get so that, by (6), µ r (r 1) = µ r 1 (r ) + α r 1 (r 1) α r (r 1), µ r (r 1) = µ r 1 (r ) + (rm m r + )m r 1 for r > 1. Since µ 1 (0) = 0, induction on r gives (15) µ r (r 1) = (r 1)m r for r 1. Lemma 3 For r 1, we have (16) 3 (r 1)/ M r 0 (mod 4m 3r/ ). 9

10 Proof. We use induction on r. The lemma is true for r = 1. Suppose that for some r > 1, we have 3 (i 1)/ M i 0 (mod 4m 3i/ ) for i = 1,,..., r 1. By Lemma and the induction hypothesis, we find 3 (r 1)/ M r = 3 (r 1)/ r+1 m r(r+1)/ h r µ r (r 1)3 (r 1)/ M r 1 r 3 (r 1)/ (i 1)/ 1 3µ r (i) 3 (i 1)/ M i µ r (r 1) 3 (r 1)/ M r 1 (mod 4m 3r/ ), and using (15), (16) follows. 3 Proof of Theorem 1, Concluded Theorem 1 now follows from Lemma 3 and the following result. Lemma 4 For r 1, we have ( b m (m r+1 n) b m (m r 1 n))q n = M r F m (q). Proof. We use induction on r. We have so that F m (q) = b m (n)q n = b m (mn)q n = 1 + q mi 1 q mi = 1 + q 1 q F m(q m ), ( U 1 + q ) F m (q) 1 q = 1 + q 1 q F m(q) ( ) 1 + q = F m (q m ); 1 q 10

11 that is and it follows that b m (mn)q n = (4h 1 + 1)F m (q m ), ( b m (m n) b m (n))q n = M 1 F m (q), so the lemma is true for r = 1. Then Suppose that for some r, we have ( b m (m r n) b m (m r n))q n = M r 1 F m (q). ( b m (m r n) b m (m r n))q n = 1 + q 1 q M r 1F m (q m ), so that ( b m (m r+1 n) b m (m r 1 n))q n = and the proof is complete. ( ( )) 1 + q U 1 q M r 1 F m (q) = M r F m (q), 4 Restricted m-ary Overpartitions We close by noting that we can actually prove a result which is stronger than Theorem 1. For a positive integer k, let b m,k (n) denote the number of m-ary overpartitions of n, where the largest part is at most m k 1. For this restricted m-ary overpartition function we have the following result. Theorem Let s = min(r, k 1) 1. Then we have b m,k (m r+1 n) b m,k (m r 1 n) 0 (mod 4m r+ s/ /c (s 1)/ ), where c = gcd(3, m). 11

12 For a given n, we have b m (n) = b m,k (n) for a sufficiently large value of k. Therefore, Theorem implies Theorem 1. We now sketch a proof of Theorem. We have the generating function F m,k (q) = b m,k (n)q n = k q mi 1 q mi. Putting F m,0 (q) = 1, minor modifications in the proof of Lemma 4 give the following lemma. Lemma 5 For 1 r k 1, we have ( b m,k (m r+1 n) b m,k (m r 1 n))q n = M r F m,k 1 r (q). Now, by Lemma 3 and Lemma 5, Theorem holds for r k 1. For the remaining case r k, we need one more lemma. Lemma 6 For v 1 and t 0, there exist integers λ v,t (i) such that U t M v = v λ v,t (i)m i, where 3 (v i)/ λ v,t (i) 0 (mod m (3(v i)+1)/ +t ). This lemma is proven by induction on t. However, for the induction step we need the special case t = 1 of the lemma, and this special case is proven by induction on v. By Lemma 3 and Lemma 6, we find that (17) 3 (v 1)/ U t M v 0 (mod 4m 3v/ +t ) for v 1 and t 0. Applying the operator U t to the identity of Lemma 5 with r = k 1 1, we get, by (17), that Theorem also holds if r = k 1 + t k. 1

13 References [1] R. F. Churchhouse, Congruence properties of the binary partition function, Proc. Cambridge Philos. Soc. 66 (1969), [] S. Corteel and J. Lovejoy, Overpartitions, Trans. Amer. Math. Soc. 356 (004), [3] Ø. J. Rødseth and J. A. Sellers, On m-ary partition function congruences: A fresh look at a past problem, J. Number Theory 87 (001), [4] Ø. J. Rødseth and J. A. Sellers, Binary partitions revisited, J. Combinatorial Theory, Series A 98 (00),

### ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS

ARITHMETIC PROPERTIES FOR HYPER M ARY PARTITION FUNCTIONS Kevin M. Courtright Department of Mathematics, The Pennsylvania State University, University Park, PA 16802 kmc260@psu.edu James A. Sellers Department

### CHARACTERIZING 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

### arxiv: v1 [math.co] 24 Jan 2017

CHARACTERIZING THE NUMBER OF COLOURED m ARY PARTITIONS MODULO m, WITH AND WITHOUT GAPS I. P. GOULDEN AND PAVEL SHULDINER arxiv:1701.07077v1 [math.co] 24 Jan 2017 Abstract. In a pair of recent papers, Andrews,

### THE FIRST POSITIVE RANK AND CRANK MOMENTS FOR OVERPARTITIONS

THE FIRST POSITIVE RANK AND CRANK MOMENTS FOR OVERPARTITIONS GEORGE ANDREWS, SONG HENG CHAN, BYUNGCHAN KIM, AND ROBERT OSBURN Abstract. In 2003, Atkin Garvan initiated the study of rank crank moments for

### COMBINATORICS 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

### THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5

THE NUMBER OF PARTITIONS INTO DISTINCT PARTS MODULO POWERS OF 5 JEREMY LOVEJOY Abstract. We establish a relationship between the factorization of n+1 and the 5-divisibility of Q(n, where Q(n is the number

### COMBINATORIAL PROOFS OF RAMANUJAN S 1 ψ 1 SUMMATION AND THE q-gauss SUMMATION

COMBINATORIAL PROOFS OF RAMANUJAN S 1 ψ 1 SUMMATION AND THE q-gauss SUMMATION AE JA YEE 1 Abstract. Theorems in the theory of partitions are closely related to basic hypergeometric series. Some identities

### On 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 &

### arxiv: v2 [math.nt] 9 Apr 2015

CONGRUENCES FOR PARTITION PAIRS WITH CONDITIONS arxiv:408506v2 mathnt 9 Apr 205 CHRIS JENNINGS-SHAFFER Abstract We prove congruences for the number of partition pairs π,π 2 such that π is nonempty, sπ

### ON FREIMAN S 2.4-THEOREM

ON FREIMAN S 2.4-THEOREM ØYSTEIN J. RØDSETH Abstract. Gregory Freiman s celebrated 2.4-Theorem says that if A is a set of residue classes modulo a rime satisfying 2A 2.4 A 3 and A < /35, then A is contained

### Sums of Squares. Bianca Homberg and Minna Liu

Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares

### COMBINATORIAL INTERPRETATIONS OF RAMANUJAN S TAU FUNCTION

COMBINATORIAL INTERPRETATIONS OF RAMANUJAN S TAU FUNCTION FRANK GARVAN AND MICHAEL J. SCHLOSSER Abstract. We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan s tau

### arxiv: v2 [math.co] 16 Jan 2018

GENERALIZED LAMBERT SERIES IDENTITIES AND APPLICATIONS IN RANK DIFFERENCES arxiv:18010443v2 [mathco] 1 Jan 2018 BIN WEI AND HELEN WJ ZHANG Abstract In this article, we prove two identities of generalized

### 2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

### Article 12 INTEGERS 11A (2011) Proceedings of Integers Conference 2009 RECURSIVELY SELF-CONJUGATE PARTITIONS

Article 12 INTEGERS 11A (2011) Proceedings of Integers Conference 2009 RECURSIVELY SELF-CONJUGATE PARTITIONS William J. Keith Department of Mathematics, Drexel University, Philadelphia, PA 19104, USA wjk26@math.drexel.edu

### arxiv: v1 [math.co] 18 Sep 2014

BRESSOUD STYLE IDENTITIES FOR REGULAR PARTITIONS AND OVERPARTITIONS KAĞAN KURŞUNGÖZ arxiv:1409.5221v1 [math.co] 18 Sep 2014 Abstract. We construct a family of partition identities which contain the following

### New congruences for overcubic partition pairs

New congruences for overcubic partition pairs M. S. Mahadeva Naika C. Shivashankar Department of Mathematics, Bangalore University, Central College Campus, Bangalore-560 00, Karnataka, India Department

### The Truncated Pentagonal Number Theorem

The Truncated Pentagonal Number Theorem George E. Andrews Department of Mathematics The Pennsylvania State University University Park, PA 16802 USA Mircea Merca Doctoral School in Applied Mathematics University

### 2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?

Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative

### REFINEMENTS OF SOME PARTITION INEQUALITIES

REFINEMENTS OF SOME PARTITION INEQUALITIES James Mc Laughlin Department of Mathematics, 25 University Avenue, West Chester University, West Chester, PA 9383 jmclaughlin2@wcupa.edu Received:, Revised:,

### arxiv: v2 [math.co] 3 May 2016

VARIATION ON A THEME OF NATHAN FINE NEW WEIGHTED PARTITION IDENTITIES arxiv:16050091v [mathco] 3 May 016 ALEXANDER BERKOVICH AND ALI KEMAL UNCU Dedicated to our friend Krishna Alladi on his 60th birthday

### Fermat numbers and integers of the form a k + a l + p α

ACTA ARITHMETICA * (200*) Fermat numbers and integers of the form a k + a l + p α by Yong-Gao Chen (Nanjing), Rui Feng (Nanjing) and Nicolas Templier (Montpellier) 1. Introduction. In 1849, A. de Polignac

### The part-frequency matrices of a partition

J. Algebra Comb. Discrete Appl. 3(3) 77 86 Received: 03 November 20 Accepted: 04 January 206 Journal of Algebra Combinatorics Discrete Structures and Applications The part-frequency matrices of a partition

### Some generalizations of a supercongruence of van Hamme

Some generalizations of a supercongruence of van Hamme Victor J. W. Guo School of Mathematical Sciences, Huaiyin Normal University, Huai an, Jiangsu 3300, People s Republic of China jwguo@hytc.edu.cn Abstract.

### BOUNDS FOR HIGHER TOPOLOGICAL COMPLEXITY OF REAL PROJECTIVE SPACE IMPLIED BY BP

BOUNDS FOR HIGHER TOPOLOGICAL COMPLEXITY OF REAL PROJECTIVE SPACE IMPLIED BY BP DONALD M. DAVIS Abstract. We use Brown-Peterson cohomology to obtain lower bounds for the higher topological complexity,

### A P-ADIC SUPERCONGRUENCE CONJECTURE OF VAN HAMME

A P-ADIC SUPERCONGRUENCE CONJECTURE OF VAN HAMME ERIC MORTENSON Abstract. In this paper we prove a p-adic supercongruence conjecture of van Hamme by placing it in the context of the Beuers-lie supercongruences

### Ramanujan-Slater Type Identities Related to the Moduli 18 and 24

Ramanujan-Slater Type Identities Related to the Moduli 18 and 24 James McLaughlin Department of Mathematics, West Chester University, West Chester, PA; telephone 610-738-0585; fax 610-738-0578 Andrew V.

### Powers of 2 with five distinct summands

ACTA ARITHMETICA * (200*) Powers of 2 with five distinct summands by Vsevolod F. Lev (Haifa) 0. Summary. We show that every sufficiently large, finite set of positive integers of density larger than 1/3

### A Readable Introduction to Real Mathematics

Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest

### arxiv: v1 [math.nt] 10 Jan 2015

DISTINCT PARTS PARTITIONS WITHOUT SEQUENCES arxiv:150102305v1 [mathnt] 10 Jan 2015 KATHRIN BRINGMANN, KARL MAHLBURG, AND KARTHIK NATARAJ Abstract Partitions without sequences of consecutive integers as

### RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS

RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. E-mail: Theresia.Eisenkoelbl@univie.ac.at

### * 8 Groups, with Appendix containing Rings and Fields.

* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that

### arxiv: v4 [math.co] 7 Nov 2016

VARIATION ON A THEME OF NATHAN FINE. NEW WEIGHTED PARTITION IDENTITIES arxiv:605.009v4 [math.co] 7 Nov 06 ALEXANDER BERKOVICH AND ALI KEMAL UNCU Dedicated to our friend, Krishna Alladi, on his 60th birthday.

### Appending Digits to Generate an Infinite Sequence of Composite Numbers

1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 14 2011, Article 11.5.7 Appending Digits to Generate an Infinite Sequence of Composite Numbers Lenny Jones and Daniel White Department of Mathematics

### Gaussian integers. 1 = a 2 + b 2 = c 2 + d 2.

Gaussian integers 1 Units in Z[i] An element x = a + bi Z[i], a, b Z is a unit if there exists y = c + di Z[i] such that xy = 1. This implies 1 = x 2 y 2 = (a 2 + b 2 )(c 2 + d 2 ) But a 2, b 2, c 2, d

### cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska

cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say

### Intermediate semigroups are groups

Semigroup Forum Version of September 12, 2017 Springer-Verlag New York Inc. Intermediate semigroups are groups Alexandre A. Panin arxiv:math/9903088v3 [math.gr] 4 Dec 1999 Communicated by Mohan Putcha

### TC10 / 3. Finite fields S. Xambó

TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the

### Decomposition of Pascal s Kernels Mod p s

San Jose State University SJSU ScholarWorks Faculty Publications Mathematics January 2002 Decomposition of Pascal s Kernels Mod p s Richard P. Kubelka San Jose State University, richard.kubelka@ssu.edu

### Srinivasa Ramanujan Life and Mathematics

Life and Mathematics Universität Wien (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) born 22 December 1887 in Erode (Madras Presidency = Tamil Nadu) named Iyengar (1887

### Basic Proof Examples

Basic Proof Examples Lisa Oberbroeckling Loyola University Maryland Fall 2015 Note. In this document, we use the symbol as the negation symbol. Thus p means not p. There are four basic proof techniques

### Problem Set 5 Solutions

Problem Set 5 Solutions Section 4.. Use mathematical induction to prove each of the following: a) For each natural number n with n, n > + n. Let P n) be the statement n > + n. The base case, P ), is true

### Partition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example

Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x

### Binary Convolutional Codes of High Rate Øyvind Ytrehus

Binary Convolutional Codes of High Rate Øyvind Ytrehus Abstract The function N(r; ; d free ), defined as the maximum n such that there exists a binary convolutional code of block length n, dimension n

### On the counting function for the generalized Niven numbers

On the counting function for the generalized Niven numbers Ryan Daileda, Jessica Jou, Robert Lemke-Oliver, Elizabeth Rossolimo, Enrique Treviño Abstract Given an integer base q 2 and a completely q-additive

### Proof of a Conjecture of Erdős on triangles in set-systems

Proof of a Conjecture of Erdős on triangles in set-systems Dhruv Mubayi Jacques Verstraëte November 11, 005 Abstract A triangle is a family of three sets A, B, C such that A B, B C, C A are each nonempty,

### Counting Palindromic Binary Strings Without r-runs of Ones

1 3 47 6 3 11 Journal of Integer Sequences, Vol. 16 (013), Article 13.8.7 Counting Palindromic Binary Strings Without r-runs of Ones M. A. Nyblom School of Mathematics and Geospatial Science RMIT University

### Fibonacci Diophantine Triples

Fibonacci Diophantine Triples Florian Luca Instituto de Matemáticas Universidad Nacional Autonoma de México C.P. 58180, Morelia, Michoacán, México fluca@matmor.unam.mx László Szalay Institute of Mathematics

### A FIRST COURSE IN NUMBER THEORY

A FIRST COURSE IN NUMBER THEORY ALEXANDRU BUIUM Contents 1. Introduction 2 2. The integers 4 3. Induction 6 4. Finite sets, finite sums, finite products 7 5. The rationals 8 6. Divisibility and Euclid

### Solutions Quiz 9 Nov. 8, Prove: If a, b, m are integers such that 2a + 3b 12m + 1, then a 3m + 1 or b 2m + 1.

Solutions Quiz 9 Nov. 8, 2010 1. Prove: If a, b, m are integers such that 2a + 3b 12m + 1, then a 3m + 1 or b 2m + 1. Answer. We prove the contrapositive. Suppose a, b, m are integers such that a < 3m

### ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS

ARITHMETIC PROGRESSIONS IN CYCLES OF QUADRATIC POLYNOMIALS TIMO ERKAMA It is an open question whether n-cycles of complex quadratic polynomials can be contained in the field Q(i) of complex rational numbers

### arxiv: v1 [math.ca] 7 Mar 2013

A SIMPLE PROOF OF ANDREWS S 5 F 4 EVALUATION IRA M. GESSEL arxiv:1303.1757v1 [math.ca] 7 Mar 2013 Department of Mathematics Brandeis University Waltham, MA 02453 gessel@brandeis.edu Abstract. We give a

### ETA-QUOTIENTS AND ELLIPTIC CURVES

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3169 3176 S 0002-9939(97)03928-2 ETA-QUOTIENTS AND ELLIPTIC CURVES YVES MARTIN AND KEN ONO (Communicated by

### Alexander Berkovich and Frank G. Garvan Department of Mathematics, University of Florida, Gainesville, Florida

Journal of Combinatorics and Number Theory JCNT 2009, Volume 1, Issue # 3, pp. 49-64 ISSN 1942-5600 c 2009 Nova Science Publishers, Inc. THE GBG-RANK AND t-cores I. COUNTING AND 4-CORES Alexander Berkovich

### arxiv: v1 [math.co] 27 Aug 2015

P-positions in Modular Extensions to Nim arxiv:1508.07054v1 [math.co] 7 Aug 015 Tanya Khovanova August 31, 015 Abstract Karan Sarkar In this paper, we consider a modular extension to the game of Nim, which

### Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

### THE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1

J. Appl. Math. & Informatics Vol. 31(2013), No. 1-2, pp. 179-188 Website: http://www.kcam.biz THE NUMBER OF SOLUTIONS TO THE EQUATION (x + 1) d = x d + 1 JI-MI YIM, SUNG-JIN CHO, HAN-DOO KIM, UN-SOOK CHOI

### Cullen Numbers in Binary Recurrent Sequences

Cullen Numbers in Binary Recurrent Sequences Florian Luca 1 and Pantelimon Stănică 2 1 IMATE-UNAM, Ap. Postal 61-3 (Xangari), CP 58 089 Morelia, Michoacán, Mexico; e-mail: fluca@matmor.unam.mx 2 Auburn

### On the vanishing of Tor of the absolute integral closure

On the vanishing of Tor of the absolute integral closure Hans Schoutens Department of Mathematics NYC College of Technology City University of New York NY, NY 11201 (USA) Abstract Let R be an excellent

### GENERAL 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.

### THE p-adic VALUATION OF LUCAS SEQUENCES

THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each

### On non-hamiltonian circulant digraphs of outdegree three

On non-hamiltonian circulant digraphs of outdegree three Stephen C. Locke DEPARTMENT OF MATHEMATICAL SCIENCES, FLORIDA ATLANTIC UNIVERSITY, BOCA RATON, FL 33431 Dave Witte DEPARTMENT OF MATHEMATICS, OKLAHOMA

### arxiv: v1 [math.nt] 9 Sep 2017

arxiv:179.2954v1 [math.nt] 9 Sep 217 ON THE FACTORIZATION OF x 2 +D GENERALIZED RAMANUJAN-NAGELL EQUATION WITH HUGE SOLUTION) AMIR GHADERMARZI Abstract. Let D be a positive nonsquare integer such that

### Three Aspects of Partitions. George E. Andrews 1

Three Aspects of Partitions by George E Andrews Introduction In this paper we shall discuss three topics in partitions Section is devoted to partitions with difference conditions and is an elucidation

### Compositions, Bijections, and Enumerations

Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations COGS- Jack N. Averitt College of Graduate Studies Fall 2012 Compositions, Bijections, and Enumerations Charles

### Spectrally arbitrary star sign patterns

Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,

### The Depth Formula for Modules with Reducible Complexity

The Depth Formula for Modules with Reducible Complexity Petter Andreas Bergh David A Jorgensen Technical Report 2010-10 http://wwwutaedu/math/preprint/ THE DEPTH FORMULA FOR MODULES WITH REDUCIBLE COMPLEXITY

### Some New Partition Theorems

JOURNAL OF COMBINATORIAL THEORY 2, 431-436 (1967) Some New Partition Theorems GEORGE E. ANDREWS* Department of Mathematics, The Pennsylvania State University, University Park, Pennsylvania Communicated

### ON THE NUMBER OF SUBSEQUENCES WITH GIVEN SUM OF SEQUENCES IN FINITE ABELIAN p-groups

ON THE NUMBER OF SUBSEQUENCES WITH GIVEN SUM OF SEQUENCES IN FINITE ABELIAN p-groups WEIDONG GAO AND ALFRED GEROLDINGER Abstract. Let G be an additive finite abelian p-group. For a given (long) sequence

### The pure braid groups and the Milnor μ-invariants of links

HIROSHIMA MATH J 12 (1982), 485-489 The pure braid groups and the Milnor μ-invariants of links Tetsusuke OHKAWA (Received January 14, 1982) 1 The statement of results In this note, we study a relation

### Partitions With Parts Separated By Parity

Partitions With Parts Separated By Parity by George E. Andrews Key Words: partitions, parity of parts, Ramanujan AMS Classification Numbers: P84, P83, P8 Abstract There have been a number of papers on

### LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD. To Professor Wolfgang Schmidt on his 75th birthday

LINEAR EQUATIONS WITH UNKNOWNS FROM A MULTIPLICATIVE GROUP IN A FUNCTION FIELD JAN-HENDRIK EVERTSE AND UMBERTO ZANNIER To Professor Wolfgang Schmidt on his 75th birthday 1. Introduction Let K be a field

### A NEW CHARACTERIZATION OF THE FIBONACCI-FREE PARTITION

Timothy Chow 226 Shady Avenue, Apt. 308, Pittsburgh, PA 15206 (Submitted July 1989) 1. Introduction There exists a unique partition of the positive integers into two disjoint sets A and B such that no

### ON THE DENSITY OF SOME SEQUENCES OF INTEGERS P. ERDOS

ON THE DENSITY OF SOME SEQUENCES OF INTEGERS P. ERDOS Let ai

### Integers and Division

Integers and Division Notations Z: set of integers N : set of natural numbers R: set of real numbers Z + : set of positive integers Some elements of number theory are needed in: Data structures, Random

### On cycle index and orbit stabilizer of Symmetric group

The International Journal Of Engineering And Science (IJES) Volume 3 Issue 1 Pages 18-26 2014 ISSN (e): 2319 1813 ISSN (p): 2319 1805 On cycle index and orbit stabilizer of Symmetric group 1 Mogbonju M.

### A SURVEY OF PRIMALITY TESTS

A SURVEY OF PRIMALITY TESTS STEFAN LANCE Abstract. In this paper, we show how modular arithmetic and Euler s totient function are applied to elementary number theory. In particular, we use only arithmetic

### MATH 201 Solutions: TEST 3-A (in class)

MATH 201 Solutions: TEST 3-A (in class) (revised) God created infinity, and man, unable to understand infinity, had to invent finite sets. - Gian Carlo Rota Part I [5 pts each] 1. Let X be a set. Define

### Zero-Sum Flows in Regular Graphs

Zero-Sum Flows in Regular Graphs S. Akbari,5, A. Daemi 2, O. Hatami, A. Javanmard 3, A. Mehrabian 4 Department of Mathematical Sciences Sharif University of Technology Tehran, Iran 2 Department of Mathematics

### A NOTE ON SOME MAHONIAN STATISTICS

Séminaire Lotharingien de Combinatoire 53 (2005), Article B53a A NOTE ON SOME MAHONIAN STATISTICS BOB CLARKE Abstract. We construct a class of mahonian statistics on words, related to the classical statistics

### K. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada D. Patterson

#A21 INTEGERS 11 (2011) PROJECTIVE P -ORDERINGS AND HOMOGENEOUS INTEGER-VALUED POLYNOMIALS K. Johnson Department of Mathematics, Dalhousie University, Halifax, Nova Scotia, Canada johnson@mathstat.dal.ca

### Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and

### Week 9-10: Recurrence Relations and Generating Functions

Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably

### What 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

### PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION. Predrag Terzic Podgorica, Montenegro

PRIMALITY TEST FOR FERMAT NUMBERS USING QUARTIC RECURRENCE EQUATION Predrag Terzic Podgorica, Montenegro pedja.terzic@hotmail.com Abstract. We present deterministic primality test for Fermat numbers, F

### ON COMPLEMENTED SUBSPACES OF SUMS AND PRODUCTS OF BANACH SPACES

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 124, Number 7, July 1996 ON COMPLEMENTED SUBSPACES OF SUMS AND PRODUCTS OF BANACH SPACES M. I. OSTROVSKII (Communicated by Dale Alspach) Abstract.

### Definitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch

Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary

### Generalization of a few results in integer partitions

Notes on Number Theory and Discrete Mathematics Vol. 9, 203, No. 2, 69 76 Generalization of a few results in integer partitions Manosij Ghosh Dastidar and Sourav Sen Gupta 2, Ramakrishna Mission Vidyamandira,

### Mathematical Foundations of Public-Key Cryptography

Mathematical Foundations of Public-Key Cryptography Adam C. Champion and Dong Xuan CSE 4471: Information Security Material based on (Stallings, 2006) and (Paar and Pelzl, 2010) Outline Review: Basic Mathematical

### Chordal Graphs, Interval Graphs, and wqo

Chordal Graphs, Interval Graphs, and wqo Guoli Ding DEPARTMENT OF MATHEMATICS LOUISIANA STATE UNIVERSITY BATON ROUGE, LA 70803-4918 E-mail: ding@math.lsu.edu Received July 29, 1997 Abstract: Let be the

### A lattice path approach to countingpartitions with minimum rank t

Discrete Mathematics 249 (2002) 31 39 www.elsevier.com/locate/disc A lattice path approach to countingpartitions with minimum rank t Alexander Burstein a, Sylvie Corteel b, Alexander Postnikov c, d; ;1

### Reduction of Smith Normal Form Transformation Matrices

Reduction of Smith Normal Form Transformation Matrices G. Jäger, Kiel Abstract Smith normal form computations are important in group theory, module theory and number theory. We consider the transformation

### 1. Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials.

Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials A rational function / is a quotient of two polynomials P, Q with 0 By Fundamental Theorem of algebra, =

### Explicit expressions for the moments of the size of an (s, s + 1)-core partition with distinct parts

arxiv:1608.02262v2 [math.co] 23 Nov 2016 Explicit expressions for the moments of the size of an (s, s + 1)-core partition with distinct parts Anthony Zaleski November 24, 2016 Abstract For fixed s, the

### Some families of identities for the integer partition function

MATHEMATICAL COMMUNICATIONS 193 Math. Commun. 0(015), 193 00 Some families of identities for the integer partition function Ivica Martinja 1, and Dragutin Svrtan 1 Department of Physics, University of

### Algebraic Structure in a Family of Nim-like Arrays

Algebraic Structure in a Family of Nim-like Arrays Lowell Abrams Department of Mathematics The George Washington University Washington, DC 20052 U.S.A. labrams@gwu.edu Dena S. Cowen-Morton Department of

### RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,