Search Results for ""

Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.

The fractal-like figure obtained by performing the same iteration as for the Mandelbrot set, but adding a random component R, z_(n+1)=z_n^2+c+R. In the above plot, ...

The residual is the sum of deviations from a best-fit curve of arbitrary form. R=sum[y_i-f(x_i,a_1,...,a_n)]^2. The residual should not be confused with the correlation ...

If the fourth moment mu_4!=0, then P(|x^_-mu_4|>=lambda)<=(mu_4+3(N-1)sigma^4)/(N^3lambda^4), where sigma^2 is the variance.

The Machin-like formula 1/4pi=cot^(-1)2+cot^(-1)5+cot^(-1)8.

The sequence of binary digits of the Thue constant, 0.110110111110110111110110110..._2 (OEIS A014578). A recurrence plot of the limiting value of this sequence is illustrated ...

The Weierstrass substitution is the trigonometric substitution t=tan(theta/2) which transforms an integral of the form intf(costheta,sintheta)dtheta into one of the form ...

The integral transform defined by (Kphi)(x) =int_(-infty)^inftyG_(p+2,q)^(m,n+2)(t|1-nu+ix,1-nu-ix,(a_p); (b_p))phi(t)dt, where G_(c,d)^(a,b) is the Meijer G-function.

A discrete fast Fourier transform algorithm which can be implemented for N=2, 3, 4, 5, 7, 8, 11, 13, and 16 points.

The zonal polynomials are a class of orthogonal polynomials. They are a special case of the Jack polynomials corresponding to the case alpha=2.