Search Results for ""

Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...

A Pólya plot is a plot of the vector field of (R[f(z)],-I[f(z)]) of a complex function f(z). Several examples are shown above. Pólya plots can be created in the Wolfram ...

The statistics h_(r,s,...) defined such that <h_(r,s,...)>=mu_rmu_s..., where mu_r is a central moment. These statistics generalize h-statistics and were originally called ...

A class of map projections in which the parallels are represented by a system of non-concentric circular arcs with centers lying on the straight line representing the central ...

The (signed) area of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) is A=1/2(|x_1 x_2; y_1 y_2|+|x_2 x_3; y_2 y_3|+...+|x_n x_1; y_n y_1|), ...

The length of the polygonal spiral is found by noting that the ratio of inradius to circumradius of a regular polygon of n sides is r/R=(cot(pi/n))/(csc(pi/n))=cos(pi/n). (1) ...

A regular polygram {n/k} is generalization of a (regular) polygon on n sides (i.e., an n-gon) obtained by connecting every ith vertex around a circle with every (i+k)th, ...

The geometric centroid of a polyhedron composed of N triangular faces with vertices (a_i,b_i,c_i) can be computed using the curl theorem as x^_ = ...

The diagonal of a polyhedron is any line segment connecting two nonadjacent vertices of the polyhedron. Any polyhedron having no diagonals must have a skeleton which is a ...

A packing of polyhedron in three-dimensional space. A polyhedron which can pack with no holes or gaps is said to be a space-filling polyhedron. Betke and Henk (2000) present ...