Search Results for ""

The logarithmic integral (in the "American" convention; Abramowitz and Stegun 1972; Edwards 2001, p. 26), is defined for real x as li(x) = {int_0^x(dt)/(lnt) for 0<x<1; ...

Consider two closed oriented space curves f_1:C_1->R^3 and f_2:C_2->R^3, where C_1 and C_2 are distinct circles, f_1 and f_2 are differentiable C^1 functions, and f_1(C_1) ...

A second-order ordinary differential equation arising in the study of stellar interiors, also called the polytropic differential equations. It is given by ...

A quasi-cubic graph is a quasi-regular graph, i.e., a graph such that degree of every vertex is the same delta except for a single vertex whose degree is Delta=delta+1 ...

Let {f_n} and {a_n} be sequences with f_n>=f_(n+1)>0 for n=1, 2, ..., then |sum_(n=1)^ma_nf_n|<=Af_1, where A=max{|a_1|,|a_1+a_2|,...,|a_1+a_2+...+a_m|}.

Given a rectangle having sides in the ratio 1:phi, the golden ratio phi is defined such that partitioning the original rectangle into a square and new rectangle results in a ...

Consider the recurrence equation defined by a_0=m and a_n=|_sqrt(2a_(n-1)(a_(n-1)+1))_|, (1) where |_x_| is the floor function. Graham and Pollak actually defined a_1=m, but ...

The isotomic conjugate of a point is the point of concurrence Q of the isotomic lines relative to a point P. The isotomic conjugate alpha^':beta^':gamma^' of a point with ...

A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...