Search Results for ""

A k-factor of a graph is a k-regular subgraph of order n. k-factors are a generalization of complete matchings. A perfect matching is a 1-factor (Skiena 1990, p. 244).

The factorization of a number into its constituent primes, also called prime decomposition. Given a positive integer n>=2, the prime factorization is written ...

A variant of the Pollard p-1 method which uses Lucas sequences to achieve rapid factorization if some factor p of N has a decomposition of p+1 in small prime factors.

A multiple of a number x is any quantity y=nx with n an integer. If x and y are integers, then x is called a factor of y. The smallest positive number m for which there exist ...

If a is a point in the open unit disk, then the Blaschke factor is defined by B_a(z)=(z-a)/(1-a^_z), where a^_ is the complex conjugate of a. Blaschke factors allow the ...

If the coefficients of the polynomial d_nx^n+d_(n-1)x^(n-1)+...+d_0=0 (1) are specified to be integers, then rational roots must have a numerator which is a factor of d_0 and ...

Let G be a group with normal series (A_0, A_1, ..., A_r). A normal factor of G is a quotient group A_(k+1)/A_k for some index k<r. G is a solvable group iff all normal ...

A transformation characterized by an invariant line and a scale factor (one-way stretch) or two invariant lines and corresponding scale factors (two-way stretch).

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...