Search Results for ""

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

The AC method is an algorithm for factoring quadratic polynomials of the form p(x)=Ax^2+Bx+C with integer coefficients. As its name suggests, the crux of the algorithm is to ...

The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...

If a prime number divides a norm but not the bases of the norm, it is itself a norm.

A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...

The Smale horseshoe map consists of a sequence of operations on the unit square. First, stretch in the y direction by more than a factor of two, then compress in the x ...

A number n satisfies the Carmichael condition iff (p-1)|(n/p-1) for all prime divisors p of n. This is equivalent to the condition (p-1)|(n-1) for all prime divisors p of n.

A multiplicative factor (usually indexed) such as one of the constants a_i in the polynomial a_nx^n+a_(n-1)x^(n-1)+...+a_2x^2+a_1x+a_0. In this polynomial, the monomials are ...

A map projection in which the distances between one or two points and every other point on the map differ from the corresponding distances on the sphere by only a constant ...

For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...