Search Results for ""

Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...

Specifying three sides uniquely determines a triangle whose area is given by Heron's formula, K=sqrt(s(s-a)(s-b)(s-c)), (1) where s=1/2(a+b+c) (2) is the semiperimeter of the ...

The point of coincidence of P and P^' in Fagnano's theorem.

Specifying three angles A, B, and C does not uniquely define a triangle, but any two triangles with the same angles are similar. Specifying two angles of a triangle ...

Specifying two angles A and B and a side a opposite A uniquely determines a triangle with area K = (a^2sinBsinC)/(2sinA) (1) = (a^2sinBsin(pi-A-B))/(2sinA). (2) The third ...

Specifying two adjacent angles A and B and the side between them c uniquely (up to geometric congruence) determines a triangle with area K=(c^2)/(2(cotA+cotB)). (1) The angle ...

Specifying two sides and the angle between them uniquely (up to geometric congruence) determines a triangle. Let c be the base length and h be the height. Then the area is ...

The identity _2F_1(x,-x;x+n+1;-1)=(Gamma(x+n+1)Gamma(1/2n+1))/(Gamma(x+1/2n+1)Gamma(n+1)), or equivalently ...

The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...