Search Results for ""

A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...

The sequence of variates X_i with corresponding means mu_i obeys the strong law of large numbers if, to every pair epsilon,delta>0, there corresponds an N such that there is ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...

The Suetake graph is a weakly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(72,(12),(0),(0,4)). It is distance-regular with intersection array ...

Symmetry operations include the improper rotation, inversion operation, mirror plane, and rotation. Together, these operations create 32 crystal classes corresponding to the ...

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 ...