Search Results for ""

The Erdős-Selfridge function g(k) is defined as the least integer bigger than k+1 such that the least prime factor of (g(k); k) exceeds k, where (n; k) is the binomial ...

A generalization of Turán's theorem to non-complete graphs.

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...

Given a Poisson distribution with a rate of change lambda, the distribution function D(x) giving the waiting times until the hth Poisson event is D(x) = ...

An object is unique if there is no other object satisfying its defining properties. An object is said to be essentially unique if uniqueness is only referred to the ...

An Euler-Jacobi pseudoprime to a base a is an odd composite number n such that (a,n)=1 and the Jacobi symbol (a/n) satisfies (a/n)=a^((n-1)/2) (mod n) (Guy 1994; but note ...

The term "Euler function" may be used to refer to any of several functions in number theory and the theory of special functions, including 1. the totient function phi(n), ...

The four parameters e_0, e_1, e_2, and e_3 describing a finite rotation about an arbitrary axis. The Euler parameters are defined by e_0 = cos(phi/2) (1) e = [e_1; e_2; e_3] ...

Let a prime number generated by Euler's prime-generating polynomial n^2+n+41 be known as an Euler prime. (Note that such primes are distinct from prime Euler numbers, which ...

The Euler triangle formula states that the distance d between the incenter and circumcenter of a triangle is given by d^2=R(R-2r), where R is the circumradius and r is the ...