No Positive Integer Difference of One
This problem explores a classic non‑existence proof using algebraic factorisation and integer properties—a skill that sits squarely inside the HSC Proofs topic. By turning the equation into a product of two integer factors, you’ll see how a seemingly open‑ended search reduces to checking just two simple cases. The technique you’ll gain here is one you can reuse whenever a Diophantine equation involves a difference of squares.
Problem Statement
Show that there are no positive integers and such that .
Hints
Attempt the proof independently first. Focus on the key theorem, algebraic transformation, or contradiction setup that links the hypothesis to the target conclusion.
Solutions
Proof by Factorization and Case Analysis
We start with the equation . This is a Diophantine equation—meaning we’re looking for integer solutions—so the natural first move is to rewrite the left‑hand side in a form that reveals the integer structure of the problem.
Step 1: Factor the left side
We factor as a difference of squares:
Now we have a product of two integer expressions that must equal .
Step 2: Analyze integer factor pairs
Since and are positive integers, both and are integers. We need their product to equal 1.
The only ways to write 1 as a product of integers are:
Because and are positive, is always positive, but might be negative, so we must examine both sign possibilities.
Step 3: Case 1 - Both factors equal 1
If and , adding these equations gives:
Subtracting:
But contradicts the requirement that is a positive integer.
Step 4: Case 2 - Both factors equal
If and , adding these equations gives:
But contradicts the requirement that is a positive integer.
Conclusion
All possible integer factorizations of 1 lead to violations of the positive integer requirement.
Therefore, there are no positive integers and satisfying .
Takeaways
- Factorization Strategy: Recognize as difference of squares
- Integer Factor Analysis: For product , only factor pairs are and
- Systematic Case Checking: Solve simultaneous equations and for each factor pair
- Constraint Verification: Always check solutions against domain restrictions (here: positive integers)
Further Readings
If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills: HSC Proofs, HSC Vectors, HSC Inequalities