Search Results for ""

Fermat's spiral, also known as the parabolic spiral, is an Archimedean spiral with m=2 having polar equation r^2=a^2theta. (1) This curve was discussed by Fermat in 1636 ...

According to Hardy and Wright (1979), the 44-digit Ferrier's prime determined to be prime using only a mechanical calculator, is the largest prime found before the days of ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

In one dimension, the Gaussian function is the probability density function of the normal distribution, f(x)=1/(sigmasqrt(2pi))e^(-(x-mu)^2/(2sigma^2)), (1) sometimes also ...

The geometric mean of a sequence {a_i}_(i=1)^n is defined by G(a_1,...,a_n)=(product_(i=1)^na_i)^(1/n). (1) Thus, G(a_1,a_2) = sqrt(a_1a_2) (2) G(a_1,a_2,a_3) = ...

A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...

Let there be m doctors and n<=m patients, and let all mn possible combinations of examinations of patients by doctors take place. Then what is the minimum number of surgical ...

A googol is a large number equal to 10^(10^2)=10^(100) (i.e., a 1 with 100 zeros following it). Written out explicitly, ...

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...