Search Results for ""

Place a point somewhere on a line segment. Now place a second point and number it 2 so that each of the points is in a different half of the line segment. Continue, placing ...

The following integral transform relationship, known as the Abel transform, exists between two functions f(x) and g(t) for 0<alpha<1, f(x) = int_0^x(g(t)dt)/((x-t)^alpha) (1) ...

Let a particle travel a distance s(t) as a function of time t (here, s can be thought of as the arc length of the curve traced out by the particle). The speed (the scalar ...

Adams' method is a numerical method for solving linear first-order ordinary differential equations of the form (dy)/(dx)=f(x,y). (1) Let h=x_(n+1)-x_n (2) be the step ...

An additive group is a group where the operation is called addition and is denoted +. In an additive group, the identity element is called zero, and the inverse of the ...

A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...

Adomian polynomials decompose a function u(x,t) into a sum of components u(x,t)=sum_(n=0)^inftyu_n(x,t) (1) for a nonlinear operator F as F(u(x,t))=sum_(n=0)^inftyA_n. (2) ...

An affine transformation is any transformation that preserves collinearity (i.e., all points lying on a line initially still lie on a line after transformation) and ratios of ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

An alternating group is a group of even permutations on a set of length n, denoted A_n or Alt(n) (Scott 1987, p. 267). Alternating groups are therefore permutation groups. ...