Search Results for ""

B_(p+k)=B_k+B_(k+1) (mod p), when p is prime and B_n is a Bell number.

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

One of the four 3-polyaboloes.

The unique 3-polyiamond, illustrated above.

Capable of taking on exactly one possible value.

A formula whose truth table contains only false in any interpretation is called unsatisfiable.

The symbol v variously means "disjunction" (i.e., OR in logic) or "join" (for a lattice).

A^n+B^n=sum_(j=0)^(|_n/2_|)(-1)^jn/(n-j)(n-j; j)(AB)^j(A+B)^(n-2j), where |_x_| is the floor function and (n; k) is a binomial coefficient.

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The Coxeter graph is a nonhamiltonian cubic symmetric graph on 28 vertices and 42 edges which can be constructed as illustrated above. It can also be constructed as the graph ...