Search Results for ""

A tree with its nodes labeled. The number of labeled trees on n nodes is n^(n-2), the first few values of which are 1, 1, 3, 16, 125, 1296, ... (OEIS A000272). Cayley (1889) ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

Let a, b, and c be the lengths of the legs of a triangle opposite angles A, B, and C. Then the law of cosines states a^2 = b^2+c^2-2bccosA (1) b^2 = a^2+c^2-2accosB (2) c^2 = ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

The Lemoine axis is the perspectrix of a reference triangle and its tangential triangle, and also the trilinear polar of the symmedian point K of the reference triangle. It ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

Consider a reference triangle DeltaABC and externally inscribe a square on the side BC. Now join the new vertices S_(AB) and S_(AC) of this square with the vertex A, marking ...

There are several types of numbers that are commonly termed "lucky numbers." The first is the lucky numbers of Euler. The second is obtained by writing out all odd numbers: ...

A lune is a plane figure bounded by two circular arcs of unequal radii, i.e., a crescent. (By contrast, a plane figure bounded by two circular arcs of equal radius is known ...

The MacBeath inconic of a triangle is the inconic with parameters x:y:z=a^2cosA:b^2cosB:c^2cosC. (1) Its foci are the circumcenter O and the orthocenter H, giving the center ...