Search Results for ""

The lines connecting the vertices and corresponding circle-circle intersections in Malfatti's problem coincide in a point X_(179) called the first Ajima-Malfatti point ...

Chebyshev-Gauss quadrature, also called Chebyshev quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function W(x)=(1-x^2)^(-1/2) (Abramowitz and ...

The probability P(a,n) that n random arcs of angular size a cover the circumference of a circle completely (for a circle with unit circumference) is ...

The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...

A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...

The connected domination number of a connected graph G, denoted d(G), is the size of a minimum connected dominating set of a graph G. The maximum leaf number l(G) and ...

The initially palindromic numbers 1, 121, 12321, 1234321, 123454321, ... (OEIS A002477). For the first through ninth terms, the sequence is given by the generating function ...

Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...

The so-called generalized Fourier integral is a pair of integrals--a "lower Fourier integral" and an "upper Fourier integral"--which allow certain complex-valued functions f ...

Guy's conjecture, which has not yet been proven or disproven, states that the graph crossing number for a complete graph K_n is ...