SFFT, or Simon's favorite factoring trick, is used in Diophantine equations you need to factor.
The general formula is for an equation where and are integer constants, and the coefficeint of must be 1 (if it's not divide the coefficient), the equation can be rewritten as:
Let's do a small example.
Consider the equation
Using SFFT, we get
Here are some practice problems.
(2021 CEMC Galois Q4b)
Determine all possible ordered pairs of possitive integers that are solutions to the equation
(1987 AIME Q5)
Find if and are integers such that
(2005 British Mathematical Olympiad Round 2 Q1)
The integer is positive. There are exactly ordered pairs of positive integers satisfying:
Prove that is a perfect square.