English
Related papers

Related papers: On solving a restricted linear congruence using ge…

200 papers

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$…

Number Theory · Mathematics 2018-05-08 K Vishnu Namboothiri

Let $b,n\in \mathbb{Z}$, $n\geq 1$, and ${\cal D}_1, \ldots, {\cal D}_{\tau(n)}$ be all positive divisors of $n$. For $1\leq l \leq \tau(n)$, define ${\cal C}_l:=\lbrace 1 \leqslant x\leqslant n \; : \; (x,n)={\cal D}_l\rbrace$. In this…

Number Theory · Mathematics 2016-10-26 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan

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…

Number Theory · Mathematics 2024-03-05 C. G. Karthick Babu , Ranjan Bera , B. Sury

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…

Number Theory · Mathematics 2016-09-14 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan , Roberto Tauraso , László Tóth

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…

Number Theory · Mathematics 2024-03-05 C. G. Karthick Babu , Ranjan Bera , B. Sury

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…

Number Theory · Mathematics 2025-07-09 N. Uday Kiran

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…

Number Theory · Mathematics 2017-05-23 Songsong Li , Yi Ouyang

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…

Discrete Mathematics · Computer Science 2020-10-13 Khodakhast Bibak , Bruce M. Kapron , Venkatesh Srinivasan

We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…

Number Theory · Mathematics 2015-03-12 Igor E. Shparlinski

The Ramanujan sum $c_n(k)$ is defined as the sum of $k$-th powers of the primitive $n$-th roots of unity. We investigate arithmetic functions of $r$ variables defined as certain sums of the products $c_{m_1}(g_1(k))...c_{m_r}(g_r(k))$,…

Number Theory · Mathematics 2012-07-18 László Tóth

For integers $b$ and $c$ the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Those $T_n=T_n(1,1)\ (n=0,1,2,\ldots)$ are the usual central trinomial coefficients, and…

Number Theory · Mathematics 2014-06-18 Zhi-Wei Sun

Let $c_q(n)$ denote the Ramanujan sum modulo $q$, and let $x$ and $y$ be large reals, with $x = o(y)$. We obtain asymptotic formulas for the sums $$\sum_{n \le y}(\sum_{q \le x} c_q(n))^k \qquad (k = 1, 2).$$

Number Theory · Mathematics 2014-08-06 Tsz Ho Chan , Angel V Kumchev

A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…

Number Theory · Mathematics 2024-05-01 Tewodros Amdeberhan , Ajit Singh

For any $n\in\mathbb{N}=\{0,1,2,\ldots\}$ and $b,c\in\mathbb{Z}$, the generalized central trinomial coefficient $T_n(b,c)$ denotes the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$. Let $p$ be an odd prime. In this paper, we…

Number Theory · Mathematics 2020-12-09 Jia-Yu Chen , Chen Wang

A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial…

Number Theory · Mathematics 2014-10-23 Zhi-Wei Sun

The near orthgonality of certain $k$-vectors involving the Ramanujan sums were studied by E. Alkan in [J. Number Theory, 140:147--168 (2014)]. Here we undertake the study of similar vectors involving a generalization of the Ramanujan sums…

Number Theory · Mathematics 2023-12-13 Neha Elizabeth Thomas , K Vishnu Namboothiri

Recently Amdeberhan, Sellers, and Singh introduced a new infinite family of partition functions called generalized cubic partitions. Given a positive integer $d$, they let $a_d(n)$ be the counting function for partitions of $n$ in which the…

Number Theory · Mathematics 2025-08-11 Dalen Dockery

We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…

Number Theory · Mathematics 2026-01-21 Madhuparna Das , Nicolas Robles

An integer $a$ is said to be regular (mod $r$) if there exists an integer $x$ such that $a^2x\equiv a\pmod{r}$. In this paper we introduce an analogue of Ramanujan's sum with respect to regular integers (mod $r$) and show that this analogue…

Number Theory · Mathematics 2010-09-01 Pentti Haukkanen , László Tóth

For a fixed positive integer $k$, let $C(k,n)$ denote the number of two-color partitions of $n$ with odd smallest part and restrictions on even parts, and let $C_k(q)$ be its generating function. We show that $C(1,n)\equiv d(2n-1)\pmod{4}$…

Number Theory · Mathematics 2026-03-10 George E. Andrews , Mohamed El Bachraoui
‹ Prev 1 2 3 10 Next ›