Consider
Does this equation have integer solutions? Describe its real solution set.
Compute the gcd of the coefficients. and , so
Every term on the left is a multiple of , so for any integers the whole left-hand side is a multiple of .
Apply the divisibility test to the right-hand side. A linear Diophantine equation has integer solutions if and only if divides . Here
so and the gcd condition fails.
Conclude: no integer solution exists. Because the left side is and the right side is , no choice of integers can satisfy the equation. Note that "dividing through by 5" is not available here — is not an integer, so writing silently changes the problem.
Describe the real solution set instead. Over there is one equation in three unknowns, so the solutions form a plane in . Solving for gives the parametrisation
two free parameters, as expected for a plane.
Check a sample point. Taking gives , and . Taking , : , and . Neither is an integer, consistent with the mod-5 obstruction.
When would integers exist? If the target were or — any multiple of — the gcd test would pass and integer solutions would exist; for instance shows how close the lattice comes. It is the specific value that rules them out.
Need to solve a different problem like this? Open the solver →