Search Results for ""

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

A prime number p is called circular if it remains prime after any cyclic permutation of its digits. An example in base-10 is 1,193 because 1,931, 9,311, and 3,119 are all ...

A series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms ...

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 constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...

A closed box composed of three pairs of rectangular faces placed opposite each other and joined at right angles to each other, also known as a rectangular parallelepiped. The ...

A Cullen number is a number of the form C_n=2^nn+1. The first few are 3, 9, 25, 65, 161, 385, ... (OEIS A002064). Cullen numbers are divisible by p=2n-1 if p is a prime of ...

A sequence of primes q_1<q_2<...<q_k is a Cunningham chain of the first kind (second kind) of length k if q_(i+1)=2q_i+1 (q_(i+1)=2q_i-1) for i=1, ..., k-1. Cunningham primes ...

A curtate cycloid, sometimes also called a contracted cycloid, is the path traced out by a fixed point at a radius b<a, where a is the radius of a rolling circle. Curtate ...

A special case of Apollonius' problem requiring the determination of a circle touching three mutually tangent circles (also called the kissing circles problem). There are two ...