Search Results for ""
771 - 780 of 3024 for Well Ordered SetSearch Results
A map is a way of associating unique objects to every element in a given set. So a map f:A|->B from A to B is a function f such that for every a in A, there is a unique ...
A primitive root of a prime p is an integer g such that g (mod p) has multiplicative order p-1 (Ribenboim 1996, p. 22). More generally, if GCD(g,n)=1 (g and n are relatively ...
A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...
Let K be a number field of extension degree d over Q. Then an order O of K is a subring of the ring of integers of K with d generators over Z, including 1. The ring of ...
A pathwise-connected domain is said to be simply connected (also called 1-connected) if any simple closed curve can be shrunk to a point continuously in the set. If the ...
One of the symmetry groups of the Platonic solids. There are three polyhedral groups: the tetrahedral group of order 12, the octahedral group of order 24, and the icosahedral ...
Let L be an extension field of K, denoted L/K, and let G be the set of automorphisms of L/K, that is, the set of automorphisms sigma of L such that sigma(x)=x for every x in ...
Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...
Let P(z) and Q(z) be univariate polynomials in a complex variable z, and let the polynomial degrees of P and Q satisfy deg(Q)>=deg(P+2). Then int_gamma(P(z))/(Q(z))dz = ...
The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...
...
View search results from all Wolfram sites (37299 matches)

