Search Results for ""

Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...

Relaxation methods are methods of solving partial differential equations that involve splitting the sparse matrix that arises from finite differencing then iterating until a ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

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 surface of constant Gaussian curvature that can be given parametrically by x = a(Ucosu-U^'sinu) (1) y = -a(Usinu+U^'cosu) (2) z = v-aV^', (3) where U = ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

A real-valued univariate function f=f(x) is said to have a removable discontinuity at a point x_0 in its domain provided that both f(x_0) and lim_(x->x_0)f(x)=L<infty (1) ...

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 ...

Given the closed interval [0,x] with x>1, let one-dimensional "cars" of unit length be parked randomly on the interval. The mean number M(x) of cars which can fit (without ...