Search Results for ""
3721 - 3730 of 13134 for Graph TheorySearch Results
Let chi be a nonprincipal number theoretic character over Z/Zn. Then for any integer h, |sum_(x=1)^hchi(x)|<=2sqrt(n)lnn.
Let n be a positive integer and r(n) the number of (not necessarily distinct) prime factors of n (with r(1)=0). Let O(m) be the number of positive integers <=m with an odd ...
The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...
Let A be a C^*-algebra. An element a in A is called positive if a=a* and sp(a) subset= R^+, or equivalently if there exists an element b in A such that a=bb^*. For example, ...
A presheaf C of categories consists of the following data: 1. For every local homeomorphism f:Y->X of topological spaces X, Y, a category C(f:Y->X); 2. For every diagram f ...
A prime circle of order 2n is a free circular permutation of the numbers from 1 to 2n with adjacent pairs summing to a prime. The number of prime circles for n=1, 2, ..., are ...
An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...
A pseudoperfect number for which none of its proper divisors are pseudoperfect (Guy 1994, p. 46). The first few are 6, 20, 28, 88, 104, 272, ... (OEIS A006036). Primitive ...
A principal ideal domain is an integral domain in which every proper ideal can be generated by a single element. The term "principal ideal domain" is often abbreviated P.I.D. ...
Almost all processes that are not obviously simple can be viewed as computations of equivalent sophistication (Wolfram 2002, pp. 5 and 716-717). More specifically, the ...
...
View search results from all Wolfram sites (33872 matches)

