12
votes
1answer
401 views

Proving a complicated inequality involving integers

Let $a,b,c,d$ be integers such that $$\left( \begin{matrix} a & b \\ c & d \end{matrix} \right) = \left( \begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix}\right) \mod 2$$ $$ ad-bc =1$$ ...
2
votes
1answer
125 views

Bounding the number of integer solutions of the following inequality

Let $r\geq 1$ be a real number, $-1\leq x\leq 1$ a real number and $y>2$ a real number. We consider this data to be fixed. How can I obtain an upper bound on the number of $(a,b,c,d)\in ...