Search Results for ""

A Poisson process is a process satisfying the following properties: 1. The numbers of changes in nonoverlapping intervals are independent for all intervals. 2. The ...

A polar representation of a complex measure mu is analogous to the polar representation of a complex number as z=re^(itheta), where r=|z|, dmu=e^(itheta)d|mu|. (1) The analog ...

A prime factorization algorithm which can be implemented in a single-step or double-step form. In the single-step version, a prime factor p of a number n can be found if p-1 ...

There appears to be no standard term for a simple connected graph with exactly n edges, though the words "polynema" (Kyrmse) and "polyedge" (Muñiz 2011) have been proposed. ...

The positive integers are the numbers 1, 2, 3, ... (OEIS A000027), sometimes called the counting numbers or natural numbers, denoted Z^+. They are the solution to the simple ...

Consider the sequence {x_n}_(n=0)^infty defined by x_0=1 and x_(n+1)=[3/2x_n], where [z] is the ceiling function. For n=0, 1, ..., the first few terms are 1, 2, 3, 5, 8, 12, ...

Consider solutions to the equation x^y=y^x. (1) Real solutions are given by x=y for x,y>0, together with the solution of (lny)/y=(lnx)/x, (2) which is given by ...

A number n is practical if for all k<=n, k is the sum of distinct proper divisors of n. Defined in 1948 by A. K. Srinivasen. All even perfect numbers are practical. The ...

The previous prime function PP(n) gives the largest prime less than n. The function can be given explicitly as PP(n)=p_(pi(n-1)), where p_i is the ith prime and pi(n) is the ...

A short set of data that proves the primality of a number. A certificate can, in general, be checked much more quickly than the time required to generate the certificate. ...