## Fibonacci Sequence Exploration - Patterns, Proofs, Code

In this article we will explore various algorithms for calculating the nth Fibonacci term, derive formulas for various Fibonacci sums, and turn those formulas into programs.

In this article we will explore various algorithms for calculating the nth Fibonacci term, derive formulas for various Fibonacci sums, and turn those formulas into programs.

I want to discuss the correct study approach for performing well in proof based math classes as they differ significantly from application based math courses. The American primary school system focuses almost exclusively on applied math concepts. This leaves most college students unprepared for the absolute onslaught of proofs involved in an undergraduate math degree.

The interview process for a quantitative developer focuses heavily on algorithms and data structures with bits of math brain teasers dropped in. A quantitative trader interview is the complement of a quant-dev interview; math brain teaser heavy with bits of algorithm and data structures dropped in.

Around a year ago, I was in a zoom interview for a large tech company. I was given two reasonably challenging coding problems and aced them with ease. Then came the number theory. The interviewer asked the question "How many trailing zeros are there in 100 factorial?"

In this article, I will discuss performance variation, methods of practice, and the fundamental problem solving skills that I believe contribute to high performance in technical fields. These insights are informed by documented concepts in performance psychology.

A brief quick-notes on continuity and uniform continuity

Today I will show you how to get an interactive computing environment for C++ working with Jupyter Notebook.

In this article we will cover the math behind options pricing and implement a monte carlo model in Python.

In this article we will introduce an important concept of algorithmic game theory through the basic example of rock paper scissors.

In this post I will teach you all the ways to traverse a binary tree namely; in-order traversal, pre-order traversal, post-order traversal, and level order traversal