Number-Theoretic Inequality!

0 < p q 2 3 < 1 q 2 \Large{0 < \left| \dfrac{p}{q} - \dfrac23 \right| < \dfrac{1}{q^2}}

How many ordered pairs ( p , q ) (p,q) of integers exists such that the above inequality satisfies?

6 1 2 7 4 3 8 5

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.

1 solution

Patrick Corn
Dec 16, 2015

We have 1 q 2 > p q 2 3 = 3 p 2 q 3 q 1 3 q \frac1{q^2} > \left| \frac{p}{q} - \frac23 \right| = \left| \frac{3p-2q}{3q} \right| \ge \frac1{3|q|} since the numerator is nonzero. So q < 3 |q| < 3 . Looking at q = ± 1 , ± 2 q = \pm 1, \pm 2 , we quickly get the six answers ( ± 1 , ± 1 ) , ( 0 , ± 1 ) , ( ± 1 , ± 2 ) (\pm 1, \pm 1), (0, \pm 1), (\pm 1, \pm 2) (where the ± \pm signs are either both + + or both - in each ordered pair). So the answer is 6 \fbox{6} .

If we replaced 2 3 \frac23 by an irrational number, Dirichlet's approximation theorem says that there would be infinitely many choices for ( p , q ) (p,q) satisfying the inequality.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...