Search Results for ""

A partial solution to the Erdős squarefree conjecture which states that the binomial coefficient (2n; n) is never squarefree for all sufficiently large n>=n_0. Sárkőzy (1985) ...

Let (x_1,x_2) and (y_1,y_2,y_3) be two sets of complex numbers linearly independent over the rationals. Then at least one of ...

That part of a positive integer left after all square factors are divided out. For example, the squarefree part of 24=2^3·3 is 6, since 6·2^2=24. For n=1, 2, ..., the first ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

The Cantor diagonal method, also called the Cantor diagonal argument or Cantor's diagonal slash, is a clever technique used by Georg Cantor to show that the integers and ...

A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...

The hyperbolic functions sinhz, coshz, tanhz, cschz, sechz, cothz (hyperbolic sine, hyperbolic cosine, hyperbolic tangent, hyperbolic cosecant, hyperbolic secant, and ...

The stability index Z^_(G) of a graph G is defined by Z^_=sum_(k=0)^(|_n/2_|)|c_(2k)|, where c_k is the kth coefficient of the characteristic polynomial and |_n_| denotes the ...

The truncated Witt graph is the graph on 506 vertices related to a 4-(23,8,4) design (Brouwer et al. 1989, p. 367). It is called the M_(23) graph by van Dam and Haemers ...

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...