Search Results for ""

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

The goat problem (or bull-tethering problem) considers a fenced circular field of radius a with a goat (or bull, or other animal) tied to a point on the interior or exterior ...

A cubefree word contains no cubed words as subwords. The number of binary cubefree words of length n=1, 2, ... are 2, 4, 6, 10, 16, 24, 36, 56, 80, 118, ... (OEIS A028445). ...

A bitwin chain of length one consists of two pairs of twin primes with the property that they are related by being of the form: (n-1,n+1) and (2n-1,2n+1). (1) The first few ...

An optical illusion in which the orientation of arrowheads makes one line segment look longer than another. In the above figure, the line segments on the left and right are ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

There are a number of meanings for the word "arc" in mathematics. In general, an arc is any smooth curve joining two points. The length of an arc is known as its arc length. ...

A pyramid with a hexagonal base. The edge length of a hexagonal pyramid of height h is a special case of the formula for a regular n-gonal pyramid with n=6, given by ...

The natural parametric equations of a curve are parametric equations that represent the curve in terms of a coordinate-independent parameter, generally arc length s, instead ...

An epicycloid with n=5 cusps, named after the buttercup genus Ranunculus (Madachy 1979). Its parametric equations are x = a[6cost-cos(6t)] (1) y = a[6sint-sin(6t)]. (2) Its ...