arXiv · math/0409489
Non-Negative Integer Linear Congruences
Abstract
We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values of the unknowns, $x_i$, are sought among the non-negative integers. We consider the monoid of solutions of this equation and prove a conjecture of Elashvili concerning the structure of these solutions. This yields a simple algorithm for generating most (conjecturally all) of the high degree indecomposable solutions of the equation.
Explore related subjects
Keep this discovery
John C. Harris, David L. wehlau. 2004-09-24. Non-Negative Integer Linear Congruences. https://arxiv.org/abs/math/0409489
Cite the original work for its findings. Save a collection to share your selection of sources.