Related papers: On a restricted linear congruence

Consider the linear congruence equation $x_1+\ldots+x_k \equiv b\,(\text{mod } n)$ for $b,n\in\mathbb{Z}$. By $(a,b)_s$, we mean the largest $l^s\in\mathbb{N}$ which divides $a$ and $b$ simultaneously. For each $d_j|n$, define…

In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the linear congruence $a_1x_1+\cdots +a_kx_k\equiv b \pmod{n}$, with…

Consider the linear congruence equation $${a_1^{s}x_1+\ldots+a_k^{s} x_k \equiv b\,(\text{mod } n^s)}\text { where } a_i,b\in\mathbb{Z},s\in\mathbb{N}$$ Denote by $(a,b)_s$ the largest $l^s\in\mathbb{N}$ which divides $a$ and $b$…

In this article, we consider systems of linear congruences in several variables and obtain necessary and sufficient conditions as well as explicit expressions for the number of solutions subject to certain restriction conditions. These…

We address three questions posed by Bibak \cite{KB20}, and generalize some results of Bibak, Lehmer and K G Ramanathan on solutions of linear congruences $\sum_{i=1}^k a_i x_i \equiv b \Mod{n}$. In particular, we obtain explicit expressions…

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

Let M(q)=\sum c(n) q^n be one of Ramanujan's mock theta functions. We establish the existence of infinitely many linear congruences of the form c(An+B) \equiv 0 (mod \ell^j), where A is a multiple of \ell and an auxiliary prime p. Moreover,…

Given a polynomial $Q(x_1,\cdots, x_t)=\lambda_1 x_1^{k_1}+\cdots +\lambda_t x_t^{k_t}$, for every $c\in \mathbb{Z}$ and $n\geq 2$, we study the number of solutions $N_J(Q;c,n)$ of the congruence equation $Q(x_1,\cdots, x_t)\equiv…

This paper provides algebraic proofs for several types of congruences involving the multipartition function and self-convolutions of the divisor function. Our computations use methods of Differential Algebra in $\mathbb{Z}/q\mathbb{Z}$,…

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

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…

Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…

Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$. In this paper, we prove some congruence properties of the function $c_N(n)$…

Let $m$, $r$ and $n$ be positive integers. We denote by ${\bf k}\vdash n$ any tuple of odd positive integers ${\bf k}=(k_1,\dots,k_t)$ such that $k_1+\dots+k_t=n$ and $k_j\ge 3$ for all $j$. In this paper we prove that for every…

Let $d(n)$ denote the number of divisors of a positive integer $n$. A classical problem in analytic number theory is given by the asymptotic behavior of the divisor sum $\sum_{n \leq x} \frac{1}{d(n)}$, with Ramanujan having introduced an…

We consider a class of generating functions analogous to the generating function of the partition function and establish a bound on the primes $\ell$ for which their coefficients $c(n)$ obey congruences of the form $c(\ell n + a) \equiv 0…

In the present paper we obtain new upper bound estimates for the number of solutions of the congruence $$ x\equiv y r\pmod p;\quad x,y\in \mathbb{N},\quad x,y\le H,\quad r\in\cU, $$ for certain ranges of $H$ and $|\cU|$, where $\cU$ is a…

Ramanujan sums have attracted significant attention in both mathematical and engineering disciplines due to their diverse applications. In this paper, we introduce an algebraic generalization of Ramanujan sums, derived through polynomial…

Ramanujan showed that $\tau(p) \equiv p^{11}+1 \pmod{691}$, where $\tau(n)$ is the $n$-th Fourier coefficient of the unique normalized cusp form of weight $12$ and full level, and the prime $691$ appears in the numerator of…

Towards the end of his life Ramanujan wrote a manuscript on properties of the partition and tau functions, some parts of which remained unpublished until very recently. Nevertheless, this manuscript gave rise to a lot of subsequent work. In…