No label defined (Q4228929)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1257270
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1257270 |
Statements
6 August 2000
0 references
congruence
0 references
residue system
0 references
Gauss polynomial
0 references
0.93097246
0 references
0 references
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.
0 references