Search Results for ""
3361 - 3370 of 3920 for Rationaland Irrational NumbersSearch Results
A set of numbers a_0, a_1, ..., a_(m-1) (mod m) form a complete set of residues, also called a covering system, if they satisfy a_i=i (mod m) for i=0, 1, ..., m-1. For ...
A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...
A composite knot is a knot that is not a prime knot. Schubert (1949) showed that every knot can be uniquely decomposed (up to the order in which the decomposition is ...
A concordant form is an integer triple (a,b,N) where {a^2+b^2=c^2; a^2+Nb^2=d^2, (1) with c and d integers. Examples include {14663^2+111384^2=112345^2; ...
Two elements alpha, beta of a field K, which is an extension field of a field F, are called conjugate (over F) if they are both algebraic over F and have the same minimal ...
A constructive proof is a proof that directly provides a specific example, or which gives an algorithm for producing an example. Constructive proofs are also called ...
Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take f(t) = F_nu^(-1)[F(nu)](t)=int_(-infty)^inftyF(nu)e^(2piinut)dnu (1) g(t) = ...
A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...
A group generated by the elements P_i for i=1, ..., n subject to (P_iP_j)^(M_(ij))=1, where M_(ij) are the elements of a Coxeter matrix. Coxeter used the notation [3^(p,q,r)] ...
A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...
...
View search results from all Wolfram sites (30401 matches)

