Search Results for ""
2351 - 2360 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...
The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...
For a power function f(x)=x^k with k>=0 on the interval [0,2L] and periodic with period 2L, the coefficients of the Fourier series are given by a_0 = (2^(k+1)L^k)/(k+1) (1) ...
sum_(n=0)^(infty)(-1)^n[((2n-1)!!)/((2n)!!)]^3 = 1-(1/2)^3+((1·3)/(2·4))^3+... (1) = _3F_2(1/2,1/2,1/2; 1,1;-1) (2) = [_2F_1(1/4,1/4; 1;-1)]^2 (3) = ...
The trace of a second-tensor rank tensor T is a scalar given by the contracted mixed tensor equal to T_i^i. The trace satisfies ...
If 0<=a,b,c,d<=1, then (1-a)(1-b)(1-c)(1-d)+a+b+c+d>=1. This is a special case of the general inequality product_(i=1)^n(1-a_i)+sum_(i=1)^na_i>=1 for 0<=a_1,a_2,...,a_n<=1. ...
A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...
The generalized Petersen graph GP(n,k), also denoted P(n,k) (Biggs 1993, p. 119; Pemmaraju and Skiena 2003, p. 215), for n>=3 and 1<=k<=|_(n-1)/2_| is a connected cubic graph ...
The scalar form of Laplace's equation is the partial differential equation del ^2psi=0, (1) where del ^2 is the Laplacian. Note that the operator del ^2 is commonly written ...
A generalized quadrangle is a generalized polygon of order 4. An order-(s,t) generalized quadrangle contains s+1 points in each line and has t+1 lines through every point, ...
...
View search results from all Wolfram sites (505142 matches)

