Vector-covering systems of arithmetic sequences

From MaRDI portal





Let \(v=(v_1, \ldots, v_m)\) be a vector with nonzero real elements. A system of congruences \(a_i\pmod {n_i} \) is said \(v\)-covering if \(\sum v_i f_i(n)=1\) for all \(n\), where \( f_i(n)=1\) or \(0\) according to \(n \equiv a_i\pmod{n_i}\) or not. Several properties of common dis joint systems (the case \(v_i=1\) for all \(i\) ) are generalized to vector-covering systems, e.g. their characterizations by exponential sums and Bernoulli polynomials or the theorem stating that the moduli \(n_i\) cannot be all distinct.











This page was built for publication: Vector-covering systems of arithmetic sequences

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