Search Results for ""

A transformation formula for continued fractions (Lorentzen and Waadeland 1992) which can, for example, be used to prove identities such as ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

Polynomials b_n(x) which form a Sheffer sequence with g(t) = t/(e^t-1) (1) f(t) = e^t-1, (2) giving generating function sum_(k=0)^infty(b_k(x))/(k!)t^k=(t(t+1)^x)/(ln(1+t)). ...

In floating-point arithmetic, a biased exponent is the result of adding some constant (called the bias) to the exponent chosen to make the range of the exponent nonnegative. ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

An apodization function given by A(x)=(21)/(50)+1/2cos((pix)/a)+2/(25)cos((2pix)/a), (1) which has full width at half maximum of 0.810957a. This function is defined so that ...

The Borwein integrals are the class of definite integrals defined by I_n=1/piint_0^inftyx^(-(n+1)/2)product_(k=1,3,...)^nsin(x/k)dx for odd n. The integrals are curious ...

The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...

The only known classically known algebraic curve of curve genus g>1 that has an explicit parametrization (x(t),y(t)) in terms of standard special functions (Burnside 1893, ...

A set of positive integers S is called sum-free if the equation x+y=z has no solutions x, y, z in S. The probability that a random sum-free set S consists entirely of odd ...