Search Results for ""

Simplemindedly, a number theoretic transform is a generalization of a fast Fourier transform obtained by replacing e^(-2piik/N) with an nth primitive root of unity. This ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

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

In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...

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

Let X and Y be sets, and let R subset= X×Y be a relation on X×Y. Then R is a concurrent relation if and only if for any finite subset F of X, there exists a single element p ...

For a given m, determine a complete list of fundamental binary quadratic form discriminants -d such that the class number is given by h(-d)=m. Heegner (1952) gave a solution ...

If a subset S of the elements of a field F satisfies the field axioms with the same operations of F, then S is called a subfield of F. In a finite field of field order p^n, ...