Search Results for ""
2331 - 2340 of 2910 for Integer complexitySearch Results
A unimodular matrix is a real square matrix A with determinant det(A)=+/-1 (Born and Wolf 1980, p. 55; Goldstein 1980, p. 149). More generally, a matrix A with elements in ...
A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...
Just as the ratio of the arc length of a semicircle to its radius is always pi, the ratio P of the arc length of the parabolic segment formed by the latus rectum of any ...
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 ...
The term "vesica piscis," meaning "fish bladder" in Latin, is used for the particular symmetric lens formed by the intersection of two equal circles whose centers are offset ...
A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...
Let a piecewise smooth function f with only finitely many discontinuities (which are all jumps) be defined on [-pi,pi] with Fourier series a_k = 1/piint_(-pi)^pif(t)cos(kt)dt ...
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 ...
Wolfram (2002, p. 123) considered the sequence related to the Collatz problem obtained by iterating w_n={3/2w_(n-1) for w_(n-1) even; 3/2(w_(n-1)+1) for w_(n-1) odd (1) ...
The conjecture that, for any triangle, 8omega^3<ABC (1) where A, B, and C are the vertex angles of the triangle and omega is the Brocard angle. The Abi-Khuzam inequality ...
...
View search results from all Wolfram sites (340627 matches)

