Search Results for ""

For a particular format in the IEEE 754-2008 framework, a normal number is a finite nonzero floating-point number with magnitude greater than or equal to a minimum value ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

A Thâbit ibn Kurrah number, sometimes called a 321-number, is a number of the form K_n=3·2^n-1. The first few for n=0, 1, ... are 2, 5, 11, 23, 47, 95, 191, 383, 767, ... ...

A partial algebra is a pair A=(A,(f_i^A)_(i in I)), where for each i in I, there are an ordinal number alpha_i and a set X_i subset= A^(alpha_i) such that f_i^A is a function ...

Simply stated, floating-point algebra is algebra performed on floating-point representations by any number of automated devices. Traditionally, this definition is phrased so ...

A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...

The associated Stirling numbers of the first kind d_2(n,k)=d(n,k) are defined as the number of permutations of a given number n having exactly k permutation cycles, all of ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

An integer n is called a super unitary perfect number if sigma^*(sigma^*(n))=2n, where sigma^*(n) is the unitary divisor function. The first few are 2, 9, 165, 238, 1640, ... ...

There are at least two distinct (though related) notions of the term Hilbert algebra in functional analysis. In some literature, a linear manifold A of a (not necessarily ...