Let F n be the n th number in the Fibonacci Sequence. Consider the 3 points ( F 3 0 , F 3 1 ) , ( F 3 2 , F 3 3 ) , ( F 3 4 , F 3 5 ) in the Cartesian plane. You are allowed to repeatedly apply the following operation:
Let P be any one of the three points in the plane and let Q , R be the other points. Draw the perpendicular bisector of Q R and let S be the closest point on this line to P . Move P to any point T in the plane such that S is also the closest point on the perpendicular bisector of Q R to T .
After some sequence of operations, two of the points end up at ( 0 , 0 ) and ( 1 0 0 , 0 ) . If the third point is in the first quadrant, the largest possible value of its y -coordinate can be expressed as b a where a and b are coprime positive integers. What is the value of a + b ?
Details and assumptions
The Fibonacci sequence is defined by F 1 = 1 , F 2 = 1 and F n + 2 = F n + 1 + F n for n ≥ 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.
Let M be the midpoint of QR. Since S is the shortest point from P to the perpendicular bisector of QR, we have PS perpendicular to SM ⇒ PS parallel to QR. Similarly, TS is also parallel to QR. Hence P, S and T are collinear and PST is parallel to QR ⇒ PQR and TQR have the same base (QR) and height R i g h t a r r o w PQR and TQR have the same area.
The invariant in this transformation is the area of the triangle. F 3 0 = 832040, F 3 1 = 1346269, F 3 2 = 2178309, F 3 3 = 3524578, F 3 4 = 5702887, F 3 5 = 9227465. Hence the area of the triangle = 2 1 ∣ F 3 0 ⋅ F 3 3 + F 3 2 ⋅ F 3 5 + F 3 4 ⋅ F 3 1 − F 3 2 ⋅ F 3 1 − F 3 4 ⋅ F 3 3 − F 3 0 ⋅ F 3 5 ∣ = 2 1 .
Since the base (x-axis) in the question is 100, and the area is 2 1 , we have the height (y-axis) = 1 0 0 2 1 ⋅ 2 = 1 0 0 1 , hence the answer is 101.
The area of the initial triangle is actually invariant of which Fibonacci number you start with (up to sign), because F k + 1 2 − F k F k + 2 = ± 1 (Cassini's identity). You can prove this identity in many ways.
Can you find a series of moves that will bring 2 of the points to
(
0
,
0
and
(
1
0
0
,
0
)
?
(*) Can you classify all such triangles which can be eventually reached?
S=1/2|(1,F30,F31),(1,F32,F33),(1,F34,F35)|=1/2|(0,F31,F32),(1,F32,F33),(0,F33,F34)|=1/2|F31 F34-F32 F33|=1/2
Notice that the condition implies that P must remain at the same height from QR, so by the half base times height formula, the area of PQR is constant.
We can work out what it is at the start, given the determinant formula for the area in Cartesian coordinates, by writing the Fibonacci numbers in terms of ϕ , and explicitly computing the determinant in terms of ϕ . In fact, the answer comes out to 1.
Hence, the area of the triangle is 2 1 , meaning that the y-coordinate must be 1 0 0 1 , giving the answer of 101.
The answer is the same, regardless of which Fibonacci number you start out with. In the following, we will replace 3 0 with k .
The description of what move we are allowed to do can be simplified. We are allowed to choose any point P and move it along the line through P that is parallel to the line between the other pair of points. Notice that this does not change the area of the triangle, since we can think of the base being the side between the pair of unchanging points, and the height to the third point does not change when it moves in the prescribed manner.
To determine the y -coordinate of the third point in the final position we need to determine the area of the triangle.
We can use the coordinate geometry formula for area of a triangle. A = 2 1 ∣ ∣ ∣ ∣ ∣ ∣ x 1 x 2 x 3 y 1 y 2 y 3 1 1 1 ∣ ∣ ∣ ∣ ∣ ∣
Note that this is equivalent to the formula A = ∣ ∣ ∣ 2 x 1 ( y 2 − y 3 ) + x 2 ( y 3 − y 1 ) + x 3 ( y 1 − y 2 ) ∣ ∣ ∣ , which we will use for simplicity.
We can reduce our number of variables by defining F k + 2 , F k + 3 , F k + 4 , F k + 5 in terms of a = F k and b = F k + 1 . Our area expression will become
A = ∣ ∣ ∣ 2 a ( ( a + 2 b ) − ( 3 a + 5 b ) ) + ( a + b ) ( ( 3 a + 5 b ) − b ) + ( 2 a + 3 b ) ( b − ( a + 2 b ) ) ∣ ∣ ∣ = ∣ ∣ ∣ 2 b 2 − a 2 − a b ∣ ∣ ∣ = ∣ ∣ ∣ 2 b 2 − ( a + b ) ( a ) ∣ ∣ ∣
Substituting our Fibonacci numbers back in, we have A = ∣ ∣ ∣ 2 F k + 1 2 − F k F k + 2 ∣ ∣ ∣ . The top expression is a well-known Fibonacci identity (Cassini's identity), with value equal to ± 1 . So the area of the triangle is always 2 1 , independent of the value of k .
Let h be the y -coordinate of the third point from the question. Then 2 1 0 0 h = h 1 so h = 1 0 0 1 and a + b = 1 + 1 0 0 = 1 0 1 .
Problem Loading...
Note Loading...
Set Loading...
First, since both P S and T S are perpendicular to the perpendicular bisector of Q R , then any point T satisfies the given condition must be on the line P S . Furthermore, P S is parallel to Q R , so d ( P , Q R ) = d ( T , Q R ) . This implies that the operation conserve the area of the triangle P Q R .
Now, we need to find the area of the original triangle P Q R . Assuming that P ( F 3 0 , F 3 1 ) ; Q ( F 3 2 , F 3 3 ) ; R ( F 3 4 , F 3 5 ) , we have: Q P = ( F 3 0 − F 3 2 ; F 3 1 − F 3 3 ) = ( − F 3 1 , − F 3 2 ) Q R = ( F 3 4 − F 3 2 ; F 3 5 − F 3 3 ) = ( F 3 3 , F 3 4 )
Then [ P Q R ] = 2 1 ∣ Q P ∗ Q R ∣ = 2 1 ∣ − F 3 1 F 3 4 + F 3 2 F 3 3 ∣ = 2 1 ∣ F 3 2 ( F 3 1 + F 3 2 ) − F 3 1 ( F 3 2 + F 3 3 ) ∣ = 2 1 ∣ F 3 2 ( F 3 1 + F 3 2 ) − F 3 1 ( F 3 2 + F 3 3 ) ∣ = 2 1 ∣ F 3 2 2 − F 3 1 F 3 3 ∣ = 2 1 ∣ F 3 0 F 3 2 − F 3 1 2 ∣ = . . . = 2 1 ∣ F 2 2 − F 1 F 3 ∣ = 2 1 ∣ 1 ∗ 1 − 1 ∗ 2 ∣ = 2 1 (we can use Heron's formula for the same result)
Next, put P ′ ( x , y ) ; Q ′ ( 0 , 0 ) ; R ′ ( 1 0 0 , 0 ) where x , y ≤ 0 (since P ′ is in the first quadrant). The two points are on the line y = 0 . Since P ′ Q ′ = 1 0 0 , then the set of point P' satisfies the condition [ P ′ Q ′ R ′ ] = [ P Q R ] is the line Δ such that Δ is parallel to O x and d ( Δ , O x ) = P Q 2 [ P ′ Q ′ R ′ ] = 1 0 0 1 . Hence, we have 2 possibilities of Δ : y = ± 1 0 0 1 . Then the largest possible value of y is 1 0 0 1 , which yields the answer 101.