Search Results for ""
3251 - 3260 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
The base-4 method of counting in which only the digits 0, 1, 2, and 3 are used. The illustration above shows the numbers 0 to 63 represented in quaternary, and the following ...
Gauss's continued fraction is given by the continued fraction ...
If an aliquot sequence {s^0(n),s(n),s^2(n),...} for a given n is bounded, it either ends at s(1)=0 or becomes periodic. If the sequence is periodic (or eventually periodic), ...
An ellipse intersects a circle in 0, 1, 2, 3, or 4 points. The points of intersection of a circle of center (x_0,y_0) and radius r with an ellipse of semi-major and ...
Let f:R×R->R be a one-parameter family of C^3 maps satisfying f(0,0) = 0 (1) [(partialf)/(partialx)]_(mu=0,x=0) = -1 (2) [(partial^2f)/(partialx^2)]_(mu=0,x=0) < 0 (3) ...
The hypergeometric orthogonal polynomials defined by P_n^((lambda))(x;phi)=((2lambda)_n)/(n!)e^(inphi)_2F_1(-n,lambda+ix;2lambda;1-e^(-2iphi)), (1) where (x)_n is the ...
For the Helmholtz differential equation to be separable in a coordinate system, the scale factors h_i in the Laplacian del ...
Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...
An n×n complex matrix A is called positive definite if R[x^*Ax]>0 (1) for all nonzero complex vectors x in C^n, where x^* denotes the conjugate transpose of the vector x. In ...
Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...
...


