Search Results for ""

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

A friendly number is a number that is a member of a friendly pair or a higher-order friendly n-tuple. Numbers that are not friendly are said to be solitary. There are some ...

A number n is practical if for all k<=n, k is the sum of distinct proper divisors of n. Defined in 1948 by A. K. Srinivasen. All even perfect numbers are practical. The ...

A positive integer which is divisible by the sum of its digits, also called a Niven number (Kennedy et al. 1980) or a multidigital number (Kaprekar 1955). The first few are ...

The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...

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

There are several different kinds of magic numbers. The digital root and magic constant are sometimes known as magic numbers. In baseball, the magic number for a team in ...

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