TOPICS
Search

Search Results for ""


1891 - 1900 of 13134 for binomial theorySearch Results
tau(n) is prime for n=63001, 458329, 942841, 966289, 1510441, ... (OEIS A135430). These values are also known as Lehmer-Ramanujan numbers or LR numbers since the first of ...
A Taylor graph is a distance-regular graph with intersection array {k,mu,1;1,mu,k}. A Taylor graph with these parameters has 2(k+1) vertices. The crown graphs K_2 square ...
In category theory, a tensor category (C, tensor ,I,a,r,l) consists of a category C, an object I of C, a functor tensor :C×C->C, and a natural isomorphism a = a_(UVW):(U ...
The tetranacci constant is ratio to which adjacent tetranacci numbers tend, and is given by T = (x^4-x^3-x^2-x-1)_2 (1) = 1.92756... (2) (OEIS A086088), where (P(x))_n ...
Color each segment of a knot diagram using one of three colors. If 1. At any crossing, either the colors are all different or all the same, and 2. At least two colors are ...
A continuous group G which has the topology of a T2-space is a topological group. The simplest example is the group of real numbers under addition. The homeomorphism group of ...
The total graph T(G) of a graph G has a vertex for each edge and vertex of G and an edge in T(G) for every edge-edge, vertex-edge, and vertex-vertex adjacency in G ...
A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...
A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...
A triangle-replaced graph T(G) is a cubic graph in which each vertex is replaced by a triangle graph such that each vertex of the triangle is connected to one of the ...
1 ... 187|188|189|190|191|192|193 ... 1314 Previous Next

...