Congratulations to one of the most brilliant young minds in the Brilliant community for passing the PMO Area Stage Qualifiers - @Sean Anderson Ty. I say that this is a great feat for there are many who had the chance but wasn't able to qualify (Yep, I'm talking about me) He also lives/studies in the same city as I am, so I am proud that maybe one of ours is going to be part of IMO. As a gift, I give these Fibonacci problems (Who doesn't like proving?) 1) Let and be positive integers. Prove that, if is divisible by , then, is divisible by . 2) Let and be positive integers whose greatest common divisor is . Prove that the greatest common divisor of the Fibonacci numbers and is the Fibonacci number
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
@Sean Ty
@Sean Ty Congrats!