Search Results for ""

The extended greatest common divisor of two integers m and n can be defined as the greatest common divisor GCD(m,n) of m and n which also satisfies the constraint ...

The Frobenius equation is the Diophantine equation a_1x_1+a_2x_2+...+a_nx_n=b, where the a_i are positive integers, b is an integer, and the solutions x_i are nonnegative ...

An approach for the calculation of a Gröbner basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of inequalities.

A linear combination of basis quaternions with integer coefficients.

The repeated application of a transformation.

Let F be a differential field with constant field K. For f in F, suppose that the equation g^'=f (i.e., g=intf) has a solution g in G, where G is an elementary extension of F ...

A method for constructing magic squares of odd order.

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

An ideal I of a partial order P is a subset of the elements of P which satisfy the property that if y in I and x<y, then x in I. For k disjoint chains in which the ith chain ...

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.