Search Results for ""

There are at least two definitions of hypercomplex numbers. Clifford algebraists call their higher dimensional numbers hypercomplex, even though they do not share all the ...

A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...

A McNugget number is a positive integer that can be obtained by adding together orders of McDonald's® Chicken McNuggetsTM (prior to consuming any), which originally came in ...

A solitary number is a number which does not have any friends. Solitary numbers include all primes, prime powers, and numbers for which (n,sigma(n))=1, where (a,b) is the ...

A wide variety of large numbers crop up in mathematics. Some are contrived, but some actually arise in proofs. Often, it is possible to prove existence theorems by deriving ...

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

The Euler numbers, also called the secant numbers or zig numbers, are defined for |x|<pi/2 by sechx-1=-(E_1^*x^2)/(2!)+(E_2^*x^4)/(4!)-(E_3^*x^6)/(6!)+... (1) ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

The Schröder number S_n is the number of lattice paths in the Cartesian plane that start at (0, 0), end at (n,n), contain no points above the line y=x, and are composed only ...

An L-algebraic number is a number theta in (0,1) which satisfies sum_(k=0)^nc_kL(theta^k)=0, (1) where L(x) is the Rogers L-function and c_k are integers not all equal to 0 ...