remainder function
1remainder — /ri mayn deuhr/, n. 1. something that remains or is left: the remainder of the day. 2. a remaining part. 3. Arith. a. the quantity that remains after subtraction. b. the portion of the dividend that is not evenly divisible by the divisor. 4. Math …
2Function (mathematics) — f(x) redirects here. For the band, see f(x) (band). Graph of example function, In mathematics, a function associates one quantity, the a …
3Polynomial function theorems for zeros — are a set of theorems aiming to find (or determine the nature) of the complex zeros of a polynomial function.Found in most precalculus textbooks, these theorems include: * Remainder theorem * Factor theorem * Descartes rule of signs * Rational… …
4Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… …
5Hash function — A hash function is any well defined procedure or mathematical function for turning some kind of data into a relatively small integer, that may serve as an index into an array. The values returned by a hash function are called hash values, hash… …
6Error function — Plot of the error function In mathematics, the error function (also called the Gauss error function) is a special function (non elementary) of sigmoid shape which occurs in probability, statistics and partial differential equations. It is defined …
7One-way function — Unsolved problems in computer science Do one way functions exist? In computer science, a one way function is a function that is easy to compute on every input, but hard to invert given the image of a random input. Here easy and hard are to be… …
8Polynomial remainder theorem — The polynomial remainder theorem in algebra is an application of polynomial long division. It states that the remainder, r,, of a polynomial, f(x),, divided by a linear divisor, x a,, is equal to f(a) ,.This follows from the definition of… …
9Computable function — Total recursive function redirects here. For other uses of the term recursive function , see Recursive function (disambiguation). Computable functions are the basic objects of study in computability theory. Computable functions are the formalized …
10Euler's totient function — For other functions named after Euler, see List of topics named after Leonhard Euler. The first thousand values of φ(n) In number theory, the totient φ(n) of a positive integer n is defined to be the number of positive integers less than or equal …
