Search Results for ""

Every odd integer n is a prime or the sum of three primes. This problem is closely related to Vinogradov's theorem.

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...

A linkage used in the original steam engine to turn back-and-forth motion into approximately straight-line motion.

A 4-polyhex.

Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...

If two curves of the same curve genus >1 are in rational correspondence, then that correspondence is birational.

If f is a continuous real-valued function on [a,b] and if any epsilon>0 is given, then there exists a polynomial p on [a,b] such that |f(x)-P(x)|<epsilon for all x in [a,b]. ...