# On solving a restricted linear congruence using generalized Ramanujan sums

Source: [On solving a restricted linear congruence using generalized Ramanujan sums](<https://www.sota2.com/research/paper/68fa54171e209131ce988a5f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T12:49:27.175Z

Authors: K Vishnu Namboothiri

Published: 2017-08-15T14:18:05.000Z

## Abstract

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 $\\mathcal{C}\_{j,s} = \\{1\\leq x\\leq n^s \| (x,n^s)\_s = d^s\_j\\}$. Bibak et al. gave a formula using Ramanujan sums for the number of solutions of the above congruence equation with some gcd restrictions on $x\_i$. We generalize their result with generalized gcd restrictions on $x\_i$ by proving that for the above linear congruence, the number of solutions is $$\\frac{1}{n^s}\\sum\\limits\_{d\|n}c\_{d,s}(b)\\prod\\limits\_{j=1}^{\\tau(n)}\\left(c\_{\\frac{n}{d\_j},s}(\\frac{n^s}{d^s})\\right)^{g\_j}$$ where $g\_j = \|\\{x\_1,\\ldots, x\_k\\}\\cap \\mathcal{C}\_{j,s}\|$ for $j=1,\\ldots \\tau(n)$ and $c\_{d,s}$ denote the generalized ramanujan sum defined by E. Cohen.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1708.04505>)

[PDF](<https://arxiv.org/pdf/1708.04505.pdf>)
