Search Results for ""

A pseudoprime is a composite number that passes a test or sequence of tests that fail for most composite numbers. Unfortunately, some authors drop the "composite" ...

A notion introduced by R. M. Wilson in 1974. Given a finite graph G with n vertices, puz(G) is defined as the graph whose nodes are the labelings of G leaving one node ...

A random walk is a sequence of discrete steps in which each step is randomly taken subject to some set of restrictions in allowed directions and step lengths. Random walks ...

The word "rank" refers to several related concepts in mathematics involving graphs, groups, matrices, quadratic forms, sequences, set theory, statistics, and tensors. In ...

A rational number is a number that can be expressed as a fraction p/q where p and q are integers and q!=0. A rational number p/q is said to have numerator p and denominator ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...

In combinatorial mathematics, the series-parallel networks problem asks for the number of networks that can be formed using a given number of edges. The edges can be ...

Ramanujan calculated mu=1.45136380... (Hardy 1999, Le Lionnais 1983, Berndt 1994), while the correct value is mu=1.45136923488... (OEIS A070769; Derbyshire 2004, p. 114). The ...

A homework problem proposed in Steffi's math class in January 2003 asked students to prove that no ratio of two unequal numbers obtained by permuting all the digits 1, 2, ...