Solution:
Let m1,n1,m2,n2 be integers satisfying m1n2−m2n1=±1. By changing the signs of m2,n2 if need be, we may assume that
m1n2−m2n1=1
If m3,n3 are integers satisfying m1n3−m3n1=±1, again we may assume (by changing their signs if necessary) that
m1n3−m3n1=1
So m1(n2−n3)=n1(m2−m3).
As m1,n1 are relatively prime, m1 divides m2−m3; say, m2−m3=m1a for some integer a. Thus, we get n2−n3=n1a. In other words,
m3=m2−m1a,n3=n2−n1a
Now, if m2n3−n2m3=±1, we get
±1=m2(n2−n1a)−n2(m2−m1a)=(m1n2−m2n1)a=a
Thus, m3=m2−m1a=m2±m1,n3=n2−n1a=n2±n1.
Now if we were to have another pair of integers m4,n4 such that
m1n4−n1m4=±1
we may assume that m1n4−n1m4=1. As seen above, m4=m2∓m1,n4=n2∓n1. But then
m3n4−n3m4=(m2±m1)(n2∓n1)−(n2±n1)(m2∓m1)=±2
Therefore, there can be only 3 pairs of such integers.
Alternate Solution:
It is clear that r can be 3 due to the valid solution m1=1,n1=1,m2=1,n2=2,m3=2,n3=3.
If possible, let r>3. We observe that:
m1n2n3−m2n1n3=±n3m2n3n1−m3n2n1=±n1m3n1n2−m1n3n2=±n2
Adding, we get ±n1±n2±n3=0; which forces at least one of n1,n2,n3 to be even; WLOG let n1 be even.
Repeating the argument for indices 2,3,4, we deduce that at least one of n2,n3,n4 is even; WLOG let n2 be even. This leads to a contradiction, since ∣m1n2−m2n1∣=1 cannot be even. Hence r>3 is not possible, as claimed.