Search Results for ""

Two integers are relatively prime if they share no common positive factors (divisors) except 1. Using the notation (m,n) to denote the greatest common divisor, two integers m ...

A repunit is a number consisting of copies of the single digit 1. The term "repunit" was coined by Beiler (1966), who also gave the first tabulation of known factors. In ...

The rhombicosahedral graph, illustrated above, is the skeleton of the icosidodecadodecahedron, rhombicosahedron and rhombidodecadodecahedron. It will be implemented in a ...

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

If Li_2(x) denotes the usual dilogarithm, then there are two variants that are normalized slightly differently, both called the Rogers L-function (Rogers 1907). Bytsko (1999) ...

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

A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A Ruth-Aaron pair is a pair of consecutive numbers (n,n+1) such that the sums of the prime factors of n and n+1 are equal. They are so named because they were inspired by the ...

The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...