How many ordered sets of integer solutions are there for for positive integers in the equation above?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
( a + c ) ( b + d ) = 1 8 (*)
1 8 can be written as 1 × 1 8 , 2 × 9 or 3 × 6
1 × 1 8 won't help, because [ ( a + c ) , ( b + d ) ] ≥ 2 , since a , b , c and d are positive integers.
Case 1 → 2 × 9
There is only 1 way for one of the factors of (*) to be 2 and 8 ways for the other one to be 9 . Also, we can swap their values, doubling the number of solutions of this case. So this case gives us 1 × 8 × 2 = 1 6 solutions.
Case 2 → 3 × 6
There are 2 ways for one of the factors of (*) to be 3 and 5 ways for the other one to be 6 . As with the first case, we can swap their values, so this case gives us 2 × 5 × 2 = 2 0 solutions.
Number of solutions: 1 6 + 2 0 = 3 6