Search Results for ""

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...

The prime counting function is the function pi(x) giving the number of primes less than or equal to a given number x (Shanks 1993, p. 15). For example, there are no primes ...

An additive cellular automaton is a cellular automaton whose rule is compatible with an addition of states. Typically, this addition is derived from modular arithmetic. ...

A biquadratic number is a fourth power, n^4. The first few biquadratic numbers are 1, 16, 81, 256, 625, ... (OEIS A000583). The minimum number of biquadratic numbers needed ...

A Carmichael number is an odd composite number n which satisfies Fermat's little theorem a^(n-1)-1=0 (mod n) (1) for every choice of a satisfying (a,n)=1 (i.e., a and n are ...

A triangle line lalpha+mbeta+ngamma=0 defined relative to a reference triangle is called a central line iff l:m:n is a triangle center (Kimberling 1998, p. 127). If l:m:n is ...

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

There exists an integer N such that every string in the look and say sequence "decays" in at most N days to a compound of "common" and "transuranic elements." The table below ...