Search Results for ""
521 - 530 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
If mu=(mu_1,mu_2,...,mu_n) is an arbitrary set of positive numbers, then all eigenvalues lambda of the n×n matrix a=a_(ij) lie on the disk |z|<=m_mu, where ...
product_(k=1)^(infty)(1-x^k) = sum_(k=-infty)^(infty)(-1)^kx^(k(3k+1)/2) (1) = 1+sum_(k=1)^(infty)(-1)^k[x^(k(3k-1)/2)+x^(k(3k+1)/2)] (2) = (x)_infty (3) = ...
If theta is a given irrational number, then the sequence of numbers {ntheta}, where {x}=x-|_x_|, is dense in the unit interval. Explicitly, given any alpha, 0<=alpha<=1, and ...
For algebraic alpha |alpha-p/q|<1/(q^(2+epsilon)), with epsilon>0, has finitely many solutions. Klaus Roth received a Fields medal for this result.
sum_(y=0)^m(-1)^(m-y)q^((m-y; 2))[m; y]_q(1-wq^m)/(q-wq^y) ×(1-wq^y)^m(-(1-z)/(1-wq^y);q)_y=(1-z)^mq^((m; 2)), where [n; y]_q is a q-binomial coefficient.
Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...
A Poulet number is a Fermat pseudoprime to base 2, denoted psp(2), i.e., a composite number n such that 2^(n-1)=1 (mod n). The first few Poulet numbers are 341, 561, 645, ...
Define O = lim_(->)O(n),F=R (1) U = lim_(->)U(n),F=C (2) Sp = lim_(->)Sp(n),F=H. (3) Then Omega^2BU = BU×Z (4) Omega^4BO = BSp×Z (5) Omega^4BSp = BO×Z. (6)
Due to Lebesgue and Brouwer. If an n-dimensional figure is covered in any way by sufficiently small subregions, then there will exist points which belong to at least n+1 of ...
The chromatic number of a graph is at most the maximum vertex degree Delta, unless the graph is complete or an odd cycle, in which case Delta+1 colors are required.
...
View search results from all Wolfram sites (505142 matches)

