Search Results for ""

In the case of a general surface, the distance between two points measured along the surface is known as a geodesic. For example, the shortest distance between two points on ...

A plot of a function expressed in polar coordinates, with radius r as a function of angle theta. Polar plots can be drawn in the Wolfram Language using PolarPlot[r, {t, tmin, ...

A prime factorization algorithm also known as Pollard Monte Carlo factorization method. There are two aspects to the Pollard rho factorization method. The first is the idea ...

Three-dimensional generalization of the polyominoes to n dimensions. The number of polycubes N(n) composed of n cubes are 1, 1, 2, 8, 29, 166, 1023, ... (OEIS A000162; Ball ...

A polyhedral nonhamiltonian graph is a graph that is simultaneously polyhedral and nonhamiltonian. The smallest possible number of vertices a nonhamiltonian polyhedral graph ...

A polyhedron compound is an arrangement of a number of interpenetrating polyhedra, either all the same or of several distinct types, usually having visually attractive ...

If P be a point in the plane of an equilateral triangle DeltaABC, then the lengths of line segments AP, BP, and CP correspond the sides of a triangle, which is degenerate ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

Let pi_(m,n)(x) denote the number of primes <=x which are congruent to n modulo m (i.e., the modular prime counting function). Then one might expect that ...

As first shown by Meyer and Ritchie (1967), do-loops (which have a fixed iteration limit) are a special case of while-loops. A function that can be implemented using only ...