Search Results for ""

Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...

In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...

The derivative of a function represents an infinitesimal change in the function with respect to one of its variables. The "simple" derivative of a function f with respect to ...

The tangent function is defined by tanx=(sinx)/(cosx), (1) where sinx is the sine function and cosx is the cosine function. The notation tgx is sometimes also used ...

In algebra, a period is a number that can be written an integral of an algebraic function over an algebraic domain. More specifically, a period is a real number ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

Given relatively prime integers p and q (i.e., (p,q)=1), the Dedekind sum is defined by s(p,q)=sum_(i=1)^q((i/q))(((pi)/q)), (1) where ((x))={x-|_x_|-1/2 x not in Z; 0 x in ...

Let f(z) be an entire function such that f(n) is an integer for each positive integer n. Then Pólya (1915) showed that if lim sup_(r->infty)(lnM_r)/r<ln2=0.693... (1) (OEIS ...