linear Diophantine equations

GPTKB entity

Statements (15)
Predicate Object
gptkbp:instanceOf gptkb:mathematical_concept
gptkbp:application computer science
cryptography
combinatorics
gptkbp:defines equations of the form ax + by = c where a, b, c are integers and x, y are unknown integers
gptkbp:field number theory
gptkbp:generalSolution x = x0 + (b/d)t, y = y0 - (a/d)t, where d = gcd(a, b), t is integer
https://www.w3.org/2000/01/rdf-schema#label linear Diophantine equations
gptkbp:namedAfter gptkb:Diophantus
gptkbp:relatedTo gptkb:Euclidean_algorithm
modular arithmetic
gptkbp:solvabilityCondition gcd(a, b) divides c
gptkbp:solvedBy integer solutions
gptkbp:bfsParent gptkb:Frobenius_coin_problem
gptkbp:bfsLayer 6