TOPICS
Search

Search Results for ""


531 - 540 of 1024 for Bootstrap MethodsSearch Results
Let (x_1,x_2) and (y_1,y_2) be two sets of complex numbers linearly independent over the rationals. Then the four exponential conjecture posits that at least one of ...
Consider a string of length 2L plucked at the right end and fixed at the left. The functional form of this configuration is f(x)=x/(2L). (1) The components of the Fourier ...
A Fredholm integral equation of the first kind is an integral equation of the form f(x)=int_a^bK(x,t)phi(t)dt, (1) where K(x,t) is the kernel and phi(t) is an unknown ...
An integral equation of the form phi(x)=f(x)+lambdaint_(-infty)^inftyK(x,t)phi(t)dt (1) phi(x)=1/(sqrt(2pi))int_(-infty)^infty(F(t)e^(-ixt)dt)/(1-sqrt(2pi)lambdaK(t)). (2) ...
Every polynomial equation having complex coefficients and degree >=1 has at least one complex root. This theorem was first proven by Gauss. It is equivalent to the statement ...
Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...
If u_n>0 and given B(n) a bounded function of n as n->infty, express the ratio of successive terms as |(u_n)/(u_(n+1))|=1+h/n+(B(n))/(n^r) for r>1. The series converges for ...
The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...
The Gibbs phenomenon is an overshoot (or "ringing") of Fourier series and other eigenfunction series occurring at simple discontinuities. It can be reduced with the Lanczos ...
The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...
1 ... 51|52|53|54|55|56|57 ... 103 Previous Next

...