Search Results for ""

N_phi(m) is the number of integers n for which the totient function phi(n)=m, also called the multiplicity of m (Guy 1994). Erdős (1958) proved that if a multiplicity occurs ...

The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...

The (unilateral) Z-transform of a sequence {a_k}_(k=0)^infty is defined as Z[{a_k}_(k=0)^infty](z)=sum_(k=0)^infty(a_k)/(z^k). (1) This definition is implemented in the ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...

The Alexander polynomial is a knot invariant discovered in 1923 by J. W. Alexander (Alexander 1928). The Alexander polynomial remained the only known knot polynomial until ...

An alternating knot is a knot which possesses a knot diagram in which crossings alternate between under- and overpasses. Not all knot diagrams of alternating knots need be ...

Angle trisection is the division of an arbitrary angle into three equal angles. It was one of the three geometric problems of antiquity for which solutions using only compass ...

The binomial distribution gives the discrete probability distribution P_p(n|N) of obtaining exactly n successes out of N Bernoulli trials (where the result of each Bernoulli ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...