Search Results for ""

A floating-point number is a finite or infinite number that is representable in a floating-point format, i.e., a floating-point representation that is not a NaN. In the IEEE ...

A Pascal's triangle written in a square grid and padded with zeros, as written by Jakob Bernoulli (Smith 1984). The figurate number triangle therefore has entries a_(ij)=(i; ...

A figurate number of the form, CCub_n=n^3+(n-1)^3=(2n-1)(n^2-n+1). The first few are 1, 9, 35, 91, 189, 341, ... (OEIS A005898). The generating function for the centered cube ...

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...

Given a Lyapunov characteristic exponent sigma_i, the corresponding Lyapunov characteristic number lambda_i is defined as lambda_i=e^(sigma_i). (1) For an n-dimensional ...

The projective plane crossing number of a graph is the minimal number of crossings with which the graph can be drawn on the real projective plane. A graph with projective ...

A centered polygonal number consisting of a central dot with five dots around it, and then additional dots in the gaps between adjacent dots. The general term is ...

A centered polygonal number consisting of a central dot with four dots around it, and then additional dots in the gaps between adjacent dots. The general term is n^2+(n+1)^2, ...

A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...