The greatest common divisor of and is , which divides . Divide the linear Diophantine equation by to obtainReducing modulo gives , so . Substitution gives the complete family of integer solutionsEvery such pair satisfies the equation, and every solution must have this residue for , so none are omitted. Positivity requires and . For integer these are exactly . Thus the pairs with both entries positive are
Articles by others on the same topic
There are currently no matching articles.