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 + 2 x 2 + 3 x 3 + + ( n − 1) x n−1 ≡ 0 (mod n) where i ∈ ℕ = {0, 1, 2, }. We consider the monoid of solutions of this equation and prove equivalent two conjectures of Elashvili concerning the structure of these solutions. This yields a simple algorithm for generating most (conjecturally all) of the high degree indecomposablc solutions of the equation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
