How many positive integer solutions? I'm interested in ${\bf integer}$ solutions of 
$$abcd+1=(ecd-c-d)(fab-a-b)$$
subject to ${\bf a,b,c,d \geq 2}$, and ${\bf e,f \geq 1}$. 
${\bf Questions:}$ Are there finitely many solutions? If no, is there a nice infinite family of solutions?
 A: $1=(f-1)abcd-fabc-fabd-acd+ac+ad-bcd+bc+bd$
Only if an odd number of odd terms exists, can this work. That takes at least one, even variable (not just term). 
mod 3, we have that  when turned into addition of possible negative equivalents, the 2 mod 3's either need to win by a number of terms that are 2 mod 3, or the 1 mod 3 terms need to win by a number of terms by a number of terms thst is 1 mod 3. 0 mod 3 has no effect, except forcing constraints on distribution of remaining terms. as 9 is not 1 or 2 mod 3 at least one term needs to be 0 mod 3. the remaining terms can split 3-5 for a 2 mod 3 win, or 7 terms can be non-zero mod 3 and get 4-3 split for a 1 mod 3 win. 6 non-zero terms have a 2-4, 2 mod 3 win. 5 has a 3-2, 1 mod 3 win. 4 has a 2 mod 3 win of 1-3. 3 has a 1 mod 3 win of 2-1. 2 has a 0-2 win for 2 mod 3. 1 has a 1-0 win for 1 mod 3.
you can do the same analysis mod 4 etc. then use CRT to combine them.
Edit 9 terms actually has a 2-7 split .
A: There are finitely many such solutions.
${\bf Proof.}$
It follows directly from the following (not too hard to verify) statements:
(1) $e$ or $f$ is $1$. Once $f$ is fixed to be $1$, $e \leq 7$.
(2) At least one number from the set $S=\{a,b,c,d \}$ is $\leq 5$. 
(3) For a fixed number from the set $S$, say $a$, there are at most finitely many triples $(b,c,d)$ satisfying this equation (for a proof see this question).
