Search Results for ""

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

A set T of integers is said to be recursively enumerable if it constitutes the range of a recursive function, i.e., if there exists a recursive function that can eventually ...

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 operation of exchanging all points of a mathematical object with their mirror images (i.e., reflections in a mirror). Objects that do not change handedness under ...

A polyhedron is said to be regular if its faces and vertex figures are regular (not necessarily convex) polygons (Coxeter 1973, p. 16). Using this definition, there are a ...

A d-repdigit is a number composed of repetition of a single digit (in a given base, generally taken as base 10 unless otherwise specified). For example, the beast number 666 ...

Consider a network of n resistors R_i so that R_2 may be connected in series or parallel with R_1, R_3 may be connected in series or parallel with the network consisting of ...

Consider the sequence defined by w_1=01 and w_(n+1)=w_nw_nw_n^R, where l^R denotes the reverse of a sequence l. The first few terms are then 01, 010110, 010110010110011010, ...

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