Search Results for ""

A figurate number constructed by taking the (3n-2)th tetrahedral number and removing the (n-1)th tetrahedral number from each of the four corners, Ttet_n = ...

A formal type of proof most frequently encountered in elementary geometry courses in which known or derived statements are written in the left column, and the reason that ...

Delta(x_1,...,x_n) = |1 x_1 x_1^2 ... x_1^(n-1); 1 x_2 x_2^2 ... x_2^(n-1); | | | ... |; 1 x_n x_n^2 ... x_n^(n-1)| (1) = product_(i,j; i>j)(x_i-x_j) (2) (Sharpe 1987). For ...

A variate is a generalization of the concept of a random variable that is defined without reference to a particular type of probabilistic experiment. It is defined as the set ...

There are at least two distinct notions known as the Whitehead group. Given an associative ring A with unit, the Whitehead group associated to A is the commutative quotient ...

Let three isoscelizers I_(AC)I_(AB), I_(BA)I_(BC), and I_(CA)I_(CB) be constructed on a triangle DeltaABC, one for each side. This makes all of the inner triangles similar to ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

The Delannoy numbers D(a,b) are the number of lattice paths from (0,0) to (b,a) in which only east (1, 0), north (0, 1), and northeast (1, 1) steps are allowed (i.e., ->, ^, ...

The divergence of a vector field F, denoted div(F) or del ·F (the notation used in this work), is defined by a limit of the surface integral del ·F=lim_(V->0)(∮_SF·da)/V (1) ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...