Search Results for ""

Given a triangle DeltaABC and a point P not a vertex of DeltaABC, define the A^'-vertex of the circumcevian triangle as the point other than A in which the line AP meets the ...

A circumellipse is a circumconic of a triangle that is an ellipse. There is an amazing formula for the area of a circumellipse. Let d_A be the length of the chord of the ...

The circumsphere of given set of points, commonly the vertices of a solid, is a sphere that passes through all the points. A circumsphere does not always exist, but when it ...

The clique covering number theta(G) of a graph G is the minimum number of cliques in G needed to cover the vertex set of G. Since theta(G) involves the minimum number of ...

A closed sentential formula is a sentential formula in which none of the variables are free (i.e., all variables are bound). Examples of closed sentential formulas are given ...

A system of circles obtained by multiplying each radius in a coaxal system by a constant. The Tucker circles are a coaxaloid system (Johnson 1929, p. 277).

A Colbert number is any prime number with more than 1000000 decimal digits whose discovery contributes to the long-sought after proof that k=78557 is the smallest Sierpiński ...

The vector space generated by the columns of a matrix viewed as vectors. The column space of an n×m matrix A with real entries is a subspace generated by m elements of R^n, ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...