Search Results for ""

Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...

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

For a curve with radius vector r(t), the unit tangent vector T^^(t) is defined by T^^(t) = (r^.)/(|r^.|) (1) = (r^.)/(s^.) (2) = (dr)/(ds), (3) where t is a parameterization ...

A number n such that the last digits of n^3 are the same as n. 49 is trimorphic since 49^3=117649 (Wells 1986, p. 124). The first few are 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, ...

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...

A unit ring is a ring with a multiplicative identity. It is therefore sometimes also known as a "ring with identity." It is given by a set together with two binary operators ...

The versine, also known as the "versed sine," is a little-used trigonometric function defined by versin(z) = 2sin^2(1/2z) (1) = 1-cosz, (2) where sinz is the sine and cosz is ...

A number n is called wasteful if the number of digits in the prime factorization of n (including powers) uses more digits than the number of digits in n. The first few ...

The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...