Results 1 to 10 of about 50 (48)
Integer partitions into Diophantine pairs
Quaestiones Mathematicae, 2017 Let n, a and b be positive integers. The pair (a; b) is called an integer partition of n into Diophantine pair if n = a+b, ab+1 is a perfect square and a > b.
Bouroubi, S +4 more
exaly +1 more source
New infinite families of congruences for Andrews’ (K, I)-singular overpartitions
Quaestiones Mathematicae, 2018 In a recent work, Andrews dened the singular overpartition functions, denoted by C̄k;i(n), which count the number of overpartitions of n in which no part is divisible by k and only parts ≡±i (mod k) may be overlined.
Xiaorong Li, Olivia X M Yao
exaly +1 more source
Counting certain quadratic partitions of zero modulo a prime number
Open Mathematics, 2021 Consider an odd prime number p≡2(mod3)p\equiv 2\hspace{0.3em}\left(\mathrm{mod}\hspace{0.3em}3). In this paper, the number of certain type of partitions of zero in Z/pZ{\mathbb{Z}}\hspace{-0.1em}\text{/}\hspace{-0.1em}p{\mathbb{Z}} is calculated using a ...
Xiao Wang, Li Aihua
doaj +1 more source
The false theta functions of Rodgers and their modularity
Bulletin of the London Mathematical Society, Volume 53, Issue 4, Page 963-980, August 2021., 2021 Abstract In this survey article, we explain how false theta functions can be embedded into a modular framework and show some of the applications of this modularity.
Kathrin Bringmann
wiley +1 more source
Ramanujan-type congruences modulo 4 for partitions into distinct parts
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2022 In this paper, we consider the partition function Q(n) counting the partitions of n into distinct parts and investigate congruence identities of the form Q(p⋅n+p2-124)≡0 (mod4),Q\left( {p \cdot n + {{{p^2} - 1} \over {24}}} \right) \equiv 0\,\,\,\left(
Merca Mircea
doaj +1 more source
Some congruences for 3-component multipartitions
Open Mathematics, 2016 Let p3(n) denote the number of 3-component multipartitions of n. Recently, using a 3-dissection formula for the generating function of p3(n), Baruah and Ojah proved that for n ≥ 0, p3(9n + 5) ≡ 0 (mod 33) and p3 (9n + 8) ≡ 0 (mod 34).
Zhao Tao Yan, Jin Lily J., Gu C.
doaj +1 more source
Parity results for broken 11-diamond partitions
Open Mathematics, 2019 Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition functions by using Hecke operators. In this note, we establish new parity results for broken 11-diamond partition functions.
Wu Yunjian
doaj +1 more source
On the existence of a non‐zero lower bound for the number of Goldbach partitions of an even integer
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 15, Page 789-798, 2004., 2004 The Goldbach partitions of an even number, given by the sums of two prime addends, form the nonempty set for all integers 2n with 2 ≤ n ≤ 2 × 1014. It will be shown how to determine by the method of induction the existence of a non‐zero lower bound for the number of Goldbach partitions of all even integers greater than or equal to 4.
Simon Davis
wiley +1 more source
Arithmetic properties for Andrews’ (48,6)- and (48,18)-singular overpartitions
Open Mathematics, 2019 Singular overpartition functions were defined by Andrews. Let Ck,i(n) denote the number of (k, i)-singular overpartitions of n, which counts the number of overpartitions of n in which no part is divisible by k and only parts ±i (mod k) may be overlined ...
Liu Eric H., Du Wenjing
doaj +1 more source
Congruences in ordered pairs of partitions
International Journal of Mathematics and Mathematical Sciences, Volume 2004, Issue 47, Page 2509-2512, 2004., 2004 Dyson defined the rank of a partition (as the first part minus the number of parts) whilst investigating certain congruences in the sequence p−1(n). The rank has been widely studied as have been other statistics, such as the crank. In this paper a “birank” is defined which relates to ordered pairs of partitions, and is used in an elementary proof of a ...
Paul Hammond, Richard Lewis
wiley +1 more source