Search Results for ""

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

A regular ring in the sense of commutative algebra is a commutative unit ring such that all its localizations at prime ideals are regular local rings. In contrast, a von ...

A balanced incomplete block design (B,V) is called resolvable if there exists a partition R of its set of blocks B into parallel classes, each of which in turn partitions the ...

If A is a class of recursively enumerable sets, then the set of Gödel numbers of functions whose domains belong to A is called its index set. If the index set of A is a ...

Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...

Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

A number of areas of mathematics have the notion of a "dual" which can be applies to objects of that particular area. Whenever an object A has the property that it is equal ...

A separable extension K of a field F is one in which every element's algebraic number minimal polynomial does not have multiple roots. In other words, the minimal polynomial ...