https://www.sulprobil.de/tags/mmult/ Recent content in MMULT on Sulprobil Hugo en Sat, 23 May 2026 06:55:00 +0100 https://www.sulprobil.de/sbeuklid_en/ Sat, 23 May 2026 06:55:00 +0100 https://www.sulprobil.de/sbeuklid_en/ <h2 id="abstract">Abstract</h2> <p>You need to represent a number as a non-negative linear combination of two positive integers?</p> <p>You can achieve this with the (external link!) <a href="https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm">extended Euklidean Algorithm</a>:</p> <p><img src="https://www.sulprobil.de/sbEuklid_en.png" alt="sbEuklid_en"></p> <p>Note: If your desired result is a multiple of the greatest common divisor of the inputs then there will always be an integer solution, but not necessarily a non-negative one. Example: You can represent 1 with the inputs 5 and 3 because 1 is the GCD of 3 and 5: 1 = 2 * 5 + (-3) * 3. But you cannot achieve this with non-negative integers only.</p>