Search Results for ""

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

A Wilson prime is a prime satisfying W(p)=0 (mod p), where W(p) is the Wilson quotient, or equivalently, (p-1)!=-1 (mod p^2). The first few Wilson primes are 5, 13, and 563 ...

The "witch of Agnesi" is a curve studied by Maria Agnesi in 1748 in her book Instituzioni analitiche ad uso della gioventù italiana (the first surviving mathematical work ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p). An s-cluster is an isolated group of s adjacent (i.e., horizontally ...

von Neumann-Bernays-Gödel set theory (abbreviated "NBG") is a version of set theory which was designed to give the same results as Zermelo-Fraenkel set theory, but in a more ...

Let L be a nontrivial bounded lattice (or a nontrivial complemented lattice, etc.). If every nonconstant lattice homomorphism defined on L is 0,1-separating, then L is a ...

Calculating the 13th root of a large number (that is a perfect 13th power) is a famous mental calculation challenge. However, because of difficulties in standardizing the ...

Let x_0 be a rational number in the closed interval [0,1], and generate a sequence using the map x_(n+1)=2x_n (mod 1). (1) Then the number of periodic map orbits of period p ...

How can a delegation of six regiments, each of which sends a colonel, a lieutenant-colonel, a major, a captain, a lieutenant, and a sub-lieutenant be arranged in a regular ...

The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...