Congruences Modulo Small Powers of 2 and 3 for Partitions into Odd Designated Summands
|
|
- Colleen Harper
- 6 years ago
- Views:
Transcription
1 Journal of Integer Sequences, Vol. 0 (017), Article Congruences Modulo Small Powers of 3 for Partitions into Odd Designated Summs B. Hemanthkumar Department of Mathematics M. S. Ramaiah University of Applied Sciences Bengaluru India hemanthkumarb.30@gmail.com H. S. Sumanth Bharadwaj M. S. Mahadeva Naika 1 Department of Mathematics Central College Campus Bangalore University Bengaluru India sumanthbharadwaj@gmail.com msmnaika@rediffmail.com Abstract Andrews, Lewis Lovejoy introduced a new class of partitions, partitions with designated summs. Let PD(n) denote the number of partitions of n with designated summs PDO(n) denote the number of partitions of n with designated summs in which all parts are odd. Andrews et al. established many congruences modulo 3 for PDO(n) by using the theory of modular forms. Baruah Ojah obtainednumerouscongruencesmodulo3, 4, 816forPDO(n)byusingthetafunction identities. In this paper, we prove several infinite families of congruences modulo 9, 16 3 for PDO(n). 1 Corresponding author. 1
2 1 Introduction Apartition ofapositiveintegernisanonincreasingsequenceofpositiveintegersλ 1,λ,...,λ m such that n = λ 1 + λ + + λ m, where the λ i s (i = 1,,...,m) are called parts of the partition. For example, the partitions of 4 are 4, 3+1, +, +1+1, Let p(n) denote the number of partitions of n. Thus p(4) = 5. Andrews, Lewis Lovejoy [1] studied partitions with designated summs, which are constructed by taking ordinary partitions tagging exactly one of each part size. Thus the partitions of 4 with designated summs are given by 4, 3 +1, +, +, +1 +1, +1+1, , , , Let PD(n) denote the number of partitions of n with designated summs PDO(n) denote the number of partitions of n with designated summs in which all parts are odd. Thus PD(4) = 10 PDO(4) = 5. Recently, Chen et al. [5] obtained the generating functions for PD(3n), PD(3n + 1) PD(3n+) gave a combinatorial interpretation of the congruence PD(3n+) 0 (mod 3). Xia [11] proved infinite families of congruences modulo 9 7 for PD(n). For example, for all n 0 k 1 Throughout this paper, we use the notation PD( 18k 1 (1n+1)) 0 (mod 7). f k := (q k ;q k ) (k = 1,,3,...), where (a;q) := The generating function for PDO(n) satisfies (1 aq m ). m=0 PDO(n)q n = f 4f 6 f 1 f 3 f 1. (1) Using the theory of q-series modular forms Andrews et al. [1] derived PDO(3n)q n = f f6 4, () f1f 4 1 PDO(3n+1)q n = f4 f3f 3 1, (3) f1f 5 4 f6
3 They also established, for all n 0 PDO(3n+)q n = f3 f 6 f 1 f 4 1f 4. (4) PDO(9n+6) 0 (mod 3) PDO(1n+6) 0 (mod 3). Baruah Ojah [3] proved several congruences modulo 3, 4, 8 16 for PDO(n). For instance, PDO(8n+7) 0 (mod 8) PDO(1n+9) 0 (mod 16). The aim of this paper is to prove several new infinite families of congruences modulo 9, 16 3 for PDO(n). In particular, we prove the following Theorem 1. For all nonnegative integers α,β n, we have PDO( α+ 3 β (7n+66)) 0 (mod 144) (5) PDO( α+ 3 β (144n+138)) 0 (mod 88). (6) In Section, we list some preliminary results. We prove several infinite families of congruences modulo 9 for PDO(n) in Section 3, Theorem 1 many infinite families of congruences modulo 16 3 for PDO(n) in Section 4. Definitions preliminaries We will make use of the following definitions, notation results. Let f(a,b) be Ramanujan s general theta function [, p. 34] given by f(a,b) := n= a n(n+1) b n(n 1). Jacobi s triple product identity can be stated in Ramanujan s notation as follows: f(a,b) = ( a;ab) ( b;ab) (ab;ab). 3
4 In particular, ϕ(q) := f(q,q) = k= q k = f5, ϕ( q) := f( q, q) = f 1, (7) f1f 4 f ψ(q) := f(q,q 3 ) = f( q) := f( q, q ) = k=0 q k(k+1)/ = f f 1 (8) ( 1) k q k(3k 1)/ = f 1. (9) k= For any positive integer k, let k(k +1)/ be the k th triangular number k(3k ±1)/ be a generalized pentagonal number. Lemma. The following -dissections hold: f1 = f f8 5 f4f 16 1 f 1 q f f 16 f 8, (10) = f5 8 +q f 4f16, (11) ff 5 16 ff 5 8 f1 4 = f10 4 ff f 4 1 = f14 4 f 14 f8 4 4q f f 4 8 f 4 +4q f 4f 4 8 f 10 (1). (13) Proof. Lemma is an immediate consequence of dissection formulas of Ramanujan, collected in Berndt s book [, Entry 5, p. 40]. Lemma 3. The following -dissections hold: f 3 1 = f3 4 3q f f1 3, (14) f 3 f 1 f 4 f6 f 3 3 = f3 4f6 +q f3 1, (15) f 1 ff 1 f 4 f 3 f1 3 = f6 4f6 3 +3q f 4f 6 f1 ff 9 1 f 7 (16) f 1 f3 3 = f f 4f 1 f 7 6 q f3 f1 6. (17) f4f 6 9 4
5 Proof. Hirschhorn et al. [6] established (14) (15). Replacing q by q in (14) (15), using the relation we obtain (16) (17). Lemma 4. The following -dissections hold: ( q; q) = f3 f 1 f 4, f 1 f 3 = f f8f 1 4 q f4 4f 6 f4, f4f 6 f4 f f8f 1 (18) 1 = f 8f1 5 f +q 4f 5 4 f 1 f 3 ff 4 f6f 4 4 ff 4 6f 8f 1 (19) f3 f1 = f4 4f 6 f 1 f 5 f 8 f 4 +q f 4f 6f 8 f 4 f 4 f 1. (0) Proof. Baruah Ojah [4] derived the above identities. Lemma 5. The following 3-dissections hold: ϕ( q) = ϕ( q 9 ) qf( q 3, q 15 ) (1) ψ(q) = f(q 3,q 6 )+qψ(q 9 ). () Proof. See Berndt s book [, p. 49] for a proof of (1) (). Lemma 6. The following 3-dissection holds: f 1 f = f 6f 4 9 f 3 f 18 Proof. Hirschhorn Sellers [8] have proved the above identity. qf 9 f 18 q f 3f18 4. (3) f 6 f9 Let t be a positive integer. A partition of n is called a t-core partition of n if none of the hook numbers of its associated Ferrers-Young diagram are multiples of t. Let a t (n) denote the number of t-core partitions of n. Then the generating function of a t (n) satisfies a t (n)q n = ft t f 1. (4) Many mathematicians have studied arithmetic properties of a 3 (n). See for example, Keith [9], Lin Wang [10]. Hirschhorn Sellers [7] obtained an explicit formula for a 3 (n) by using elementary methods proved 5
6 Lemma 7. Let 3n + 1 = k i=1 p α i i m j=1 q β j j, where p i 1 (mod 3) q j (mod 3) with α i,β j 0 be the prime factorization of 3n+1. Then k (α i +1), if all β j are even; a 3 (n) = i=1 0, otherwise. 3 Congruences modulo 9 In this section, we prove the following infinite families of congruences modulo 9 for PDO(n). Theorem 8. For all nonnegative integers α,β n, we have PDO(4 α (4n+16)) PDO(4n+16) (mod 9), (5) PDO( α 3 β (4n+4)) ( 1) α PDO(4n+4) (mod 9), (6) PDO(4 α (48n+40)) 0 (mod 9) (7) PDO( α 3 β (144n+10)) 0 (mod 9). (8) Theorem 9. For any nonnegative integer n, let 3n+1 = k q j (mod 3) are primes with α i,β j 0. Then, 6 k (α i +1) (mod 9), if all β j are even; PDO(48n+16) i=1 0 (mod 9), otherwise. i=1 p α i i m j=1 q β j j, where p i 1 (mod 3) (9) 3 k (α i +1) (mod 9), if all β j are even; PDO(7n+4) i=1 0 (mod 9), otherwise. (30) Corollary 10. Let p (mod 3) be a prime. Then for all nonnegative integers α n with p n, we have PDO(48p α+1 n+16p α+ ) 0 (mod 9) (31) PDO(7p α+1 n+4p α+ ) 0 (mod 9). (3) Theorem 11. If n cannot be represented as the sum of a triangular number three times a triangular number, then PDO(48n+4) 0 (mod 9). 6
7 Corollary 1. For any positive integer k, let p j 5, 1 j k be primes. If ( 3/p j ) = 1 for every j, then for all nonnegative integers n with p k n we have PDO(48p 1p p k 1p k n+4p 1p p k) 0 (mod 9). (33) By the binomial theorem, it is easy to see that for any positive integer m, f 3 m f 3m (mod 3) (34) f 9 m f 3 3m (mod 9). (35) Proof of Theorem 8. From (35), it follows that f3 3 f1 5 f 4 1 (mod 9). (36) In view of (36), we rewrite (3) as PDO(3n+1)q n f4 1f 4 f 1 f 4 f 6 (mod 9). (37) Substituting (1) in (37) extracting the terms containing odd powers of q, we get PDO(6n+4)q n 4 f6 1f 4 4f 6 f 3 f 3 (mod 9). (38) Employing (14) in (38) extracting the terms containing even powers of q, we derive PDO(1n+4)q n 4 f10 f 3 f 3 1f 6 (mod 9). (39) Substituting (16) in (39) extracting the terms containing odd powers of q, we get From (34), In view of the above two identities, PDO(4n+16)q n 1 f3 1f f 6 f 3 (mod 9). f 3 1f f 6 f 3 f3 6 f (mod 3). PDO(4n+16)q n 6 f3 6 f (mod 9), (40) 7
8 which implies that for all n 0 PDO(48n+40) 0 (mod 9) (41) PDO(48n+16)q n 6 f3 3 f 1 (mod 9). (4) Invoking (15) in (4) extracting the terms containing odd powers of q, By (40) (43), PDO(96n+64)q n 6 f3 6 f (mod 9). (43) PDO(96n+64) PDO(4n+16) (mod 9). (44) Congruence (5) follows from (44) mathematical induction. Congruence (7) follows from (41) (5). Employing (13) in (), which yields Applying (16) (45), which implies that PDO(3n)q n = f14 4 f6 4 +4q f 4f6f 4 8 4, f 1 f8f 4 1 ff 8 1 PDO(6n)q n = f14 f 4 3 f 1 1 f 4 4f 6 PDO(6n+3)q n = 4 f f 4 3f 4 4 f 8 1f 6 PDO(6n)q n = f14 f4f 4 6 From (35), f 0 f3 10 f1 f6 8 In view of the above two identities, ( f 6 4 f 3 6 f 9 f 1 PDO(1n)q n f0 f3 10 f1 f6 8 f f 4 3 f 4 1f 6 PDO(1n)q n f f 4 3 f 4 1f 6 8 (45). (46) ) +3q f 4f 6 f1 4, f 7 (mod 9). (mod 9). (mod 9). (47)
9 Substituting (15) (16) in (47), extracting the terms containing even powers of q, we have Using (34) (35) in (48), we get PDO(4n)q n f9 f 3 3 f 9 1f q f f 5 6 f 5 1f 3 (mod 9). (48) PDO(4n+4)q n 3 f 1f f 5 6 f 3 3 (mod 9). (49) Substituting (17) in (49) using (34), we have PDO(4n+4)q n 3 f f 4f 1 f 6 3q f4 f 6 1 f 4f f 4f 1 f f 6 3q f f 4 f 5 1 f 3 6 (mod 9), which yields By (49) (51), PDO(48n+4)q n 3ψ(q)ψ(q 3 ) (mod 9) (50) PDO(48n+48)q n 3 f 1f f 5 6 f 3 3 (mod 9). (51) Employing (3) in (49) using (34), PDO((4n+4)) PDO(4n+4) (mod 9). (5) PDO(4n+4)q n 3 f6 6f9 4 3q f5 6f 9 f 18 6q f4 6f18 4 f3f 4 18 f3 3 f3f 9 3 f3 9 f 3 +6q f3 18 f 6 +3q f 3f 6 f 5 18 f 3 9 (mod 9) which implies that PDO(7n+4)q n 3 f3 3 f 1 (mod 9), (53) PDO(7n+48)q n 6 f3 6 f (mod 9) (54) 9
10 From (54), By (49) (55), PDO(7n+7)q n 3 f 1f f 5 6 f 3 3 (mod 9). (55) PDO(144n + 10) 0 (mod 9). (56) PDO(3(4n+4)) PDO(4n+4) (mod 9). (57) Congruence (6) follows from (5), (57), mathematical induction. Congruence (8) follows from (56) (6). Proof of Theorem 9. From (4), (4) (53), it is clear that for all n 0 PDO(48n+16) 6a 3 (n) (mod 9), (58) PDO(7n+4) 3a 3 (n) (mod 9). (59) Congruence (9) follows from Lemma 7 (58). Congruence (30) follows from Lemma 7 (59). For any prime p any positive integer N, let υ p (N) denote the exponent of the highest power of p dividing N. Proof of Corollary 10. Suppose α 0, p (mod 3) p n, then it is clear that ( ) ) υ p (3 p α+1 n+ pα+ 1 ( +1 = υ p 3p α+1 n+p α+) = α+1. (60) 3 Congruences (31) (3) follow from (9), (30) (60). Proof of Theorem 11. From (8) (50), we have PDO(48n+4)q n 3 Theorem 11 follows from (61). Proof of Corollary 1. By (61), k=0 m=0 PDO(48n+4)q 48n+4 3 q k(k+1)/+3m(m+1)/ (mod 9). (61) k=0 m=0 q 6(k+1) +(6m+3) (mod 9), 10
11 whichimpliesthatif48n+4isnotoftheform6(k+1) +(6m+3), thenpdo(48n+4) 0 (mod 9). Let k 1 be an integer let p i 5, 1 i k be primes with ( 3 p i ) = 1. If N is of the form x +6y, then v pi (N) is even since ( 3 p i ) = 1. Let ( N = 48 p 1p p k 1p k n+ p 1p p k 1 p k 1 ) +4 = 48p 1p p k 1p k n+4p 1p p k 1p k. If p k n, then v pk (N) is an odd number hence N is not of the form x +6y. Therefore (33) holds. 4 Congruences modulo 4 5 In this section, we establish the following infinite families of congruences modulo 16 3 for PDO(n). Theorem 13. For all nonnegative integers α n, we have PDO(4 α (1n+8)) PDO(1n+8) (mod 4 ), (6) PDO(4 α (4n+3)) 0 (mod 4 ), (63) PDO(4 α (48n+14)) 0 (mod 4 ) (64) PDO(4n+17) 0 (mod 4 ). (65) Theorem 14. For all nonnegative integers α n, we have PDO( α (1n)) PDO(1n) (mod 4 ), (66) PDO( α (7n+4)) 0 (mod 4 ) (67) PDO( α (7n+66)) 0 (mod 4 ). (68) Theorem 15. For all nonnegative integers α n, we have PDO(4 α (4n) PDO(4n) (mod 5 ), (69) PDO(9 α (6n+3)) PDO(6n+3) (mod 5 ), (70) PDO(4n+9) 0 (mod 5 ), (71) PDO(9 α (16n+117)) 0 (mod 5 ), (7) PDO( α (7n+69)) 0 (mod 5 ), (73) PDO(3 α (7n+69)) 0 (mod 5 ) (74) PDO( α (144n+4)) 0 (mod 5 ). (75) 11
12 Theorem 16. If n cannot be represented as the sum of two triangular numbers, then for all nonnegative integers α r {1,6} we have PDO( α r(1n+3)) 0 (mod 4 ). Corollary 17. If p is a prime, p 3 (mod 4)), 1 j p 1 r {1,6}, then for all nonnegative integers α,β n, we have PDO( α p β+1 r(1pn+1j +3p)) 0 (mod 4 ). (76) For example, taking p = 3, we deduce that for all α,β,n 0, Combining (77) (67), Combining (78) (68), PDO( α 3 β (16n+16)) 0 (mod 4 ) (77) PDO( α 3 β (16n+198)) 0 (mod 4 ). (78) PDO( α 3 β (7n+4)) 0 (mod 4 ). (79) PDO( α 3 β (7n+66)) 0 (mod 4 ). (80) Theorem 18. If n cannot be represented as the sum of a triangular number four times a triangular number, then for all nonnegative integers α r {1,3} we have PDO( α r(48n+30)) 0 (mod 5 ). Corollary 19. If p is any prime with p 3 (mod 4)), 1 j p 1 r {1,3}, then for all nonnegative integers α,β n, we have PDO( α p β+1 r(48pn+48j +30p)) 0 (mod 5 ). (81) For example, taking p = 3 we find that for all α,n 0 β 1, Combining (8) (75), for all α,β,n 0, PDO( α 3 β (144n+4)) 0 (mod 5 ) (8) PDO( α 3 β (144n+138)) 0 (mod 5 ). (83) PDO( α 3 β (144n+4)) 0 (mod 5 ) (84) combining (83), (73) (74), for all α,β,n 0, PDO( α 3 β (7n+69)) 0 (mod 5 ). (85) 1
13 Theorem 0. If n cannot be represented as the sum of twice a pentagonal number three times a triangular number, then for any nonnegative integer α we have PDO(4 α (4n+11)) 0 (mod 4 ). Corollary 1. For any positive integer k, let p j 5, 1 j k be primes. If ( /p j ) = 1 for every j, then for all nonnegative integers α n with p k n we have PDO(6 4 α+1 p 1p p k 1p k n+11 4 α p 1p p k) 0 (mod 4 ). Theorem. If n cannot be represented as the sum of a pentagonal number six times a triangular number, then for any nonnegative integer α we have PDO(4 α (48n+38)) 0 (mod 4 ). Corollary 3. For any positive integer k, let p j 5, 1 j k be primes. If ( /p j ) = 1 for every j, then for all nonnegative integers n with p k n we have PDO(3 4 α+ p 1p p k 1p k n+38 4 α p 1p p k) 0 (mod 4 ). Theorem 4. If n cannot be represented as the sum of a pentagonal number four times a pentagonal number, then we have PDO(4n+5) 0 (mod 5 ). Corollary 5. For any positive integer k, let p j 5, 1 j k be primes. If ( 1/p j ) = 1 for every j, then for all nonnegative integers n with p k n we have PDO(4p 1p p k 1p k n+5p 1p p k) 0 (mod 5 ). Theorem 6. If n cannot be represented as the sum of a pentagonal number sixteen times a pentagonal number, then we have PDO(4n+17) 0 (mod 5 ). Corollary 7. For any positive integer k, let p j 5, 1 j k be primes. If ( 1/p j ) = 1 for every j, then for all nonnegative integers n with p k n we have PDO(4p 1p p k 1p k n+17p 1p p k) 0 (mod 5 ). By the binomial theorem, it is easy to see that for all positive integers k m, f k m f k 1 m (mod k ). (86) 13
14 Proof of Theorem 13. Using (13), we can rewrite (4) as which yields PDO(3n+)q n = f13 4 f 6 f 1 f 11 f 4 8 From (86) with k = 3 k =, we have PDO(6n+)q n = f13 f 3 f 6 f 11 1 f q f 4f 6 f8f 4 1, f 7 PDO(6n+5)q n = 8 f f 3 f4f 4 6. f1 7 f 13 f 3 f 6 f 11 1 f 4 4 f f 3 f 6 f 3 1 (mod 3 ) Thus, f f 3 f 4 4f 6 f 7 1 f 3f 4 4f 6 f 3 1f (mod ). PDO(6n+)q n f f 3 f 6 f 3 1 (mod 4 ) PDO(6n+5)q n 8 f 3f 4 4f 6 f 3 1f (mod 5 ). Substituting (16) in the above two congruences extracting the terms containing even odd powers of q, we get PDO(1n+)q n f6 f 4 3 f 8 1f 6 PDO(1n+8)q n 6 f f 3f 6 f 6 1 PDO(1n+5)q n 8 f10 f 4 3 f 10 1 f 6 f f 4 3 f 6 8 f6 f 1 (mod 4 ), (87) (mod 4 ), (88) (mod 5 ) (89) PDO(1n+11)q n 4 f6 f 3f 6 f 8 1 4f 4 f 3 6 (mod 4 ). (90) 14
15 It follows from (90) that PDO(4n+11)q n 8f f 3 3 8f f 6 f 3 (mod 4 ) (91) PDO(4n+3) 0 (mod 4 ). (9) Employing (1) in (87) extracting the terms containing odd powers of q, which implies that PDO(4n+14)q n 8q f 1f 4 1 f 6 8qf f 3 1 (mod 4 ), PDO(48n+38)q n 8f 1 f 3 6 8f 1 f 1 f 6 (mod 4 ) (93) PDO(48n+14) 0 (mod 4 ). (94) Substituting (13) (0) in (88), extracting the terms containing even odd powers of q, we have PDO(4n+8)q n 6 f18 f3f f f3f 3 6 (mod 4 ) (95) f1 17 f4f 5 1 f 1 f 4 f 1 PDO(4n+0)q n 1 f15 f3f f6 f3f 3 4f 3 6 f1 16 f4f 3 6 f1 13 f 1 1 f7 f 6 f 1 f f3 3f 3 4 f 1 (mod 4 ). (96) Substituting (15) in (95) (96), extracting even odd powers of q, we have PDO(48n+8)q n 6 f f 4 3 f 6 PDO(48n+3)q n 6 f 1f 3f 6 f (mod 4 ), (97) (mod 4 ) (98) PDO(48n+44)q n 8f f f 4f 1 f 6 (mod 4 ). (99) 15
16 Again employing (1) in (97) extracting the terms containing odd powers of q, PDO(96n+56)q n 8q f 1f 4 1 f 6 8qf f 3 1 (mod 4 ). (100) By (99) (100), From (86), (88) (98), PDO(96n+9) 0 (mod 4 ) (101) PDO(19n+56) 0 (mod 4 ). (10) PDO(48n+3) PDO(1n+8) (mod 4 ). (103) Congruence (6) follows from (103) mathematical induction. Congruence (63) follows from (9), (101), (6). Similarly, congruence (64) follows from (94), (10), (6). By invoking (11) in (89) extracting the terms containing even odd powers of q, PDO(4n+5)q n 8 f 1f 5 4 f 8 8f 1 f 4 (mod 5 ) (104) Congruence (65) follows from (105). PDO(4n+17)q n 16 f 1f f 8 f 4 16f 1 f 16 (mod 5 ). (105) Proofs of Theorem 14 Theorem 15. From (86), f f 4 3f 4 4 f 8 1f 6 f4 3f 4 4 f f 6 (mod 3 ). (106) Using (106), we rewrite (46) as PDO(6n+3)q n 4 f4 3f 4 4 f f 6 (mod 5 ). (107) In view of (7) (8), PDO(6n+3)q n 4ψ (q )φ ( q 3 ) (mod 5 ). (108) Substituting () in (108) extracting the terms involving q 3n+1, we get PDO(18n+9)q n 4qψ (q 6 )φ ( q) (mod 5 ). (109) 16
17 Using (1) in (109) extracting the terms involving q 3n+1, PDO(54n+7)q n 4ψ (q )φ ( q 3 ) (mod 5 ). (110) Congruence (70) follows from (108), (110), mathematical induction. Applying (1) in (107) using (86), PDO(6n+3)q n 4 f4 4f q 3f4 4f4 4 ff 6f ff 1 4 f4 4f 1 f f q 3f 8f 48 f 4 f 4 (mod 5 ) which implies that Congruence (71) follows from (11). From (11) (8), PDO(1n+3)q n 4 f4 f 6 f 1f 4 3 (mod 5 ) (111) PDO(1n+9)q n 16q f 4f 4 f f 1 (mod 5 ). (11) PDO(4n+1)q n 16ψ(q)ψ(q 6 ) (mod 5 ). (113) Invoking () in (113) extracting the terms containing q 3n+ q 3n+1, for all n 0 PDO(7n+69) 0 (mod 5 ) (114) PDO(7n+45)q n 16ψ(q )ψ(q 3 ) (mod 5 ). (115) Using () in (115) extracting the terms containing q 3n+1, Congruence (7) follows from (70) (116). PDO(16n+117) 0 (mod 5 ). (116) 17
18 Substituting (11) (13) in (111), extracting the terms containing odd powers of q, we get PDO(4n+15)q n 8 f f6 14 f8 +16q f5 4f6f 1 4 f 1 f3 1 f 4 f1 4 f 1 f3f 8 8 8ψ(q)ψ(q 4 )+16qψ(q)ψ(q 1 ) (mod 5 ). (117) Employing () in (117) extracting the terms involving q 3n+, we get PDO(7n+63)q n 16ψ(q 3 )ψ(q 4 )+8qψ(q 3 )ψ(q 1 ) (mod 5 ). (118) Again, extracting the terms involving q 3n+ in (118), we get PDO(16n+07) 0 (mod 5 ). (119) Congruence (74) follows from (114), (119), (70). Substituting (1) (13) in (45), extracting the terms containing even powers of q, we find PDO(1n)q n f38 f6 10 f1 8 f3f f 4 1 f4 1f 6 f 4 1 f 4 3f 4 4f 6 6 (mod 4 ). (10) Using (1) (13) in (10), extracting the terms containing even powers of q, we have From (10) (11), PDO(4n)q n f4 1ff f3 0 f4f f4 1f 6 f 4 1 f 4 3f 4 4f 6 6 (mod 4 ). (11) PDO((1n)) PDO(1n) (mod 4 ). (1) Congruence (66) follows from (1) mathematical induction. Substituting (0) (13) in (45), using (86), we get PDO(6n)q n = f3 4 f 4 1 f 4 f8 10 f4 +16q f8 4f 6 8f 4 1 f 16 f 4 +64q 4f 4f 6f 10 8 f 4 f 14 f 1 +3q 3f14 4 f6f 8f 4 f 18 f1 +4q f6 4 f6f 4 f f8f q f17 4 f 6 f 1 f 19 +4q f9 4 f 6 f 1 f 3 f 8 8 f8 f4 16 f q f f8 10 f 8f q f 4f6f 8f 4 ff qf4f 8 +4qf f 4 f 6 f 1 (mod 5 ), +8q f0 4 f 4 1 f 0 f 8f 4 +64q 3f5 4f 6 f 8 8f 1 f 15 18
19 which yields PDO(1n)q n f8 1f 16 f 4 6 f 10 4 f 1 +16qf 4f 8 +4q f f 3f 4f 1 f 6 1f 6 (mod 5 ) (13) PDO(1n+6)q n 8ff 4 +4f 1 f f 3 f 6 (mod 5 ). (14) Substituting (18) in (14) extracting the terms containing even odd powers of q, we get PDO(4n+6)q n 4 f 1f4f f f 1f f 1 (mod 5 ) (15) By (86) (8), In view of above identities, PDO(4n+18)q n 4 f4 f 3f 1 f 4f 6 4 f 1f 4f 4 6 f f 1 f 4 f 3f 1 f 4f 6 ψ (q 3 ) (mod ) +8f 1f 4ψ (q) (mod 4 ). (mod 5 ). (16) PDO(4n+6)q n 4ψ (q) (mod 4 ) (17) PDO(4n+18)q n 4ψ (q 3 ) (mod 4 ). (18) It follows from (18) that PDO(7n+4) 0 (mod 4 ) (19) for all n 0 PDO(7n+66) 0 (mod 4 ) (130) PDO(7n+18)q n 4ψ (q) (mod 4 ). (131) 19
20 Employing (10) in (15) (16) extracting the terms containing odd powers of q, we get PDO(48n+30)q n 8 f f 4 3f 8 f 1 f 4 f 6 In view of (133), we have for all n f3 1f 8 f 4 8ψ(q)ψ(q 4 ) (mod 5 ) (13) PDO(48n+4)q n 8q f4 1f 6f 4 f f 3 f 1 8qψ(q 3 )ψ(q 1 ) (mod 5 ). (133) PDO(144n+4) 0 (mod 5 ) (134) PDO(144n+138) 0 (mod 5 ) (135) PDO(144n+90)q n 8ψ(q)ψ(q 4 ) (mod 5 ). (136) Substituting (1), (13), (0) in (13), extracting the terms containing even odd powers of q, we get PDO(4n)q n f1 1 f 10 f3 4 f4f 8 6 f4 3f 8 4 f 0 1 f 6 f 6 +16q f0 1 f 4 3f 8 4 f 14 f 6 +16q f8 f4f q f17 f 6 f 1 f1 13 f 3 f 1 f1 16 f qf q f3 1f 3 4f 1 f 3 +8qf f 4 f 6 f 1 (mod 5 ) (137) PDO(4n+1)q n 8 f16 1 f 4 3 f f 6 +4 f 0 f f f1 17 f 3 f f 4f f 4 4 f6 4 +8f f 1 f 3 f 4 f f 4 (mod 5 ). (138) 1 Employing (19) in (138) extracting the terms involving even odd powers of q, we get PDO(48n+1)q n 4 f 1f4f f f 1f f 1 (mod 5 ) (139) PDO(48n+36)q n 4 f4 f 3f 1 f 4f 6 (mod 5 ). (140) 0
21 In view of (15), (16), (139), (140), we have PDO((4n+6)) PDO(4n+6) (mod 5 ) (141) PDO((4n+18)) PDO(4n+18) (mod 5 ). (14) Congruence (67) follows from (19), (14), (66). Congruence (68) follows from (130), (14), (66). Substituting (13), (14), (0) in (137), extracting even odd powers of q, we get PDO(48n)q n f7 f 4 6 f1 7 f4 18 f1 +4q f66 f 3f 1 f1 70 f4 14 f6 48q f 1f f 4 6 f 3 f8 f6 4 +4q f f3f 4f 1 +16qf f1f 8 4f 1 f1f 6 6 f 4 f 6 f 1 (mod 5 ) (143) PDO(48n+4)q n 4 f69 f 3 f 6 f1 71 f f60 f 4 6 f1 68 f4 10 f1 +8f 1 f f 3 f 6 1f 1 f f 3 f 6 +16f f 4 (mod 5 ). (144) Substituting (18) in (144) extracting the terms containing even odd powers of q, we get PDO(96n+4)q n 4 f 1f4f f f 1f f 1 (mod 5 ) (145) From (16) (146), we have PDO(96n+7)q n 1 f4 f 3f 1 f 4f 4 6 (mod 5 ). (146) PDO( (4n+18)) 3PDO(4n+18) (mod 5 ). (147) Employing (10) in (145) extracting the terms containing odd powers of q, we get PDO(19n+10)q n 8 f f3f 4 8 8ψ(q)ψ(q 4 ) (mod 5 ). (148) f 1 f 4 f6 Substituting (13) (0) in (143), extracting the terms containing even odd power of q, we have PDO(96n)q n f6 f 4 3 f 0 1 f 8 4f 6 f4 3f 8 4 f 0 1 f 6 f 6 +16q f f 4 3f 8 4 f 1 1 f 6 +16q f8 f 3 4f 4 6 f 13 +8q f17 f 6 f 1 1 f 3 f 1 f1 16 f qf q f3 1f 3 4f 1 f 3 +8qf f 4 f 6 f 1 (mod 5 ) (149) 1
22 PDO(96n+48)q n 8 f4 3f 14 f1 16 f6 +4 f 0 f f f1 17 f 3 f4f 5 1 f f 3 f 6 1 By (149) (137) 8ff 4 f 4 +4 f f 1 f f 3 f 6 (mod 5 ). (150) f 1 f 3 f 4 f 1 PDO(4(4n)) PDO(4n) (mod 5 ). (151) Congruence (69) follows from (151) mathematical induction. By substituting (19) (18) in (150), extracting the terms containing even odd powers of q, PDO(19n+48)q n 8f 1f +0 f 1f 4f 4 6 f f 1 From (15) (15), In view of (16) (153), PDO(19n+144)q n 1 f4 f 3f 1 f 4f 6 (mod 5 ) (15) (mod 5 ). (153) PDO( 3 (4n+6)) 3PDO(4n+6) (mod 5 ). (154) PDO( 3 (4n+18)) 3PDO(4n+18) (mod 5 ). (155) Congruence (73) follows from (114), (135), (14), (147), (155), (69). Congruence (75) follows from (134), (14), (147), (155), (69). Proof of Theorem 16. Using (86) (8) in (111), PDO(1n+3)q n 4ψ (q) (mod 4 ). (156) From (156), (17), (141) (66), PDO( α (4n+6))q n 4ψ (q) (mod 4 ) (157) From (131), (141) (66), PDO( α (7n+18))q n { 4ψ (q) (mod 4 ), if α = 0; 4ψ (q) (mod 4 ), if α 0. (158)
23 Combining (156), (157), (158), ( 1) r+1 4 q k(k+1)/+m(m+1)/ (mod 4 ), if α = 0; PDO( α r(1n+3))q n k,m=0 ( 1) r 4 q k(k+1)/+m(m+1)/ (mod 4 ), if α 0. k,m=0 Theorem 16 follows from (159). Proof of Theorem 18. From (13), (141), (148), (154) (69), we have (159) PDO( α (48n+30))q n 8ψ(q)ψ(q 4 ) (mod 5 ). (160) From (136), (14), (147), (155) (69), we have { PDO( α (144n+90))q n 8ψ(q)ψ(q 4 ) (mod 5 ), if α = 0; 8ψ(q)ψ(q 4 ) (mod 5 ), if α 0. (161) Theorem 18 follows from (160) (161). Proofs of Theorems 0,, 4 6. From (99), PDO(96n+44)q n 8f f 6 f 3 (mod 4 ). (16) Replacing n by 8n+3 in (6), we see that for all α,n 0, In view of (8), (91), (16) (163), PDO(4 α (96n+44)) PDO(96n+44) (mod 4 ). (163) PDO(4 α (4n+11)q n 8f ψ(q 3 ) (mod 4 ). (164) Theorem 0 follows from (164). From (100), PDO(19n+15)q n 8f 1 f 1 f 6 (mod 4 ). (165) Replacing n by 16n+1 in (6), we see that for all α,n 0, PDO(4 α (19n+15)) PDO(19n+15) (mod 4 ). (166) 3
24 In view of (8), (93), (165) (166), PDO(4 α (48n+38)q n 8f 1 ψ(q 6 ) (mod 4 ). (167) Theorem follows from (167). Theorem 4 follows from (9) (104). Theorem 6 follows from (9) (105). The proofs of Corollaries 17, 19, 1, 3, 5 7 are similar to the proof of Corollary 1; hence we omit the details. Proof of Theorem 1. Replacing n by n+1 in (8), PDO( α+ 3 β (7n+66)) 0 (mod 9). (168) Congruence (5) follows readily from (80) (168). Replacing n by 4n+3 in (8), PDO( α+ 3 β (144n+138)) 0 (mod 9). (169) Congruence (6) follows readily from (83) (169). 5 Acknowledgments The authors would like to thank the anonymous referee for his/her valuable comments suggestions. The second author was supported by CSIR Senior Research Fellowship (No. 09/039(0111)/014-EMR-I). References [1] G. E. Andrews, R. P. Lewis, J. Lovejoy, Partitions with designated summs, Acta Arith. 10 (00), [] B. C. Berndt, Ramanujan s Notebooks, Part III, Springer-Verlag, [3] N. D. Baruah K. K. Ojah, Partitions with designated summs in which all parts are odd, Integers 15 (015), #A9. [4] N. D. Baruah K. K. Ojah, Analogues of Ramanujan s partition identities congruences arising from his theta functions modular equations, Ramanujan J. 8 (01), [5] W. Y. C. Chen, K. Q. Ji, H. T. Jin, E. Y. Y. Shen, On the number of partitions with designated summs, J. Number Theory 133 (013),
25 [6] M. D. Hirschhorn, F. Garvan, J. Borwein, Cubic analogue of the Jacobian cubic theta function θ(z, q), Canad. J. Math. 45 (1993), [7] M. D. Hirschhorn J. A. Sellers, Elementary proofs of various facts about 3-cores, Bull. Aust. Math. Soc. 79 (009), [8] M. D. Hirschhorn J. A. Sellers, A congruence modulo 3 for partitions into distinct non-multiples of four, J. Integer Sequences 17 (014), Article [9] W. J. Keith, Congruences for 9-regular partitions modulo 3, Ramanujan J. 35 (014), [10] B. L. S. Lin A. Y. Z. Wang, Generalisation of Keith s conjecture on 9-regular partitions 3-cores, Bull. Aust. Math. Soc. 90 (014), [11] E. X. W. Xia, Arithmetic properties of partitions with designated summs, J. Number Theory 159 (016) Mathematics Subject Classification: Primary 11P83; Secondary 05A17. Keywords: partition with designated summ, congruence, theta function. (Concerned with sequences A07785 A10186.) Received October 5 016; revised version received January ; January Published in Journal of Integer Sequences, January Return to Journal of Integer Sequences home page. 5
Ramanujan-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 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 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 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 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 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 informationZhanjiang , People s Republic of China
Math. Comp. 78(2009), no. 267, 1853 1866. COVERS OF THE INTEGERS WITH ODD MODULI AND THEIR APPLICATIONS TO THE FORMS x m 2 n AND x 2 F 3n /2 Ke-Jian Wu 1 and Zhi-Wei Sun 2, 1 Department of Mathematics,
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 informationAssignment 2. Due: Monday Oct. 15, :59pm
Introduction To Discrete Math Due: Monday Oct. 15, 2012. 11:59pm Assignment 2 Instructor: Mohamed Omar Math 6a For all problems on assignments, you are allowed to use the textbook, class notes, and other
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 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 informationCombinatorial Expressions Involving Fibonacci, Hyperfibonacci, and Incomplete Fibonacci Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 17 (2014), Article 14.4.3 Combinatorial Expressions Involving Fibonacci, Hyperfibonacci, and Incomplete Fibonacci Numbers Hacène Belbachir and Amine
More informationWilson s Theorem and Fermat s Theorem
Wilson s Theorem and Fermat s Theorem 7-27-2006 Wilson s theorem says that p is prime if and only if (p 1)! = 1 (mod p). Fermat s theorem says that if p is prime and p a, then a p 1 = 1 (mod p). Wilson
More informationNovember 28, Western Washington University. Ramanujan s Congruences. Bryan Clark, Lesley Lowery, Nhan Nguyen. Introduction. History.
Western Washington University November 28, 2012 Srinivasa Ramanujan Srinivasa Ramanujan (22 December 1887-26 April 1920) Srinivasa Ramanujan Considered to have no formal training in pure mathematics Srinivasa
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 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 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 informationON THE EQUATION a x x (mod b) Jam Germain
ON THE EQUATION a (mod b) Jam Germain Abstract. Recently Jimenez and Yebra [3] constructed, for any given a and b, solutions to the title equation. Moreover they showed how these can be lifted to higher
More informationMinimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field
Minimal generating sets of Weierstrass semigroups of certain m-tuples on the norm-trace function field Gretchen L. Matthews and Justin D. Peachey Abstract. The norm-trace function field is a generalization
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
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 informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem 8-3-2014 The Chinese Remainder Theorem gives solutions to systems of congruences with relatively prime moduli The solution to a system of congruences with relatively prime
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 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 informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
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 informationSOLUTIONS FOR PROBLEM SET 4
SOLUTIONS FOR PROBLEM SET 4 A. A certain integer a gives a remainder of 1 when divided by 2. What can you say about the remainder that a gives when divided by 8? SOLUTION. Let r be the remainder that a
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 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 informationUnique Sequences Containing No k-term Arithmetic Progressions
Unique Sequences Containing No k-term Arithmetic Progressions Tanbir Ahmed Department of Computer Science and Software Engineering Concordia University, Montréal, Canada ta ahmed@cs.concordia.ca Janusz
More informationby Michael Filaseta University of South Carolina
by Michael Filaseta University of South Carolina Background: A covering of the integers is a system of congruences x a j (mod m j, j =, 2,..., r, with a j and m j integral and with m j, such that every
More informationON SPLITTING UP PILES OF STONES
ON SPLITTING UP PILES OF STONES GREGORY IGUSA Abstract. In this paper, I describe the rules of a game, and give a complete description of when the game can be won, and when it cannot be won. The first
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 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 information50. 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 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 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 informationFORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS
FORBIDDEN INTEGER RATIOS OF CONSECUTIVE POWER SUMS IOULIA N. BAOULINA AND PIETER MOREE To the memory of Prof. Wolfgang Schwarz Abstract. Let S k (m) := 1 k + 2 k +... + (m 1) k denote a power sum. In 2011
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 informationLECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI
LECTURE 7: POLYNOMIAL CONGRUENCES TO PRIME POWER MODULI 1. Hensel Lemma for nonsingular solutions Although there is no analogue of Lagrange s Theorem for prime power moduli, there is an algorithm for determining
More informationNumber Theory - Divisibility Number Theory - Congruences. Number Theory. June 23, Number Theory
- Divisibility - Congruences June 23, 2014 Primes - Divisibility - Congruences Definition A positive integer p is prime if p 2 and its only positive factors are itself and 1. Otherwise, if p 2, then p
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 informationIn this paper, we discuss strings of 3 s and 7 s, hereby dubbed dreibens. As a first step
Dreibens modulo A New Formula for Primality Testing Arthur Diep-Nguyen In this paper, we discuss strings of s and s, hereby dubbed dreibens. As a first step towards determining whether the set of prime
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 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 informationPerfect Difference Families and Related Variable-Weight Optical Orthogonal Codess
Perfect Difference Families and Related Variable-Weight Optical Orthogonal Codess D. Wu, M. Cheng, Z. Chen Department of Mathematics Guangxi Normal University Guilin 541004, China Abstract Perfect (v,
More informationBAND SURGERY ON KNOTS AND LINKS, III
BAND SURGERY ON KNOTS AND LINKS, III TAIZO KANENOBU Abstract. We give two criteria of links concerning a band surgery: The first one is a condition on the determinants of links which are related by a band
More informationA FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 6 No. 1 (2017), pp. 39-46. c 2017 University of Isfahan www.combinatorics.ir www.ui.ac.ir A FAMILY OF t-regular SELF-COMPLEMENTARY
More informationDedekind Sums with Arguments Near Euler s Number e
1 47 6 11 Journal of Integer Sequences, Vol. 1 (01), Article 1..8 Dedeind Sums with Arguments Near Euler s Number e Kurt Girstmair Institut für Mathemati Universität Innsbruc Technierstr. 1/7 A-600 Innsbruc
More informationWhat is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?
Chapter 5. Counting 5.1 The Basic of Counting What is counting? (how many ways of doing things) combinations: how many possible ways to choose 4 people from 10? how many license plates that start with
More informationDegree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS
Degree project NUMBER OF PERIODIC POINTS OF CONGRUENTIAL MONOMIAL DYNAMICAL SYSTEMS Author: MD.HASIRUL ISLAM NAZIR BASHIR Supervisor: MARCUS NILSSON Date: 2012-06-15 Subject: Mathematics and Modeling Level:
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 informationSection Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement
More informationA REMARK ON A PAPER OF LUCA AND WALSH 1. Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China. Min Tang 2.
#A40 INTEGERS 11 (2011) A REMARK ON A PAPER OF LUCA AND WALSH 1 Zhao-Jun Li Department of Mathematics, Anhui Normal University, Wuhu, China Min Tang 2 Department of Mathematics, Anhui Normal University,
More informationMath 255 Spring 2017 Solving x 2 a (mod n)
Math 255 Spring 2017 Solving x 2 a (mod n) Contents 1 Lifting 1 2 Solving x 2 a (mod p k ) for p odd 3 3 Solving x 2 a (mod 2 k ) 5 4 Solving x 2 a (mod n) for general n 9 1 Lifting Definition 1.1. Let
More informationSolutions for the Practice Questions
Solutions for the Practice Questions Question 1. Find all solutions to the congruence 13x 12 (mod 35). Also, answer the following questions about the solutions to the above congruence. Are there solutions
More informationYet Another Triangle for the Genocchi Numbers
Europ. J. Combinatorics (2000) 21, 593 600 Article No. 10.1006/eujc.1999.0370 Available online at http://www.idealibrary.com on Yet Another Triangle for the Genocchi Numbers RICHARD EHRENBORG AND EINAR
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 informationThree Pile Nim with Move Blocking. Arthur Holshouser. Harold Reiter.
Three Pile Nim with Move Blocking Arthur Holshouser 3600 Bullard St Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@emailunccedu
More informationThe congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.
Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us
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 informationVariations on a Theme of Sierpiński
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 10 (2007), Article 07.4.4 Variations on a Theme of Sierpiński Lenny Jones Department of Mathematics Shippensburg University Shippensburg, Pennsylvania
More informationDistribution of Aces Among Dealt Hands
Distribution of Aces Among Dealt Hands Brian Alspach 3 March 05 Abstract We provide details of the computations for the distribution of aces among nine and ten hold em hands. There are 4 aces and non-aces
More informationNIM Games: Handout 1
NIM Games: Handout 1 Based on notes by William Gasarch 1 One-Pile NIM Games Consider the following two-person game in which players alternate making moves. There are initially n stones on the board. During
More information1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
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 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 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 informationTHE ASSOCIATION OF MATHEMATICS TEACHERS OF NEW JERSEY 2018 ANNUAL WINTER CONFERENCE FOSTERING GROWTH MINDSETS IN EVERY MATH CLASSROOM
THE ASSOCIATION OF MATHEMATICS TEACHERS OF NEW JERSEY 2018 ANNUAL WINTER CONFERENCE FOSTERING GROWTH MINDSETS IN EVERY MATH CLASSROOM CREATING PRODUCTIVE LEARNING ENVIRONMENTS WEDNESDAY, FEBRUARY 7, 2018
More informationA CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES
Last update: Nov. 6, 2015. A CONJECTURE ON UNIT FRACTIONS INVOLVING PRIMES Zhi-Wei Sun Department of Mathematics, Nanjing University Nanjing 210093, People s Republic of China zwsun@nju.edu.cn http://math.nju.edu.cn/
More information17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
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 informationModular Arithmetic. Kieran Cooney - February 18, 2016
Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.
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 informationPermutations of a Multiset Avoiding Permutations of Length 3
Europ. J. Combinatorics (2001 22, 1021 1031 doi:10.1006/eujc.2001.0538 Available online at http://www.idealibrary.com on Permutations of a Multiset Avoiding Permutations of Length 3 M. H. ALBERT, R. E.
More informationA Compendium of BBP-Type Formulas for Mathematical Constants
A Compendium of BBP-Type Formulas for Mathematical Constants David H. Bailey August 5, 207 Abstract A 996 paper by the author, Peter Borwein and Simon Plouffe showed that any mathematical constant given
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 information6.2 Modular Arithmetic
6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through
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 information9.5 Counting Subsets of a Set: Combinations. Answers for Test Yourself
9.5 Counting Subsets of a Set: Combinations 565 H 35. H 36. whose elements when added up give the same sum. (Thanks to Jonathan Goldstine for this problem. 34. Let S be a set of ten integers chosen from
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 informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
More informationSec$on Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Sec$on Summary Permutations Combinations Combinatorial Proofs 2 Coun$ng ordered arrangements Ex: How many ways can we select 3 students from a group of 5 students to stand in line for a picture?
More informationThe Sign of a Permutation Matt Baker
The Sign of a Permutation Matt Baker Let σ be a permutation of {1, 2,, n}, ie, a one-to-one and onto function from {1, 2,, n} to itself We will define what it means for σ to be even or odd, and then discuss
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More informationConjectures and Results on Super Congruences
Conjectures and Results on Suer Congruences Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn htt://math.nju.edu.cn/ zwsun Feb. 8, 2010 Part A. Previous Wor by Others What are
More informationCHAPTER 2. Modular Arithmetic
CHAPTER 2 Modular Arithmetic In studying the integers we have seen that is useful to write a = qb + r. Often we can solve problems by considering only the remainder, r. This throws away some of the information,
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 informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
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 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 informationGauss and AGM. Burton Rosenberg. January 30, 2004
Gauss and AGM Burton Rosenberg January 3, 24 Introduction derivation of equation. what has it to do w/ the lemniscate agm properties of I elliptic integrals The Elliptic Integral of the First Kind Define
More informationDISCRETE STRUCTURES COUNTING
DISCRETE STRUCTURES COUNTING LECTURE2 The Pigeonhole Principle The generalized pigeonhole principle: If N objects are placed into k boxes, then there is at least one box containing at least N/k of the
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 informationand problem sheet 7
1-18 and 15-151 problem sheet 7 Solutions to the following five exercises and optional bonus problem are to be submitted through gradescope by 11:30PM on Friday nd November 018. Problem 1 Let A N + and
More informationSolutions to the 2004 CMO written March 31, 2004
Solutions to the 004 CMO written March 31, 004 1. Find all ordered triples (x, y, z) of real numbers which satisfy the following system of equations: xy = z x y xz = y x z yz = x y z Solution 1 Subtracting
More informationOn Variations of Nim and Chomp
arxiv:1705.06774v1 [math.co] 18 May 2017 On Variations of Nim and Chomp June Ahn Benjamin Chen Richard Chen Ezra Erives Jeremy Fleming Michael Gerovitch Tejas Gopalakrishna Tanya Khovanova Neil Malur Nastia
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 informationAvoiding consecutive patterns in permutations
Avoiding consecutive patterns in permutations R. E. L. Aldred M. D. Atkinson D. J. McCaughan January 3, 2009 Abstract The number of permutations that do not contain, as a factor (subword), a given set
More informationp 1 MAX(a,b) + MIN(a,b) = a+b n m means that m is a an integer multiple of n. Greatest Common Divisor: We say that n divides m.
Great Theoretical Ideas In Computer Science Steven Rudich CS - Spring Lecture Feb, Carnegie Mellon University Modular Arithmetic and the RSA Cryptosystem p- p MAX(a,b) + MIN(a,b) = a+b n m means that m
More information