Proof Concerning Central Line \(X_5X_6\) of Triangle

Image
Hello everyone. Today we will prove theorem about central line \(X_5X_6\) of triangle. Proof of the Central Line in a Golden Rectangle Construction Statement of the Theorem Let \(ABCD\) be a golden rectangle where \( \frac{AB}{BC} = \phi \), and construct the square \( BCQP \) inside it. Reflect \( P \) over \( D \) to obtain \( E \). Then, the line \( EB \) coincides with the central line \( X_5X_6 \) of triangle \( ABP \). Step-by-Step Proof 1. Define the Coordinates We assign coordinates as follows: \( A = (0,0) \), \( B = (\phi x, 0) \), \( C = (\phi x, x) \), \( D = (0, x) \). The square \( BCPQ \) ensures \( P = (\phi x, 2x) \). The reflection of \( P \) across \( D \) is \( E = (-\phi x, 2x) \). 2. Compute the Nine-Point Center \( X_5 \) The nine-point center \( X_5 \) is the circumcenter of the medial triangle, which consists of the midpoints: \[ M_1 = \left(\frac{0 + \phi x}{2}, 0\right) = \left(\frac{\phi x}{2}, 0\right), \] \[ M_2 = \left(\f...

Proof of the theorem regarding Fibonacci prime numbers

Hello everyone. Today we will prove the theorem regarding Fibonacci prime numbers. We will use the method of contradiction as a proof method. 

Theorem: Let \(F_n \) be the nth Fibonacci number and let \(F_n \) be a prime number. Then \(n \) is also a prime number, except in the case of \(F_4 = 3 \). 

Proof: 

For the case when \(n = 2 \) we have that \(F_2 = 1 \), and as we know the number \(1 \) is neither simple nor composite, so this case does not refute the truth of the theorem. 

For the case when \(n = 3 \) we have that \(F_3 = 2 \), so this case is in accordance with the statement. 

Now, suppose that for \(n> 4 \), \(F_n \) is a prime number and that \(n = rs \) for some natural numbers \(r, s \) which are greater than \(1 \), that is, that \(n \) is a composite number. 

Since \(n> 4 \)  at least one of the numbers \(r \) and \(s \) is greater than \(2 \). Then, according to the divisibility theorem of Fibonacci numbers which reads: \[\forall m, n \in \mathbb {Z} _ {> 2} \quad m \mid n \Leftrightarrow F_m \mid F_n \] we have that at least one of the expressions \(F_r \mid F_n \) and \(F_s \mid F_n \) is correct. Further, since at least one of the numbers \(r \) and \(s \) is greater than \(2 \), it follows that at least one of the Fibonacci numbers \(F_r \) and \(F_s \) is greater than \(1 \). So, we have shown that the number \(F_n \) has at least one divisor greater than \(1 \) and less than \(F_n \), i.e. we have shown that \(F_n \) is a composite number, thus we arrived at a contradiction. From this we conclude that \(n \) must be a prime number. 

\(\blacksquare \) 

Comments

Popular posts from this blog

Proof of the Area Relation in Right-Angled Triangle and Extouch Triangles

Proof of the Theorem Regarding Golden Ratio

Proof Concerning Central Line \(X_5X_6\) of Triangle