Search Results for ""

Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...

Polyrhombs are polyforms obtained from a rhombic grid, illustrated above. The numbers of polyrhombs with n=1, 2, ... components are 1, 1, 3, 7, 20, 62, 204, ... (OEIS ...

A sequence {mu_n}_(n=0)^infty is positive definite if the moment of every nonnegative polynomial which is not identically zero is greater than zero (Widder 1941, p. 132). ...

"The reals" is a common way of referring to the set of real numbers and is commonly denoted R.

A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...

A polyhedron with extra square faces, given by the Schläfli symbol r{p; q}.

A positive integer n is called a base-b Rhonda number if the product of the base-b digits of n is equal to b times the sum of n's prime factors. These numbers were named by ...

Roman numerals are a system of numerical notations used by the Romans. They are an additive (and subtractive) system in which letters are used to denote certain "base" ...

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

The Rudvalis group is the sporadic group Ru of order |Ru| = 145926144000 (1) = 2^(14)·3^3·5^3·7·13·29. (2) It is implemented in the Wolfram Language as RudvalisGroupRu[].