Search Results for ""

An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...

The group D_5 is one of the two groups of order 10. Unlike the cyclic group C_(10), D_5 is non-Abelian. The molecule ruthenocene (C_5H_5)_2Ru belongs to the group D_(5h), ...

A number n such that the "LED representation" of n (i.e., the arrangement of horizonal and vertical lines seen on a digital clock or pocket calculator), n upside down, n in a ...

A Diophantine equation is an equation in which only integer solutions are allowed. Hilbert's 10th problem asked if an algorithm existed for determining whether an arbitrary ...

Each of the sets forming a direct product is said to be a direct factor. A group G is said to be a direct factor of the group G^' if G^' is isomorphic to the group direct ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

Taking the ratio x/y of two numbers x and y, also written x÷y. Here, x is called the dividend, y is called the divisor, and x/y is called a quotient. The symbol "/" is called ...

Division by zero is the operation of taking the quotient of any number x and 0, i.e., x/0. The uniqueness of division breaks down when dividing by zero, since the product ...

A double factorial prime is a prime number of the form n!!+/-1, where n!! is a double factorial. n!!-1 is prime for n=3, 4, 6, 8, 16, 26, 64, 82, 90, 118, 194, 214, 728, ... ...

A pair of prime numbers (p,q) such that p^(q-1)=1 (mod q^2) and q^(p-1)=1 (mod p^2). The only known examples are (2, 1093), (3, 1006003), (5 , 1645333507), (83, 4871), (911, ...