Search Results for ""

The relative rate of change of a function f(x) is the ratio if its derivative to itself, namely R(f(x))=(f^'(x))/(f(x)).

In general, a remainder is a quantity "left over" after performing a particular algorithm. The term is most commonly used to refer to the number left over when two integers ...

A removable singularity is a singular point z_0 of a function f(z) for which it is possible to assign a complex number in such a way that f(z) becomes analytic. A more ...

Rényi entropy is defined as: H_alpha(p_1,p_2,...,p_n)=1/(1-alpha)ln(sum_(i=1)^np_i^alpha), where alpha>0, alpha!=1. As alpha->1, H_alpha(p_1,p_2,...,p_n) converges to ...

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

An expression describing a form in which a quantity can be written. For example, all primes p>3 can be "represented as" 6n+/-1.

In a complete metric space, a countable union of nowhere dense sets is said to be meager; the complement of such a set is a residual set.

A plot of y_i versus the estimator e_i=y^^_i-y_i. Random scatter indicates the model is probably good. A pattern indicates a problem with the model. If the spread in e_i ...

For a given monic quartic equation f(x)=x^4+a_3x^3+a_2x^2+a_1x+a_0, (1) the resolvent cubic is the monic cubic polynomial g(x)=x^3+b_2x^2+b_1x+b_0, (2) where the coefficients ...

A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...