# On the number of solutions of a restricted linear congruence

Source: [On the number of solutions of a restricted linear congruence](<https://www.sota2.com/research/paper/68fa54d01e209131ce98e98f>)

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

Data updated: 2025-10-25T13:12:33.427Z

Authors: K Vishnu Namboothiri

Published: 2017-08-16T15:30:12.000Z

## Abstract

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$ simultaneously. Given $t\_i\|n$, we seek solutions $\\langle x\_1,\\ldots,x\_k\\rangle\\in\\mathbb{Z}^k$ for this linear congruence with the restrictions $(x\_i,n^s)\_s=t\_i^s$. Bibak et al. \[J. Number Theory, 171:128-144, 2017\] considered the above linear congruence with $s=1$ and gave a formula for the number of solutions in terms of the Ramanujan sums. In this paper, we derive a formula for the number of solutions of the above congruence for arbitrary $s\\in\\mathbb{N}$ which involves the generalized Ramanujan sums defined by E. Cohen \[Duke Math. J, 16(85-90):2, 1949\]

## 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.04939>)

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