Search Results for ""
7401 - 7410 of 13135 for sun rotationSearch Results

Given a triangle DeltaA_1A_2A_3, the points A_1, I, and J_1 lie on a line, where I is the incenter and J_1 is the excenter corresponding to A_1. Furthermore, the circle with ...
The incentral triangle DeltaI_AI_BI_C is the Cevian triangle of a triangle DeltaABC with respect to its incenter I. It is therefore also the triangle whose vertices are ...
A generalization of the complete beta function defined by B(z;a,b)=int_0^zu^(a-1)(1-u)^(b-1)du, (1) sometimes also denoted B_z(a,b). The so-called Chebyshev integral is given ...
The "complete" gamma function Gamma(a) can be generalized to the incomplete gamma function Gamma(a,x) such that Gamma(a)=Gamma(a,0). This "upper" incomplete gamma function is ...
A conic section that is tangent to all sides of a triangle is called an inconic. Any trilinear equation of the form ...
A function f(x) increases on an interval I if f(b)>=f(a) for all b>a, where a,b in I. If f(b)>f(a) for all b>a, the function is said to be strictly increasing. Conversely, a ...
A non-zero module which is not the direct sum of two of its proper submodules. The negation of indecomposable is, of course, decomposable. An abstract vector space is ...
Assume X, Y, and Z are lotteries. Denote "X is preferred to Y" as X≻Y, and indifference between them by X∼Y. One version of the probability axioms are then given by the ...
An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...
An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

...