TOPICS
Search

Search Results for ""


1461 - 1470 of 3872 for Numbered Equation 43Search Results
Let Gamma be an algebraic curve in a projective space of dimension n, and let p be the prime ideal defining Gamma, and let chi(p,m) be the number of linearly independent ...
Let {f_n(x)} be a sequence of analytic functions regular in a region G, and let this sequence be uniformly convergent in every closed subset of G. If the analytic function ...
Hyperreal numbers are an extension of the real numbers to include certain classes of infinite and infinitesimal numbers. A hyperreal number x is said to be finite iff |x|<n ...
There are 432 enantiomorphous and 415 chiral fully supported stellations of the icosidodecahedron. Using Miller's rules gives 7071672 enantiomorphous stellations and an ...
If p divides the numerator of the Bernoulli number B_(2k) for 0<2k<p-1, then (p,2k) is called an irregular pair. For p<30000, the irregular pairs of various forms are p=16843 ...
A formula for the generalized Catalan number _pd_(qi). The general formula is (n-q; k-1)=sum_(i=1)^k_pd_(qi)(n-pi; k-i), where (n; k) is a binomial coefficient, although ...
Applying the Kaprekar routine to 4-digit number reaches 0 for exactly 77 4-digit numbers, while the remainder give 6174 in at most 8 iterations. The value 6174 is sometimes ...
The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...
Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...
Let S be a nonempty set of real numbers that has an upper bound. Then a number c is called the least upper bound (or the supremum, denoted supS) for S iff it satisfies the ...
1 ... 144|145|146|147|148|149|150 ... 388 Previous Next

...