Conditions in inference, infinity and random waiting

Read integer equations in Book Isle: one solution is not all, and nonnegativity filters the parameter

Find every integer solution of four x plus six y equals fourteen, with an impossible right side and a sixteen control.

English translation of the Chinese original, translated on . Original publication dates, attribution, code and version notes are retained.

A real line has infinitely many points, but not every point solves an integer problem. Read a linear Diophantine equation through solvability, general solutions and extra constraints in Book Isle. Divisibility and enumeration are external, not an App equation or optimization solver.

Separate the integer domain from nonnegativity

Specify 4x+6y=14, first for arbitrary integers x, y, then with x≥0, y≥0. Put domain/gcd on P1, general solutions on P2 and changed-right-side controls on P3; export PDF and retain editable work. Check fourteen versus sixteen and bookmark P2. Mark integer/nonnegative conditions separately or record them externally. Nonnegative includes zero. One nonnegative solution is not a complete list of integer solutions.

Use divisibility to decide solvability

gcd(4, 6)=2 divides fourteen, so integer solutions exist. With right side fifteen, every integer left side is even and cannot equal an odd number. The criterion is gcd dividing the right side, not coefficient coprimality; noncoprime 4, 6 can solve fourteen. It guarantees an integer solution, not nonnegative/positive solutions or an answer inferred from an empty worksheet.

A common factor does not prevent solutions: two divides both coefficients and fourteen. Dividing both sides by the same nonzero two gives 2x+3y=7 with the same integer solutions; dividing only one side or rounding the right side does not. Positive coefficients do not force general integer solutions to be positive. Apply nonnegativity only after constructing the full family.

Check a particular solution, then introduce the parameter

The pair (2, 1) gives 8+6=14. Changing x by +3 and y by −2 preserves the sum because 4·3+6·(−2)=0. Thus x=2+3t, y=1−2t for integer t. Values −1, 0, 1 give (−1, 3),(2, 1),(5, −1), all valid for the unrestricted integer question. Do not erase negative coordinates or let t become arbitrary real, which need not preserve integer coordinates.

4*x+6*y=14; x,y integers; gcd(4,6)=2 divides14
particular solution (2,1)
all integer solutions: x=2+3*t; y=1-2*t; t integer
t=-1,0,1 -> (-1,3),(2,1),(5,-1)
nonnegative: t>=-2/3 and t<=1/2 -> t=0 only
control RHS15: no integer solution
control RHS16 nonnegative solutions: (1,2),(4,0)

Prove that no integer solutions lie outside the family

Subtract (2, 1) from any integer solution: 4(x−2)+6(y−1)=0, so 2(x−2)=−3(y−1). Coprimality of two and three forces 3 to divide x−2; write x−2=3t and obtain y−1=−2t. This proves coverage, beyond substituting members to show validity. Separate validity and completeness; a few sampled t values do not prove all solutions. The argument is for this linear equation, not every higher-degree integer equation.

Substitution cancels 12t with −12t and leaves 8+6=14, proving every integer parameter yields a solution. The coprime divisibility argument is still needed to prove every solution lies in the family. These are different directions. Testing t=−1, 0, 1 cannot establish completeness for all integers.

Intersect constraints on the same integer parameter

Nonnegativity requires 2+3t≥0, hence t≥−2/3, and 1−2t≥0, hence t≤1/2. Their integer intersection is only t=0, giving (2, 1). Do not use different t values for each inequality or accept t=1/2 and (3.5, 0) as integers. Uniqueness follows from domain plus bounds, not visible dots. Positivity happens to leave the same pair here, but positive and nonnegative are not universally equivalent.

Use a sixteen control to test the role of zero

Change only the right side to sixteen: 2x+3y=8, with particular (1, 2) and family x=1+3t, y=2−2t. Nonnegative bounds −1/3≤t≤1 admit integer t=0, 1: (1, 2),(4, 0). Strict positivity removes (4, 0). Both right sides pass gcd divisibility but have different nonnegative counts; the criterion promised no common count. Retain right-side/constraint labels rather than copy the fourteen answer.

For fourteen, the sole nonnegative solution (2, 1) is also strictly positive. For sixteen, (4, 0) must be excluded from a positive-integer task because zero is not greater than zero. “At least one of each” changes the inequalities. Preserve the constraint wording and signs alongside before/after counts, so a correct derivation does not deliver the wrong feasible set.

Diagnose domain, parameter and substitution residuals

A lone (2, 1) labelled general omits t; a full real line labelled integer ignores domain. Solvability for fifteen misses parity; one nonnegative solution for sixteen may exclude zero incorrectly. Record one shared t, x, y and 4x+6y per row, enlarging signs/bounds. If t is unsearchable in a scan, return by P2/particular-solution anchor. Page shifts do not alter the equation, and reader-open counts are not solver iterations.

Reopen with existence and filtering as separate steps

At reopened P2 first decide fourteen solvable and fifteen impossible, then rebuild parameter steps +3/−2 and filter t. Check zero in the sixteen control and explain why substitution alone does not establish completeness. Deliver divisibility, coverage proof, constraint intersection and versions, marking unperformed import, highlighting and reopening pending. This is manual mathematical reading, not App enumeration, optimization or verification of arbitrary Diophantine equations.

Book Isle Euclidean algorithm: trace divisors, remainders and the stopping condition; Read congruences in Book Isle: choose remainder representatives before cancelling factors.

Method references: Southampton Wright: linear Diophantine equations. Diagrams, report data, counterexamples and ledgers are original exercises.

Version checked on 19 November 2026: the Apple public lookup lists Book Isle 1.1.4, requiring iOS / iPadOS 15.6 or later; see the official App Store for published capabilities. Use self-made PDFs, EPUBs or clear text materials; bookmarks, highlights and notes depend on format and visible controls, without automatic solving or literary analysis. External preparation and paper predictions do not constitute device observations. Leave unperformed checks blank.