scientific article; zbMATH DE number 1257270

MaRDI QIDQ4228929zbMATH OpenFDO

Authors Vladimir Shevelev

Publication date 6 August 2000

zbMATH Keywords

congruenceGauss polynomialresidue system

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Congruences in many variables (11D79)

Review text

Let \(k, r\) and \(s,\;2\leqslant s\leqslant k,\;0\leqslant r\leqslant{k-1},\) be integers. The author studies the solvability of the congruence \(\sum _{i=1}^{s} x_i \equiv r\pmod k\) in pairwise different numbers \(x_1,\dots ,x_s\) from the least non-negative residue system modulo \(k\). A formula for the number of such solutions of the congruence is obtained in two ways, combinatorially and algebraically. The connection of this number with the coefficients of Gauss polynomials is also shown.

Recommendations

• scientific article; zbMATH DE number 991673
• scientific article; zbMATH DE number 123855
• scientific article; zbMATH DE number 943404
• scientific article; zbMATH DE number 798962
• Number of Solutions of the Congruence x^m = r (mod n)
• scientific article; zbMATH DE number 883122
• scientific article; zbMATH DE number 597737
• On the number of solutions of one kind of congruence equation mod p
• Publication:5750930

Cited in

(5)

• Counting the solutions of \(\lambda_1 x_1^{k_1} + \dots + \lambda_t x_t^{k_t} \equiv c \bmod n\)
• scientific article; zbMATH DE number 4210234 (Why is no real title available?)
• scientific article; zbMATH DE number 3657870 (Why is no real title available?)
• scientific article; zbMATH DE number 2169162 (Why is no real title available?)
• scientific article; zbMATH DE number 4183493 (Why is no real title available?)

This page was built for publication:

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