matlab,matrix,combinatorics,diophantine

Math: Instead of going the hypercube-way, we solve the equation x(1) + x(2) + ... + x(n) = 1 where each x(i) can vary in [0, 1/k, 2/k, ... (k-1)/k, 1] instead. In your case k will be 10, as this will then result in the percentages [0, 10, 20,...

math,integer,equation,linear,diophantine

existence Bezout's identity tells you indeed that with the greatest common divisor (gcd) d of a and b, we have : i) d is the smallest positive integer that can be written as ax + by, and ii) every integer of the form ax + by is a multiple of...