mathinschool.com
numbers and algebraic expressions
logic, sets, intervals
absolute value
function and its properties
linear function
quadratic function
polynomials
rational function
exponential function
logarithm
number sequences
limits of sequences and functions
derivative and integral of functions
trigonometry
plane geometry
analytic geometry
solid geometry
combinatorics
probability
elements of statistics
kropki game
The recursive formula of the Fibonacci sequence: F_1 = 1, F_2 = 1, F_{n+2} = F_{n+1} + F_n. The next number of the Fibonacci sequence is found by adding up the two numbers before it. The general formula of the Fibonacci sequence: F_n = (1 / square root of 5) * (1 + square root of 5 / 2)^n - (1 / square root of 5) * (1 - square root of 5 / 2)^n.