A formula for the number of solutions of a restricted linear congruence
Consider the linear congruence equation $x_1+\ldots+x_k \equiv b\pmod{n^s}$ for $b\in\mathbb Z$, $n,s\in\mathbb N$. Let $(a,b)_s$ denote the generalized gcd of $a$ and $b$ which is the largest $l^s$ with $l\in\mathbb N$ dividing $a$ and $b$ simultaneously. Let $d_1,\ldots, d_{\tau(n)}$ be all positi...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics of the Czech Academy of Science
2021-04-01
|
| Series: | Mathematica Bohemica |
| Subjects: | |
| Online Access: | http://mb.math.cas.cz/full/146/1/mb146_1_4.pdf |