English
Related papers

Related papers: Certain Diophantine equations and new parity resul…

200 papers

We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…

Number Theory · Mathematics 2023-06-01 Azizul Hoque

Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Recently, Fortin-Jacob-Mathieu and Hirschhorn-Sellers independently obtained 2-, 3- and 4-dissections of the generating function for $\overline{p}(n)$ and derived a number of…

Combinatorics · Mathematics 2014-08-08 William Y. C. Chen , Qing-Hu Hou , Lisa H. Sun , Li Zhang

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Combinatorics · Mathematics 2012-03-21 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

We investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…

Number Theory · Mathematics 2022-04-07 Michael Hanson , Jeremiah Smith

Let $B_k$ denote the $k^{th}$ term of balancing sequence. In this paper we find all positive integer solutions of the Diophantine equation $B_n+B_m = x^q$ in variables $(m, n,x,q)$ under the assumption $n\equiv m \pmod 2$. Furthermore, we…

Number Theory · Mathematics 2023-08-21 Pritam Kumar Bhoi , Sudhansu Sekhar Rout , Gopal Krishna Panda

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

Number Theory · Mathematics 2023-12-15 Yuhui Liu

Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…

Number Theory · Mathematics 2025-05-01 Suparno Ghoshal , Arijit Jana

We consider the equality of the values of the $n$th and $k$th elementary symmetric polynomials of $n$ not necessarily distinct positive integers. For $k < n$, we prove that this equation always has a solution, but only finitely many…

Number Theory · Mathematics 2026-01-21 Sándor Z. Kiss , Csaba Sándor , Maciej Zakarczemny

For the past several years, numerous authors have studied POD and PED partitions from a variety of perspectives. These are integer partitions wherein the odd parts must be distinct (in the case of POD partitions) or the even parts must be…

Number Theory · Mathematics 2025-04-21 James A. Sellers , Nicolas Allen Smoot

Recently, Hajdu and S\'{a}rk\"{o}zy studied the multiplicative decompositions of polynomial sequences. In particular, they showed that when $k \geq 3$, each infinite subset of $\{x^k+1: x \in \mathbb{N}\}$ is multiplicatively irreducible.…

Number Theory · Mathematics 2025-04-22 Chi Hoi Yip

If A is a set of nonnegative integers containing 0, then there is a unique nonempty set B of nonnegative integers such that every positive integer can be written in the form a+b, where a\in A and b\in B, in an even number of ways. We…

Number Theory · Mathematics 2010-03-04 Joshua N. Cooper , Dennis Eichhorn , Kevin O'Bryant

For a positive integer n, let {\theta}(n) denote the smallest positive integer b such that for each system S \subseteq {x_i \cdot x_j=x_k, x_i+1=x_k: i,j,k \in {1,...,n}} which has a solution in positive integers x_1,...,x_n and which has…

Number Theory · Mathematics 2017-04-09 Apoloniusz Tyszka

In 2022, Broudy and Lovejoy extensively studied the function $S(n)$ which counts the number of overpartitions of \emph{Schur-type}. In particular, they proved a number of congruences satisfied by $S(n)$ modulo $2$, $4$, and $5$. In this…

Number Theory · Mathematics 2023-08-15 Shane Chern , Robson da Silva , James A. Sellers

Let $T_{\ell,k}(n)$ denote the number of $\ell$-regular $k$-tuple partitions of $n$. In a recent work, Nath, Saikia, and Sarma derived several families of congruences for $T_{\ell,k}(n)$, with particular emphasis on the cases $T_{2,3}(n)$…

Number Theory · Mathematics 2025-03-18 Bishnu Paudel , James A. Sellers , Haiyang Wang

Let $(P_n)_{n\ge 0}$ and $(Q_n )_{n\ge 0}$ be the Pell and Pell-Lucas sequences. Let $b$ be a positive integer such that $b\ge 2.$ In this paper, we prove that the following two Diophantine equations $P_{n}=b^{d}P_{m}+Q_{k}$ and…

Number Theory · Mathematics 2024-06-25 Kouèssi Norbert Adédji , Marija Bliznac Trebješanin

In 2012 Paule and Radu proved a difficult family of congruences modulo powers of 5 for Andrews' 2-colored generalized Frobenius partition function. The family is associated with the classical modular curve of level 20. We demonstrate the…

Number Theory · Mathematics 2024-08-06 Frank G. Garvan , James A. Sellers , Nicolas Allen Smoot

We investigate the integer solutions of Diophantine equations related to perfect numbers. These solutions generalize the example, found by Descartes in 1638, of an odd, ``spoof'' perfect factorization $3^2\cdot 7^2\cdot 11^2\cdot 13^2\cdot…

Number Theory · Mathematics 2020-06-19 BYU Computational Number Theory Group

Congruences are found modulo powers of 5, 7 and 13 for Andrews' smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan's partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit…

Number Theory · Mathematics 2010-11-10 F. G. Garvan

Let $\mathrm{pod}_{-3}(n)$ denote the number of partition triples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-3}(n)$ involving the following infinite family of…

Number Theory · Mathematics 2015-07-13 Liuquan Wang

We find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5…

Combinatorics · Mathematics 2007-05-23 William Y. C. Chen , Kathy Q. Ji , Herbert S. Wilf
‹ Prev 1 4 5 6 7 8 10 Next ›