Search Results for ""

In Euclidean space R^3, the curve that minimizes the distance between two points is clearly a straight line segment. This can be shown mathematically as follows using ...

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

Oloa (2010, pers. comm., Jan. 20, 2010) has considered the following integrals containing nested radicals of 1/2 plus terms in theta^2 and ln^2costheta: R_n^- = (1) R_n^+ = ...

The two-argument Ramanujan function is defined by phi(a,n) = 1+2sum_(k=1)^(n)1/((ak)^3-ak) (1) = 1-1/a(H_(-1/a)+H_(1/a)+2H_n-H_(n-1/a)-H_(n+1/a)). (2) The one-argument ...

The rational distance problem asks to find a geometric configuration satisfying given properties such that all distances along specific edges are rational numbers. (This is ...

Consider the inequality sigma(n)<e^gammanlnlnn for integer n>1, where sigma(n) is the divisor function and gamma is the Euler-Mascheroni constant. This holds for 7, 11, 13, ...

The secant numbers S_k, also called the zig numbers or the Euler numbers E_n^*=|E_(2n)| numbers than can be defined either in terms of a generating function given as the ...

Find the tunnel between two points A and B on a gravitating sphere which gives the shortest transit time under the force of gravity. Assume the sphere to be nonrotating, of ...

The nth subfactorial (also called the derangement number; Goulden and Jackson 1983, p. 48; Graham et al. 2003, p. 1050) is the number of permutations of n objects in which no ...

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...