Search Results for ""

Graph Strength

A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...

A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...

A vector space V is a set that is closed under finite vector addition and scalar multiplication. The basic example is n-dimensional Euclidean space R^n, where every element ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

sum_(n=0)^(infty)[(q)_infty-(q)_n] = g(q)+(q)_inftysum_(k=1)^(infty)(q^k)/(1-q^k) (1) = g(q)+(q)_inftyL(q) (2) = g(q)+(q)_infty(psi_q(1)+ln(1-q))/(lnq) (3) = ...

Analysis

Feynman (1997, p. 116) noticed the curious fact that the decimal expansion 1/(243)=0.004115226337448559... (1) repeats pairs of the digits 0, 1, 2, 3, ... separated by the ...

E. Pegg Jr. (pers. comm., Nov. 8, 2004) found an approximation to Apéry's constant zeta(3) given by zeta(3) approx 10+zeta(16)-sqrt(96), (1) which is good to 6 digits. M. ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...