Search Results for ""
191 - 200 of 592 for U 29_ 600Search Results
The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...
A series expansion is a representation of a particular function as a sum of powers in one of its variables, or by a sum of powers of another (usually elementary) function ...
A species of structures is a rule F which 1. Produces, for each finite set U, a finite set F[U], 2. Produces, for each bijection sigma:U->V, a function F[sigma]:F[U]->F[V]. ...
Define the packing density eta of a packing of spheres to be the fraction of a volume filled by the spheres. In three dimensions, there are three periodic packings for ...
A superior highly composite number is a positive integer n for which there is an e>0 such that (d(n))/(n^e)>=(d(k))/(k^e) for all k>1, where the function d(n) counts the ...
tau(n) is prime for n=63001, 458329, 942841, 966289, 1510441, ... (OEIS A135430). These values are also known as Lehmer-Ramanujan numbers or LR numbers since the first of ...
A curve which can be used to trisect an angle. Although an arbitrary angle cannot be trisected using only compass and straightedge (i.e., according to the strict rules of ...
A unit fraction is a fraction with numerator 1. Examples of unit fractions include 1/2, 1/3, 1/12, and 1/123456. The famous Rhind papyrus, dated to around 1650 BC, discusses ...
A triangular matrix U of the form U_(ij)={a_(ij) for i<=j; 0 for i>j. (1) Written explicitly, U=[a_(11) a_(12) ... a_(1n); 0 a_(22) ... a_(2n); | | ... |; 0 0 ... a_(nn)]. ...
Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...
...
View search results from all Wolfram sites (29028 matches)

