How many ordered pairs of integers exists such that the above inequality satisfies?
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.
We have q 2 1 > ∣ ∣ ∣ ∣ q p − 3 2 ∣ ∣ ∣ ∣ = ∣ ∣ ∣ ∣ 3 q 3 p − 2 q ∣ ∣ ∣ ∣ ≥ 3 ∣ q ∣ 1 since the numerator is nonzero. So ∣ q ∣ < 3 . Looking at q = ± 1 , ± 2 , we quickly get the six answers ( ± 1 , ± 1 ) , ( 0 , ± 1 ) , ( ± 1 , ± 2 ) (where the ± signs are either both + or both − in each ordered pair). So the answer is 6 .
If we replaced 3 2 by an irrational number, Dirichlet's approximation theorem says that there would be infinitely many choices for ( p , q ) satisfying the inequality.