Search Results for ""

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

A subset E of a topological space S is said to be of first category in S if E can be written as the countable union of subsets which are nowhere dense in S, i.e., if E is ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...

Given a property P, if P(x)∼x as x->infty (so, using asymptotic notation, the number of numbers less than x not satisfying the property P is o(x), where o(x) is one of the ...

A face-centered cubic sphere packing obtained by placing layers of spheres one on top of another. Because there are two distinct ways to place each layer on top of the ...

A convergence test also called "de Morgan's and Bertrand's test." If the ratio of terms of a series {a_n}_(n=1)^infty can be written in the form ...

A two-sided (doubly infinite) Laplace transform, L_t[f(t)](s)=int_(-infty)^inftyf(t)e^(-st)dt. While some authors use this as the primary definition of "the" Laplace ...

Let {A_n}_(n=0)^infty be a sequence of events occurring with a certain probability distribution, and let A be the event consisting of the occurrence of a finite number of ...

An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.

The series producing Brun's constant converges even if there are an infinite number of twin primes, first proved by Brun (1919).