Search Results for ""
5651 - 5660 of 8565 for L 1 NormSearch Results
Consider the inequality sigma(n)<e^gammanlnlnn for integer n>1, where sigma(n) is the divisor function and gamma is the Euler-Mascheroni constant. This holds for 7, 11, 13, ...
The Schläfli graph is a strongly regular graph on 27 nodes which is the graph complement of the generalized quadrangle GQ(2,4). It is the unique strongly regular graph with ...
Let p run over all distinct primitive ordered periodic geodesics, and let tau(p) denote the positive length of p, then every even function h(rho) analytic in ...
Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_(11)=f(x_(11)). Then Shovelton's rule ...
Slovin's formula, somtimes also spelled "Sloven's forumula (e.g., Altares et al. 2003, p. 13), is an ad hoc formula lacking mathematical rigor (Ryan 2013) that gives an ...
A plane shape constructed by Reinhardt (1934) that is conjectured to be the "worst" packer of all centrally-symmetric plane regions. It has a packing density of ...
The triangle line that passes through the inner and outer Soddy centers S and S^'. The Soddy line is central line L_(657) and has trilinear equation ...
There are (at least) two equations known as Sommerfeld's formula. The first is J_nu(z)=1/(2pi)int_(-eta+iinfty)^(2pi-eta+iinfty)e^(izcost)e^(inu(t-pi/2))dt, where J_nu(z) is ...
The extension field K of a field F is called a splitting field for the polynomial f(x) in F[x] if f(x) factors completely into linear factors in K[x] and f(x) does not factor ...
Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...
...
View search results from all Wolfram sites (502043 matches)

