Search Results for ""

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

The number (10^(666))!, where 666 is the beast number and n! denotes a factorial. The number has approximately 6.656×10^(668) decimal digits. The number of trailing zeros in ...

If r is an algebraic number of degree n, then the totality of all expressions that can be constructed from r by repeated additions, subtractions, multiplications, and ...

A dual number is a number x+epsilony, where x,y in R and epsilon is a matrix with the property that epsilon^2=0 (such as epsilon=[0 1; 0 0]).

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

An even number is an integer of the form n=2k, where k is an integer. The even numbers are therefore ..., -4, -2, 0, 2, 4, 6, 8, 10, ... (OEIS A005843). Since the even ...

For any ideal I in a Dedekind ring, there is an ideal I_i such that II_i=z, (1) where z is a principal ideal, (i.e., an ideal of rank 1). Moreover, for a Dedekind ring with a ...

The ordered pair (s,t), where s is the number of real embeddings of the number field and t is the number of complex-conjugate pairs of embeddings. The degree of the number ...