TOPICS
Search

Search Results for ""


911 - 920 of 1642 for Equivalence problemSearch Results
A figurate number Te_n of the form Te_n = sum_(k=1)^(n)T_k (1) = 1/6n(n+1)(n+2) (2) = (n+2; 3), (3) where T_k is the kth triangular number and (n; m) is a binomial ...
Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...
A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...
The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...
Some interesting properties (as well as a few arcane ones not reiterated here) of the number 239 are discussed in Schroeppel (1972). 239 appears in Machin's formula ...
Let L(x) denote the Rogers L-function defined in terms of the usual dilogarithm by L(x) = 6/(pi^2)[Li_2(x)+1/2lnxln(1-x)] (1) = ...
Ahmed's integral is the definite integral int_0^1(tan^(-1)(sqrt(x^2+2)))/(sqrt(x^2+2)(x^2+1))dx=5/(96)pi^2 (OEIS A096615; Ahmed 2002; Borwein et al. 2004, pp. 17-20). This is ...
A function representable as a generalized Fourier series. Let R be a metric space with metric rho(x,y). Following Bohr (1947), a continuous function x(t) for (-infty<t<infty) ...
Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...
Enclose a sphere in a cylinder and cut out a spherical segment by slicing twice perpendicularly to the cylinder's axis. Then the lateral surface area of the spherical segment ...
1 ... 89|90|91|92|93|94|95 ... 165 Previous Next

...