For all real numbers not equal to , let . Define the iterative function .
If can be represented as for relatively prime positive integers , determine
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.
Let us define Γ n + 1 ( x ) = Γ ( n ) ( Γ ( x ) ) to be the n − fold composition of the real-valued function Γ ( x ) = 2 − x 1 , x = 2 . The first few iterations for n ≥ 0 compute to:
Γ 1 ( x ) = Γ ( 0 ) ( Γ ( x ) ) = 2 − x 1 ;
Γ 2 ( x ) = Γ ( 1 ) ( Γ ( x ) ) = 2 − ( 2 − x 1 ) 1 = 3 − 2 x 2 − x ;
Γ 3 ( x ) = Γ ( 2 ) ( Γ ( x ) ) = 2 − ( 3 − 2 x 2 − x ) 1 = 4 − 3 x 3 − 2 x ;
Γ 4 ( x ) = Γ ( 3 ) ( Γ ( x ) ) = 2 − ( 4 − 3 x 3 − 2 x ) 1 = 5 − 4 x 4 − 3 x ......
The general term comes to Γ n ( x ) = ( n + 1 ) − n x n − ( n − 1 ) x , and Γ n ( 2 9 6 ) = ( n + 1 ) − n ( 2 9 6 ) n − ( n − 1 ) ( 2 9 6 ) = 2 3 n + 2 9 2 3 n + 6 = b n a n . Finally, we arrive at the limit (as n → ∞ ) :
∣ a n − b n ∣ = ∣ ( 2 3 n + 6 ) − ( 2 3 n + 2 9 ) ∣ = ∣ 6 − 2 9 ∣ = 2 3 .