Search Results for ""
2521 - 2530 of 2712 for Interior Point MethodSearch Results
![](/common/images/search/spacer.gif)
Let {a_i}_(i=1)^n be a set of positive numbers. Then sum_(i=1)^n(a_1a_2...a_i)^(1/i)<=esum_(i=1)^na_i (which is given incorrectly in Gradshteyn and Ryzhik 2000). Here, the ...
"Casting out nines" is an elementary check of a multiplication which makes use of the congruence 10^n=1 (mod 9). Let decimal numbers be written a=a_n...a_2a_1a_0, ...
The simple continued fraction representations for Catalan's constant K is [0, 1, 10, 1, 8, 1, 88, 4, 1, 1, ...] (OEIS A014538). A plot of the first 256 terms of the continued ...
An algebraic surface with affine equation P_d(x_1,x_2)+T_d(x_3)=0, (1) where T_d(x) is a Chebyshev polynomial of the first kind and P_d(x_1,x_2) is a polynomial defined by ...
The circle map is a one-dimensional map which maps a circle onto itself theta_(n+1)=theta_n+Omega-K/(2pi)sin(2pitheta_n), (1) where theta_(n+1) is computed mod 1 and K is a ...
Define S_n(x) = sum_(k=1)^(infty)(sin(kx))/(k^n) (1) C_n(x) = sum_(k=1)^(infty)(cos(kx))/(k^n), (2) then the Clausen functions are defined by ...
The Clebsch diagonal cubic is a cubic algebraic surface given by the equation x_0^3+x_1^3+x_2^3+x_3^3+x_4^3=0, (1) with the added constraint x_0+x_1+x_2+x_3+x_4=0. (2) The ...
The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...
A series is said to be conditionally convergent iff it is convergent, the series of its positive terms diverges to positive infinity, and the series of its negative terms ...
"Conext 21 polyhedron" is the name given here to the solid underlying the soccer ball of the 2020 Tokyo Olympic Games (held in 2021). It is implemented in the Wolfram ...
![](/common/images/search/spacer.gif)
...