On the number of solutions of a restricted linear congruence

From MaRDI portal
(Redirected from Publication:1708087)




Abstract: Consider the linear congruence equation {a_1^{s}x_1+ldots+a_k^{s} x_k equiv b,( ext{mod } n^s)} ext { where } a_i,binmathbb{Z},sinmathbb{N} Denote by (a,b)s the largest lsinmathbbN which divides a and b simultaneously. Given ti|n, we seek solutions langlex1,ldots,xkangleinmathbbZk for this linear congruence with the restrictions (xi,ns)s=tis. 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 sinmathbbN which involves the generalized Ramanujan sums defined by E. Cohen [Duke Math. J, 16(85-90):2, 1949]









This page was built for publication: On the number of solutions of a restricted linear congruence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708087)