TOPICS
Search

Search Results for ""


2661 - 2670 of 2682 for Circle EquationSearch Results
The value for zeta(2)=sum_(k=1)^infty1/(k^2) (1) can be found using a number of different techniques (Apostol 1983, Choe 1987, Giesy 1972, Holme 1970, Kimble 1987, Knopp and ...
The Sierpiński sieve is a fractal described by Sierpiński in 1915 and appearing in Italian art from the 13th century (Wolfram 2002, p. 43). It is also called the Sierpiński ...
The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...
Let G be an undirected graph, and let i denote the cardinal number of the set of externally active edges of a spanning tree T of G, j denote the cardinal number of the set of ...
The utility problem posits three houses and three utility companies--say, gas, electric, and water--and asks if each utility can be connected to each house without having any ...
The xi-function is the function xi(z) = 1/2z(z-1)(Gamma(1/2z))/(pi^(z/2))zeta(z) (1) = ((z-1)Gamma(1/2z+1)zeta(z))/(sqrt(pi^z)), (2) where zeta(z) is the Riemann zeta ...
The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...
Let Sigma(n)=sum_(i=1)^np_i (1) be the sum of the first n primes (i.e., the sum analog of the primorial function). The first few terms are 2, 5, 10, 17, 28, 41, 58, 77, ... ...
The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...
A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

...