Search Results for ""

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...

A rooted graph is a graph in which one node is labeled in a special way so as to distinguish it from other nodes. The special node is called the root of the graph. The rooted ...

The ruliad may be defined as the entangled limit of everything that is computationally possible, i.e., the result of following all possible computational rules in all ...

The constant s_0 in Schnirelmann's theorem such that every integer >1 is a sum of at most s_0 primes. Of course, by Vinogradov's theorem, it is known that 4 primes suffice ...

A problem also known as the points problem or unfinished game. Consider a tournament involving k players playing the same game repetitively. Each game has a single winner, ...

A simple continued fraction is a special case of a generalized continued fraction for which the partial numerators are equal to unity, i.e., a_n=1 for all n=1, 2, .... A ...

A simplex, sometimes called a hypertetrahedron (Buekenhout and Parker 1998), is the generalization of a tetrahedral region of space to n dimensions. The boundary of a ...

A smooth structure on a topological manifold (also called a differentiable structure) is given by a smooth atlas of coordinate charts, i.e., the transition functions between ...

The space groups in two dimensions are called wallpaper groups. In three dimensions, the space groups are the symmetry groups possible in a crystal lattice with the ...