Search Results for ""

A pi-prime is a prime number appearing in the decimal expansion of pi. The known examples are 3, 31, 314159, 31415926535897932384626433832795028841, ... (OEIS A005042). The ...

The sequence {|_(3/2)^n_|} is given by 1, 1, 2, 3, 5, 7, 11, 17, 25, 38, ... (OEIS A002379). The first few composite |_(3/2)^n_| occur for n=8, 9, 10, 11, 12, 13, 14, 15, 16, ...

The limiting rabbit sequence written as a binary fraction 0.1011010110110..._2 (OEIS A005614), where b_2 denotes a binary number (a number in base-2). The decimal value is ...

There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...

The term "similarity transformation" is used either to refer to a geometric similarity, or to a matrix transformation that results in a similarity. A similarity ...

There are two types of singular values, one in the context of elliptic integrals, and the other in linear algebra. For a square matrix A, the square roots of the eigenvalues ...

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

In logic, the term "homomorphism" is used in a manner similar to but a bit different from its usage in abstract algebra. The usage in logic is a special case of a "morphism" ...

For two polynomials P_1(x)=a_mx^m+...+a_0 and P_2=b_nx^n+...+b_0 of degrees m and n, respectively, the Sylvester matrix is an (m+n)×(m+n) matrix formed by filling the matrix ...

A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...