Search Results for ""

In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...

A sieving procedure that can be used in conjunction with Dixon's factorization method to factor large numbers n. Pick values of r given by r=|_sqrt(n)_|+k, (1) where k=1, 2, ...

The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...

Two oriented knots (or links) can be summed by placing them side by side and joining them by straight bars so that orientation is preserved in the sum. The knot sum is also ...

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

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

The pentagonal wedge graph is the skeleton of the pentagonal wedge. It is a has 8 vertices, 12 edges, and 6 faces. The pentagonal wedge graph is implemented in the Wolfram ...

The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...

The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...

A function f is said to be an entire modular form of weight k if it satisfies 1. f is analytic in the upper half-plane H, 2. f((atau+b)/(ctau+d))=(ctau+d)^kf(tau) whenever [a ...