Search Results for ""

A (0,2)-graph is a connected graph such that any two vertices have 0 or 2 common neighbors. (0,2)-graphs are regular, and the numbers of (0,2)-graphs with vertex degree 0, 1, ...

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

Landau's function g(n) is the maximum order of an element in the symmetric group S_n. The value g(n) is given by the largest least common multiple of all partitions of the ...

The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...

The radial curve of a unit circle from a radial point (x,y) and parametric equations x = cost (1) y = sint (2) is another circle with parametric equations x_r = x-cost (3) ...

The inverse curve of the cochleoid r=(sintheta)/theta (1) with inversion center at the origin and inversion radius k is the quadratrix of Hippias. x = ktcottheta (2) y = kt. ...

The Fourier transform of the Heaviside step function H(x) is given by F_x[H(x)](k) = int_(-infty)^inftye^(-2piikx)H(x)dx (1) = 1/2[delta(k)-i/(pik)], (2) where delta(k) is ...

Gieseking's constant is defined by G = int_0^(2pi/3)ln(2cos(1/2x))dx (1) = Cl_2(1/3pi) (2) = (3sqrt(3))/4[1-sum_(k=0)^(infty)1/((3k+2)^2)+sum_(k=1)^(infty)1/((3k+1)^2)] (3) = ...

It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...

Given an amicable pair (m,n), the quantity sigma(m) = sigma(n) (1) = =s(m)+s(n) (2) = m+n (3) is called the pair sum, where sigma(n) is the divisor function and s(n) is the ...