Search Results for ""

The Jacobsthal polynomials are the W-polynomial obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal polynomials are J_1(x) = 1 ...

For n>=1, let u and v be integers with u>v>0 such that the Euclidean algorithm applied to u and v requires exactly n division steps and such that u is as small as possible ...

Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...

There are several conflicting meanings associated with the notation lgx. In German and Russian literature, the notation lgx is used to mean the common logarithm log_(10)x. ...

lnx is the notation used in physics and engineering to denote the logarithm to base e, also called the natural logarithm, i.e., lnx=log_ex. The United States Department of ...

The Lommel differential equation is a generalization of the Bessel differential equation given by z^2y^('')+zy^'+(z^2-nu^2)y=kz^(mu+1), (1) or, in the most general form, by ...

A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...

The so-called Malthusian equation is an antiquated term for the equation N(t)=N_0e^(lambdat) describing exponential growth. The constant lambda is sometimes called the ...

The Mercator series, also called the Newton-Mercator series (Havil 2003, p. 33), is the Taylor series for the natural logarithm ln(1+x) = sum_(k=1)^(infty)((-1)^(k+1))/kx^k ...

An inequality which implies the correctness of the Robertson conjecture (Milin 1964). de Branges (1985) proved this conjecture, which led to the proof of the full Bieberbach ...