Recursion

Recursion is a method of stacking of champion statistics. It involves 2 or more multipliers in which each multiplier interacts with the bonus statistics contributed by all other multipliers.This leads to an infinite sum on the statistic.

Examples
and 's     = (ax + 0.03bx) / (1 - 0.000015bx),    = (b + 0.0005abx) / (1 - 0.000015bx) and = (a + 0.15b)(1 + 0.02x) / (1 - 0.003x) and / = a(1 + y)(1 + z) / (1 - yz)
 * Define  as the ability power without counting 's and ability power multipliers (e.g. 's passive or 's buff). Denote it as a.
 * Denote the total ability power multiplier as x.
 * Define  as the mana without counting . Denote it as b.
 * The  and  can be calculated as follows:
 * Define two sequences A = {an} and B = {bn}, where n = 0, 1, 2, ...
 * a0 = ax, b0 = b
 * For n ≥ 1, an = 0.03bn-1x, bn = 0.0005an-1b
 * The is the sum of all terms in A, while the  is the sum of all terms in B.
 * This gives the formula
 * Denote  as a,  as b, number of  stacks as x.
 * percentage increase = 2x% = 0.02x
 * percentage increase = 15% = 0.15
 * The can be calculated as follows:
 * Define two sequences S = {sn} and T = {tn}, where n = 0, 1, 2, ...
 * s0 = a + b, t0 = 0
 * s1 = 0.15b, t1 = 0.02x(a + b)
 * For n ≥ 2, sn = 0.15tn-1, tn = 0.02xsn-1
 * The is the sum of all terms in S and T.
 * This gives the formula
 * Denote  as a, health percentage increase due to runes be y, health percentage increase due to  be z.
 * The can be calculated as follows:
 * Define two sequences S = {sn} and T = {tn}, where n = 0, 1, 2, ...
 * s0 = a, t0 = 0
 * s1 = ay, t1 = az
 * For n ≥ 2, sn = ytn-1, tn = zsn-1
 * The is the sum of all terms in S and T.
 * This gives the formula


 * and /  (and )
 * , and
 * , and