Search Results for ""

Given three objects, each of which may be a point, line, or circle, draw a circle that is tangent to each. There are a total of ten cases. The two easiest involve three ...

A 4-cusped hypocycloid which is sometimes also called a tetracuspid, cubocycloid, or paracycle. The parametric equations of the astroid can be obtained by plugging in n=a/b=4 ...

An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...

The binomial distribution gives the discrete probability distribution P_p(n|N) of obtaining exactly n successes out of N Bernoulli trials (where the result of each Bernoulli ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

A busy beaver is an n-state, 2-color Turing machine which writes a maximum number Sigma(n) of 1s before halting (Rado 1962; Lin and Rado 1965; Shallit 1998). Alternatively, ...

The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...

A (finite, circular) conical surface is a ruled surface created by fixing one end of a line segment at a point (known as the vertex or apex of the cone) and sweeping the ...

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

The cross graph is the 6-vertex tree illustrated above. It is implemented in the Wolfram Language as GraphData["CrossGraph"].