Search Results for ""

Apply the 196-algorithm, which consists of taking any positive integer of two digits or more, reversing the digits, and adding to the original number. Now sum the two and ...

A simple unlabeled graph on n vertices is called pancyclic if it contains cycles of all lengths, 3, 4, ..., n. Since a pancyclic graph must contain a cycle of length n, ...

A fraction containing each of the digits 1 through 9 is called a pandigital fraction. The following table gives the number of pandigital fractions which represent simple unit ...

The golden ratio phi can be written in terms of a nested radical in the beautiful form phi=sqrt(1+sqrt(1+sqrt(1+sqrt(1+...)))), (1) which can be written recursively as ...

A permutation of n distinct, ordered items in which none of the items is in its original ordered position is known as a derangement. If some, but not necessarily all, of the ...

The number of partitions of n with k or fewer addends, or equivalently, into partitions with no element greater than k. This function is denoted q(n,k) or q_k(n). (Note that ...

Two knots are pass equivalent if there exists a sequence of pass moves taking one to the other. Every knot is either pass equivalent to the unknot or trefoil knot. These two ...

A path gamma is a continuous mapping gamma:[a,b]|->C^0, where gamma(a) is the initial point, gamma(b) is the final point, and C^0 denotes the space of continuous functions. ...

A polyhedral graph on five nodes. There are two topologically distinct pentahedral graphs which, through duality, correspond to the skeletons of the square pyramid (left ...

The pentanacci numbers are a generalization of the Fibonacci numbers defined by P_0=0, P_1=1, P_2=1, P_3=2, P_4=4, and the recurrence relation ...