remainder function
11Auxiliary function — In mathematics, auxiliary functions are an important construction in transcendental number theory. They are functions which appear in most proofs in this area of mathematics and that have specific, desirable properties, such as taking the value… …
12Additive function — Different definitions exist depending on the specific field of application. Traditionally, an additive function is a function that preserves the addition operation:: f ( x + y ) = f ( x ) + f ( y )for any two elements x and y in the domain. An… …
13Symmetric function — In mathematics, the term symmetric function can mean two different concepts. A symmetric function of n variables is one whose value at any n tuple of arguments is the same as its value at any permutation of that n tuple. While this notion can… …
14consumption function — ▪ economics in economics, the relationship between consumer spending and the various factors determining it. At the household or family level, these factors may include income, wealth, expectations about the level and riskiness of future… …
15Carmichael function — In number theory, the Carmichael function of a positive integer n, denoted lambda(n),is defined as the smallest positive integer m such that:a^m equiv 1 pmod{n}for every integer a that is coprime to n.In other words, in more algebraic terms, it… …
16Coupon collector's problem (generating function approach) — The coupon collector s problem can be solved in several different ways. The generating function approach is a combinatorial technique that allows to obtain precise results. We introduce the probability generating function (PGF) G(z) where… …
17Taylor's theorem — In calculus, Taylor s theorem gives a sequence of approximations of a differentiable function around a given point by polynomials (the Taylor polynomials of that function) whose coefficients depend only on the derivatives of the function at that… …
18Modulo operation — Quotient (red) and remainder (green) functions using different algorithms. In computing, the modulo operation finds the remainder of division of one number by another. Given two positive numbers, a (the dividend) and n (the divisor), a modulo n… …
19Euclidean algorithm — In number theory, the Euclidean algorithm (also called Euclid s algorithm) is an algorithm to determine the greatest common divisor (GCD) of two elements of any Euclidean domain (for example, the integers). Its major significance is that it does… …
20Zeller's congruence — is an algorithm devised by Christian Zeller to calculate the day of the week for any Julian or Gregorian calendar date. Formula For the Gregorian calendar, Zeller s congruence is:h = left(q + leftlfloorfrac{(m+1)26}{10} ight floor + K +… …
