Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 6.1.7 ($\sum_{j=1}^{k-1} (b_j b_{j+1})^{-1} = 1$)

Exercise 6.1.7 ($\sum_{j=1}^{k-1} (b_j b_{j+1})^{-1} = 1$)

Consider the fractions 0 1 to 1 1 inclusive in the Farey sequence of order n . Reading from left to right, let the denominators of these fractions be b 1 , b 2 , , b k so that b 1 = 1 and b k = 1 . Prove that j = 1 k 1 ( b j b j + 1 ) 1 = 1 .

Answers

Proof. Let a j b j denote the j -th fraction. Since a j b j and a j + 1 b j + 1 are adjacent, b j a j + 1 a j b j + 1 = 1 by Theorem 6.1. Therefore, for all j [ [ 1 , k 1 ] ] ,

a j + 1 b j + 1 a j b j = 1 b j b j + 1 .

Therefore

j = 1 k 1 1 b j b j + 1 = j = 1 k 1 ( a j + 1 b j + 1 a j b j ) = j = 2 k a j b j j = 1 k 1 a j b j = a k b k a 1 b 1 = 1 ,

so

j = 1 k 1 1 b j b j + 1 = 1 .

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