Search Results for ""

The point of concurrence K of the symmedians, sometimes also called the Lemoine point (in England and France) or the Grebe point (in Germany). Equivalently, the symmedian ...

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...

The symmetric group S_n of degree n is the group of all permutations on n symbols. S_n is therefore a permutation group of order n! and contains as subgroups every group of ...

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

Szemerédi's theorem states that every sequence of integers that has positive upper Banach density contains arbitrarily long arithmetic progressions. A corollary states that, ...

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

Tait's Hamiltonian graph conjecture asserted that every cubic polyhedral graph is Hamiltonian. It was proposed by Tait in 1880 and refuted by Tutte (1946) with a ...

Two circles with centers at (x_i,y_i) with radii r_i for i=1,2 are mutually tangent if (x_1-x_2)^2+(y_1-y_2)^2=(r_1+/-r_2)^2. (1) If the center of the second circle is inside ...

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) = ...

A Taylor series is a series expansion of a function about a point. A one-dimensional Taylor series is an expansion of a real function f(x) about a point x=a is given by (1) ...