Search Results for ""

A palindromic prime is a number that is simultaneously palindromic and prime. The first few (base-10) palindromic primes are 2, 3, 5, 7, 11, 101, 131, 151, 181, 191, 313, ...

If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...

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 ...

A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...

An entire function f is said to be of finite order if there exist numbers a,r>0 such that |f(z)|<=exp(|z|^a) for all |z|>r. The infimum of all numbers a for which this ...

The integral transform (Kf)(x)=Gamma(p)int_0^infty(x+t)^(-p)f(t)dt. Note the lower limit of 0, not -infty as implied in Samko et al. (1993, p. 23, eqn. 1.101).

A run is a sequence of more than one consecutive identical outcomes, also known as a clump. Let R_p(r,n) be the probability that a run of r or more consecutive heads appears ...

Chevalley's theorem, also known as the Chevalley-Waring theorem, states that if f is a polynomial in F[x_1,...,x_n], where F is a finite field of field characteristic p, and ...

A recursive function devised by I. Takeuchi in 1978 (Knuth 1998). For integers x, y, and z, it is defined by (1) This can be described more simply by t(x,y,z)={y if x<=y; {z ...

Let T(x,y,z) be the number of times "otherwise" is called in the TAK function, then the Takeuchi numbers are defined by T_n(n,0,n+1). A recursive formula for T_n is given by ...