Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 6.1.5 (Conditions for two fractions of the Farey sequence to be adjacent)

Exercise 6.1.5 (Conditions for two fractions of the Farey sequence to be adjacent)

Consider two rational numbers a b and c d such that ad bc = 1 , b > 0 , d > 0 . Define n as max ( b , d ) , and prove that a b and c d are adjacent fractions in the Farey sequence of order n .

Answers

Proof. Since ad bc = 1 > 0 , and d > 0 , b > 0 , we obtain c d = 1 , a b = 1 , where n = max ( c , d ) , thus c n and d n , and

c d < a b ,

so that the fractions c d and a b are two fractions in the Farey sequence of order n .

Consider any fraction x y ( y > 0 ) between c d and a b so that

c d < x y < a b . (1)

By hypothesis, ad bc = 1 , therefore

1 bd = a b c d = ( a b x y ) + ( x y c d ) = ay bx dy + dx cy by .

By (1), ay bx > 0 and dx cy > 0 , therefore

1 bd 1 dy + 1 by = b + d bdy ,

where bdy > 0 , thus

y b + d .

Since n = max ( b , d ) , and b 1 , d 1 , we obtain b + d n + 1 , so

y n + 1 .

This shows that no fraction x y between c d and a b is in the Farey sequence of order n . Hence c d < a b are adjacents fractions in this sequence.

In conclusion, if ad bc = 1 , b > 0 , d > 0 and n = max ( b , d ) , then c d and a b are adjacent fractions in the Farey sequence of order n . □

Examples:

0 1 < 1 n < 1 n 1 ,

and

| 1 n 0 1 | = | n n 1 1 1 | = 1 ,

where max ( 1 , n ) = max ( n , n 1 ) = n , therefore the fractions 0 1 , 1 n , 1 ( n 1 ) are always three adjacent fractions in the Farey sequence of order n (this fact was used in Problem 4).

User profile picture
2025-07-04 09:04
Comments