Search Results for ""

A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...

The apodization function f(x)=1-(|x|)/a (1) which is a generalization of the one-argument triangle function. Its full width at half maximum is a. It has instrument function ...

The base manifold in a bundle is analogous to the domain for a set of functions. In fact, a bundle, by definition, comes with a map to the base manifold, often called pi or ...

The numbers three and four appear prominently in the game of baseball. There are three strikes for an out, three outs per half-inning (i.e., teams switch after three outs, ...

k_nu(x)=(e^(-x))/(Gamma(1+1/2nu))U(-1/2nu,0,2x) for x>0, where U is a confluent hypergeometric function of the second kind.

A class of curve defined at integer values which hops from one value to another. Their name derives from the Greek word betaalphataurhoalphachiiotaomicronnu batrachion, which ...

If C_1, C_2, ...C_r are sets of positive integers and union _(i=1)^rC_i=Z^+, then some C_i contains arbitrarily long arithmetic progressions. The conjecture was proved by van ...

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 ...

Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...