Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 7.6.3 (Not all irrational numbers are approximable by rationals to order $c>2$)

Exercise 7.6.3 (Not all irrational numbers are approximable by rationals to order $c>2$)

Prove that the following is false for any constant c > 2 : Given any irrational number ξ , there exist infinitely many rational numbers h k such that

| ξ h k | < 1 k c .

Answers

Proof.

Assume for the sake of contradiction that, for all irrational numbers ξ , there exist infinitely many rational numbers h k such that

| ξ h k | < 1 k c ( c > 2 ) .

In particular, this is true for ξ = 1 + 5 2 .

Since c > 2 , lim k 1 k c 2 = 0 , so there is some integer N such that for all k N , 1 k c 2 < 1 5 , thus for all integers k

k N 1 k c < 1 5 k 2 . (1)

If | ξ h k | < 1 k c for some k < N , then | ξ | + | h k | | ξ h k | < 1 , therefore | h k | < 1 + | ξ | , so | h | < ( 1 + | ξ | ) k < ( 1 + | ξ | ) N . Hence there is only a finitely many fractions h k with k < N such that | ξ h k | < 1 k c . Consequently, there are infinitely many fractions h k with k N such that | ξ h k | < 1 k c . By (1), this shows that there are infinitely many fractions h k such that

| ξ h k | < 1 5 k 2 . (2)

But 5 > 5 , and the proof of Theorem 7.18 shows that this is false for ξ = 1 + 5 2 .

In conclusion, the following is false for any constant c > 2 : Given any irrational number ξ , there exist infinitely many rational numbers h k such that

| ξ h k | < 1 k c .

User profile picture
2025-08-08 08:16
Comments