TOPICS
Search

Search Results for ""


3411 - 3420 of 3783 for Fractional part functionSearch Results
Given a triangle DeltaABC, the triangle DeltaH_AH_BH_C whose vertices are endpoints of the altitudes from each of the vertices of DeltaABC is called the orthic triangle, or ...
A permutation cycle is a subset of a permutation whose elements trade places with one another. Permutations cycles are called "orbits" by Comtet (1974, p. 256). For example, ...
If A moves along a known curve, then P describes a pursuit curve if P is always directed toward A and A and P move with uniform velocities. Pursuit curves were considered in ...
A semiprime, also called a 2-almost prime, biprime (Conway et al. 2008), or pq-number, is a composite number that is the product of two (possibly equal) primes. The first few ...
Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...
A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...
The truncated icosahedron is the 32-faced Archimedean solid with 60 vertices corresponding to the facial arrangement 20{6}+12{5}. It is also the uniform polyhedron with ...
The Zermelo-Fraenkel axioms are the basis for Zermelo-Fraenkel set theory. In the following (Jech 1997, p. 1), exists stands for exists, forall means for all, in stands for ...
The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...
An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a "DAG." Every finite acyclic digraph has at least one node of ...
1 ... 339|340|341|342|343|344|345 ... 379 Previous Next

...