Search Results for ""
2751 - 2760 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
Also known as metric entropy. Divide phase space into D-dimensional hypercubes of content epsilon^D. Let P_(i_0,...,i_n) be the probability that a trajectory is in hypercube ...
The n functions f_1(x), f_2(x), ..., f_n(x) are linearly dependent if, for some c_1, c_2, ..., c_n in R not all zero, sum_(i=1)^nc_if_i(x)=0 (1) for all x in some interval I. ...
The Poisson-Charlier polynomials c_k(x;a) form a Sheffer sequence with g(t) = e^(a(e^t-1)) (1) f(t) = a(e^t-1), (2) giving the generating function ...
The base-2 transcendental number 0.11011011111011011111..._2 (1) (OEIS A014578), where the nth bit is 1 if n is not divisible by 3 and is the complement of the (n/3)th bit if ...
The Weierstrass constant is defined as the value sigma(1|1,i)/2, where sigma(z|omega_1,omega_2) is the Weierstrass sigma function with half-periods omega_1 and omega_2. ...
"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...
11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...
The Harary index of a graph G on n vertices was defined by Plavšić et al. (1993) as H(G)=1/2sum_(i=1)^nsum_(j=1)^n(RD)_(ij), (1) where (RD)_(ij)={D_(ij)^(-1) if i!=j; 0 if ...
S(nu,z) = int_0^infty(1+t)^(-nu)e^(-zt)dt (1) = z^(nu-1)e^zint_z^inftyu^(-nu)e^(-u)du (2) = z^(nu/2-1)e^(z/2)W_(-nu/2,(1-nu)/2)(z), (3) where W_(k,m)(z) is the Whittaker ...
A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...
...
View search results from all Wolfram sites (505142 matches)

