Search Results for ""

The product of primes p_n#=product_(k=1)^np_k, (1) with p_n the nth prime, is called the primorial function, by analogy with the factorial function. Its logarithm is closely ...

To solve the system of differential equations (dx)/(dt)=Ax(t)+p(t), (1) where A is a matrix and x and p are vectors, first consider the homogeneous case with p=0. The ...

The second theorem of Mertens states that the asymptotic form of the harmonic series for the sum of reciprocal primes is given by sum_(p<=x)1/p=lnlnx+B_1+o(1), where p is a ...

If a is (directly) proportional to b, then a/b is a constant. The relationship is written a proportional b, which implies a=cb, for some constant c known as the constant of ...

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

A transcendental number is a (possibly complex) number that is not the root of any integer polynomial, meaning that it is not an algebraic number of any degree. Every real ...

"The" Smarandache constant is the smallest solution to the generalized Andrica's conjecture, x approx 0.567148 (OEIS A038458). The first Smarandache constant is defined as ...

If f:[a,b]->[a,b] (where [a,b] denotes the closed interval from a to b on the real line) satisfies a Lipschitz condition with constant K, i.e., if |f(x)-f(y)|<=K|x-y| for all ...

Euler (1738, 1753) considered the series s_a(x)=sum_(n=1)^infty[1/(1-a^n)product_(k=0)^(n-1)(1-xa^(-k))]. He showed that just like log_a(a^n)=n, s_a(a^n)=n for nonnegative ...

If a polynomial P(x) is divided by (x-r), then the remainder is a constant given by P(r).