Search Results for ""

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

Plouffe's constants are numbers arising in summations of series related to r_n=f(2^n) where f is a trigonometric function. Define the Iverson bracket function rho(x)={1 for ...

A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

A general plane quartic curve is a curve of the form (1) Examples include the ampersand curve, bean curve, bicorn, bicuspid curve, bifoliate, bifolium, bitangent-rich curve, ...

A sequence produced by the instructions "reverse, add to the original, then sort the digits." For example, after 668, the next iteration is given by 668+866=1534, so the next ...

Ramanujan's two-variable theta function f(a,b) is defined by f(a,b)=sum_(n=-infty)^inftya^(n(n+1)/2)b^(n(n-1)/2) (1) for |ab|<1 (Berndt 1985, p. 34; Berndt et al. 2000). It ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

Let alpha(G) denote the independence number of a graph G. Then the Shannon capacity Theta(G), sometimes also denoted c(G), of G is defined as ...

Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...