Often-a-while fibonacci sequence problems stars as the guest problem in olympiad exam papers and often the solution is hidden from the untrained eye as some form of application of its properties. This article assumes familiarity with the definition of the “Fibonacci Sequence” and the ability to comprehend recursive definitions at the minimum. We will present various properties related to Fibonacci Numbers (and related) without any proof. It is the interest of the reader to seek out the proofs and validate each result for their own.