Search Results for ""

Determining the maximum number of pieces in which it is possible to divide a circle for a given number of cuts is called the circle cutting or pancake cutting problem. The ...

Given a unit circle, pick two points at random on its circumference, forming a chord. Without loss of generality, the first point can be taken as (1,0), and the second by ...

Select three points at random on the circumference of a unit circle and find the distribution of areas of the resulting triangles determined by these three points. The first ...

An n×n matrix whose rows are composed of cyclically shifted versions of a length-n list l. For example, the 4×4 circulant matrix on the list l={1,2,3,4} is given by C=[4 1 2 ...

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 colossally abundant number is a positive integer n for which there is a positive exponent epsilon such that (sigma(n))/(n^(1+epsilon))>=(sigma(k))/(k^(1+epsilon)) for all ...

The complementary subspace problem asks, in general, which closed subspaces of a Banach space are complemented (Johnson and Lindenstrauss 2001). Phillips (1940) proved that ...

Find a square number x^2 such that, when a given integer h is added or subtracted, new square numbers are obtained so that x^2+h=a^2 (1) and x^2-h=b^2. (2) This problem was ...

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, ...

The first few terms of the continued fraction of the Copeland-Erdős constant are [0; 4, 4, 8, 16, 18, 5, 1, ...] (OEIS A030168), illustrated above. Interestingly, while the ...