TOPICS
Search

Search Results for ""


1101 - 1110 of 1677 for Square Root Fun<wbr>ctionSearch Results
A complex number may be taken to the power of another complex number. In particular, complex exponentiation satisfies (a+bi)^(c+di)=(a^2+b^2)^((c+id)/2)e^(i(c+id)arg(a+ib)), ...
Two complex numbers x=a+ib and y=c+id are multiplied as follows: xy = (a+ib)(c+id) (1) = ac+ibc+iad-bd (2) = (ac-bd)+i(ad+bc). (3) In component form, ...
The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...
Pairs of partitions for a single number whose Ferrers diagrams transform into each other when reflected about the line y=-x, with the coordinates of the upper left dot taken ...
The connected sum M_1#M_2 of n-manifolds M_1 and M_2 is formed by deleting the interiors of n-balls B_i^n in M_i^n and attaching the resulting punctured manifolds M_i-B^._i ...
A curve of order n is generally determined by n(n+3)/2 points. So a conic section is determined by five points and a cubic curve should require nine. But the Maclaurin-Bézout ...
A cross section of a solid is a plane figure obtained by the intersection of that solid with a plane. The cross section of an object therefore represents an infinitesimal ...
A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...
The average number of regions into which n randomly chosen planes divide a cube is N^_(n)=1/(324)(2n+23)n(n-1)pi+n+1 (Finch 2003, p. 482). The maximum number of regions is ...
Given four points chosen at random inside a unit cube, the average volume of the tetrahedron determined by these points is given by ...
1 ... 108|109|110|111|112|113|114 ... 168 Previous Next

...