Search Results for ""

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

The Poincaré hyperbolic disk is a two-dimensional space having hyperbolic geometry defined as the disk {x in R^2:|x|<1}, with hyperbolic metric ...

P is the point on the line AB such that PA^_/PB^_=1. It can also be thought of as the point of intersection of two parallel lines. In 1639, Desargues (1864) became the first ...

The polar coordinates r (the radial coordinate) and theta (the angular coordinate, often called the polar angle) are defined in terms of Cartesian coordinates by x = ...

Circumscribe a triangle about a circle, another circle around the triangle, a square outside the circle, another circle outside the square, and so on. The circumradius and ...

A formula relating the number of polyhedron vertices V, faces F, and polyhedron edges E of a simply connected (i.e., genus 0) polyhedron (or polygon). It was discovered ...

Consider a set A_n={a_1,a_2,...,a_n} of n positive integer-denomination postage stamps sorted such that 1=a_1<a_2<...<a_n. Suppose they are to be used on an envelope with ...

The Poussin graph is the 15-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...