Search Results for ""

The reciprocal of a real or complex number z!=0 is its multiplicative inverse 1/z=z^(-1), i.e., z to the power -1. The reciprocal of zero is undefined. A plot of the ...

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 crossing in a knot diagram for which there exists a circle in the projection plane meeting the diagram transversely at that crossing, but not meeting the diagram at any ...

A number n is said to be refactorable, sometimes also called a tau number (Kennedy and Cooper 1990), if it is divisible by the number of its divisors sigma_0(n), where ...

A regular number, also called a finite decimal (Havil 2003, p. 25), is a positive number that has a finite decimal expansion. A number such as 1/3=0.33333... which is not ...

In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...

The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...

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 ...

The consideration of the result of a numerical calculation as a function of an adjustable parameter (usually the step size). The function can then be fitted and evaluated at ...