Search Results for ""

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

Scientific notation is the expression of a number n in the form a×10^p, where p=|_log_(10)|n|_| (1) is the floor of the base-10 logarithm of n (the "order of magnitude"), and ...

The Paley graph of order q with q a prime power is a graph on q nodes with two nodes adjacent if their difference is a square in the finite field GF(q). This graph is ...

A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

Thurston's conjecture proposed a complete characterization of geometric structures on three-dimensional manifolds. Before stating Thurston's geometrization conjecture in ...

Smarandache sequences are any of a number of simply generated integer sequences resembling those considered in published works by Smarandache such as the consecutive number ...

A finite simple group of Lie-type. The following table summarizes the types of twisted Chevalley groups and their respective orders. In the table, q denotes a prime power and ...