Search Results for ""

The probability that a random integer between 1 and x will have its greatest prime factor <=x^alpha approaches a limiting value F(alpha) as x->infty, where F(alpha)=1 for ...

The ancient Greeks used the 24 letters of their alphabet plus three special signs called episemons--vau or digamma or stigma (6), koppa or qoppa (90), and san or sampi ...

The function lambda(n)=(-1)^(Omega(n)), (1) where Omega(n) is the number of not necessarily distinct prime factors of n, with Omega(1)=0. The values of lambda(n) for n=1, 2, ...

Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...

A number defined by b_n=b_n(0), where b_n(x) is a Bernoulli polynomial of the second kind (Roman 1984, p. 294), also called Cauchy numbers of the first kind. The first few ...

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

A binary bracketing is a bracketing built up entirely of binary operations. The number of binary bracketings of n letters (Catalan's problem) are given by the Catalan numbers ...

The maximum number of regions that can be created by n cuts using space division by planes, cube division by planes, cylinder cutting, etc., is given by N_(max)=1/6(n^3+5n+6) ...

A Cayley tree is a tree in which each non-leaf graph vertex has a constant number of branches n is called an n-Cayley tree. 2-Cayley trees are path graphs. The unique ...

The circumcircle of the Cevian triangle DeltaA^'B^'C^' of a given triangle DeltaABC with respect to a point P. The following table summarizes a number of named Cevian circles ...