Search Results for ""

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...

According to Pólya, the Cartesian pattern is the resolution method for arithmetical or geometrical problems based on equations. The first step is to translate the question ...

The term isocline derives from the Greek words for "same slope." For a first-order ordinary differential equation y^'=f(t,y) is, a curve with equation f(t,y)=C for some ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A polynomial admitting a multiplicative inverse. In the polynomial ring R[x], where R is an integral domain, the invertible polynomials are precisely the constant polynomials ...

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

An inner automorphism of a group G is an automorphism of the form phi(g)=h^(-1)gh, where h is a fixed element of G. An outer automorphism of G is an automorphism which cannot ...

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

A group action G×X->X is called free if, for all x in X, gx=x implies g=I (i.e., only the identity element fixes any x). In other words, G×X->X is free if the map G×X->X×X ...

There are at least two distinct (though related) notions of the term Hilbert algebra in functional analysis. In some literature, a linear manifold A of a (not necessarily ...