Find the smallest value of n for which the following statement is true:
"Given a set of n distinct real numbers { x 1 , … , x n } , there will always exist at least one pair of those numbers x a and x b that satisfy the inequality ∣ ∣ ∣ ∣ 1 + x a x b x a − x b ∣ ∣ ∣ ∣ ≤ 3 1 . "
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.
Problem Loading...
Note Loading...
Set Loading...
Let S = ( − π / 2 , π / 2 ) . The function tan : S ↦ R ranges over all real numbers, so for all real numbers x i there exists a unique θ i ∈ S such that x i = tan θ i . So there exists a bijection between sequences of real numbers with their respective θ i ∈ S value. We can hence work only with the θ i values.
Suppose x a = tan θ a and x b = tan θ b , and WLOG let θ a ≥ θ b . We have tan 6 π = 3 1 ≥ ∣ ∣ ∣ ∣ 1 + x a x b x a − x b ∣ ∣ ∣ ∣ = ∣ ∣ ∣ ∣ 1 + tan θ a tan θ b tan θ a − tan θ b ∣ ∣ ∣ ∣ = ∣ tan ( θ a − θ b ) ∣ and since θ a ≥ θ b we have tan 6 π ≥ tan ( θ a − θ b ) ⟹ θ a − θ b ≤ 6 π because tan : S ↦ R is increasing.
Now split S = ( − 2 π , 2 π ) into the following 6 intervals ( − 2 π , − 3 π ] , ( − 3 π , − 6 π ] , ( − 6 π , 0 ] , ( 0 , 6 π ] , ( 6 π , 3 π ] , ( 3 π , 2 π ) . If n ≤ 6 we can choose all the θ i from different intervals, equally spaced, so that we'll have θ i − θ j > π / 6 for all i , j . Therefore all sequences with n ≤ 6 might not satisfy the problem conditions.
If n = 7 then by the Pigeonhole Principle at least two θ i will be from the same interval, so we'll have θ a − θ b ≤ π / 6 for those two values. Hence n = 7 is the smallest size of such sequence.