Search Results for ""

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

Given a polynomial p(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 (1) of degree n with roots alpha_i, i=1, ..., n and a polynomial q(x)=b_mx^m+b_(m-1)x^(m-1)+...+b_1x+b_0 (2) of ...

A Ruth-Aaron pair is a pair of consecutive numbers (n,n+1) such that the sums of the prime factors of n and n+1 are equal. They are so named because they were inspired by the ...

A prime p is said to be a Sophie Germain prime if both p and 2p+1 are prime. The first few Sophie Germain primes are 2, 3, 5, 11, 23, 29, 41, 53, 83, 89, 113, 131, ... (OEIS ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

Square triangle picking is the selection of triples of points (corresponding to endpoints of a triangle) randomly placed inside a square. n random triangles can be picked in ...

A statistical distribution published by William Gosset in 1908. His employer, Guinness Breweries, required him to publish under a pseudonym, so he chose "Student." Given N ...

A superellipse is a curve with Cartesian equation |x/a|^r+|y/b|^r=1, (1) first discussed in 1818 by Lamé. A superellipse may be described parametrically by x = acos^(2/r)t ...

The (m,n)-tadpole graph, also called a dragon graph (Truszczyński 1984) or kite graph (Kim and Park 2006), is the graph obtained by joining a cycle graph C_m to a path graph ...

The nth taxicab number Ta(n) is the smallest number representable in n ways as a sum of positive cubes. The numbers derive their name from the Hardy-Ramanujan number Ta(2) = ...