Search Results for ""

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 ...

A polyabolo is an analog of the polyomino composed of n isosceles right triangles joined along edges of the same length. Polyaboloes are sometimes also called polytans ...

A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...

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|), ...

There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...

The Prelle-Singer method is a semi-decision procedure for solving nonlinear first-order ordinary differential equations of the form y^'=P(x,y)/Q(x,y), where P and Q are ...

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

A positive number k such that a lamina or solid body with moment of inertia about an axis I and mass m is given by I=mk^2. Pickover (1995) defines a generalization of k as a ...

Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...

The number of ways N(m,n) of finding a subrectangle with an m×n rectangle can be computed by counting the number of ways in which the upper right-hand corner can be selected ...