Search Results for ""

Applying the Kaprekar routine to 4-digit number reaches 0 for exactly 77 4-digit numbers, while the remainder give 6174 in at most 8 iterations. The value 6174 is sometimes ...

A large number defined as where the circle notation denotes "n in n squares," and triangles and squares are expanded in terms of Steinhaus-Moser notation (Steinhaus 1999, pp. ...

An odd composite number N is called a Somer-Lucas d-pseudoprime (with d>=1) if there exists a nondegenerate Lucas sequence U(P,Q) with U_0=0, U_1=1, D=P^2-4Q, such that ...

The operator B^~ defined by B^~f(z)=int_D((1-|z|^2)^2)/(|1-zw^_|^4)f(w)dA(w) for z in D, where D is the unit open disk and w^_ is the complex conjugate (Hedenmalm et al. ...

A function is in big-theta of f if it is not much worse but also not much better than f, Theta(f(n))=O(f(n)) intersection Omega(f(n)).

The radial curve of the cycloid with parametric equations x = a(t-sint) (1) y = a(1-cost) (2) is the circle x_r = x_0+2asint (3) y_r = -2a+y_0+2acost. (4)

A test for the convergence of Fourier series. Let phi_x(t)=f(x+t)+f(x-t)-2f(x), then if int_0^pi(|phi_x(t)|dt)/t is finite, the Fourier series converges to f(x) at x.

Disconnectivities are mathematical entities which stand in the way of a space being contractible (i.e., shrunk to a point, where the shrinking takes place inside the space ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

A balanced incomplete block design (v, k, lambda, r, b) exists only for b>=v (or, equivalently, r>=k).