Search Results for ""

A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...

A Taylor series is a series expansion of a function about a point. A one-dimensional Taylor series is an expansion of a real function f(x) about a point x=a is given by (1) ...

For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...

Taylor's inequality is an estimate result for the value of the remainder term R_n(x) in any n-term finite Taylor series approximation. Indeed, if f is any function which ...

Taylor's theorem states that any function satisfying certain conditions may be represented by a Taylor series, Taylor's theorem (without the remainder term) was devised by ...

An alternative spelling of the name "Chebyshev."

A plane curve given by the parametric equations x = cost (1) y = sintsin^m(1/2t). (2) The plots above show curves for values of m from 0 to 7. The teardrop curve has area ...

2^(40)=1024^4=1099511627776 bytes. Although the term terabyte is sometimes used to refer to 1024^4 bytes, such usage is deprecated in favor of the standard SI naming ...

A technique is a specific method of performing an operation. The terms algorithm, method, and procedure are also used interchangeably.

A game described by Scarne which is played on a 5×5 board by two players who alternate placing, one at a time, their four counters each, after which the counters are moved ...