TOPICS
Search

Search Results for ""


1641 - 1650 of 13134 for Theory of mindSearch Results
The image of A_5×A_5 in the special orthogonal group SO(4), where A_5 is the icosahedral group.
Relates invariants of a curve defined over the integers. If this inequality were proven true, then Fermat's last theorem would follow for sufficiently large exponents. ...
The Bolyai expansion of a real number x is a nested root of the form x=a_0-1+RadicalBox[{{a, _, 1}, +, RadicalBox[{{a, _, 2}, +, RadicalBox[{{a, _, 3}, +, ...}, m]}, m]}, m], ...
A ring with a unit element in which every element is idempotent.
If a field has the property that, if the sets A_1, ..., A_n, ... belong to it, then so do the sets A_1+...+A_n+... and A_1...A_n..., then the field is called a Borel field ...
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)
A pair of positive integers (a_1,a_2) such that the equations a_1+a_2x=sigma(a_1)=sigma(a_2)(x+1) (1) have a positive integer solution x, where sigma(n) is the divisor ...
A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...
Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...
The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.
1 ... 162|163|164|165|166|167|168 ... 1314 Previous Next

...