Search Results for ""

Ball triangle picking is the selection of triples of points (corresponding to vertices of a general triangle) randomly placed inside a ball. n random triangles can be picked ...

Pick three points P=(x_1,y_1), Q=(x_2,y_2), and R=(x_3,y_3) distributed independently and uniformly in a unit disk K (i.e., in the interior of the unit circle). Then the ...

The polar coordinates r (the radial coordinate) and theta (the angular coordinate, often called the polar angle) are defined in terms of Cartesian coordinates by x = ...

The problem of finding the mean triangle area of a triangle with vertices picked inside a triangle with unit area was proposed by Watson (1865) and solved by Sylvester. It ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...

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

Porter's constant is the constant appearing in formulas for the efficiency of the Euclidean algorithm, C = (6ln2)/(pi^2)[3ln2+4gamma-(24)/(pi^2)zeta^'(2)-2]-1/2 (1) = ...

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

The pseudosquare L_p modulo the odd prime p is the least nonsquare positive integer that is congruent to 1 (mod 8) and for which the Legendre symbol (L_p/q)=1 for all odd ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...