TOPICS
Search

Search Results for ""


1241 - 1250 of 13134 for Donaldson theorySearch Results
The continued fraction for Apéry's constant zeta(3) is [1; 4, 1, 18, 1, 1, 1, 4, 1, ...] (OEIS A013631). The positions at which the numbers 1, 2, ... occur in the continued ...
A number having 666 digits (where 666 is the beast number) is called an apocalypse number. The Fibonacci number F_(3184) is the smallest Fibonacci apocalypse number (Livio ...
Take K a number field and L an Abelian extension, then form a prime divisor m that is divided by all ramified primes of the extension L/K. Now define a map phi_(L/K) from the ...
Given a number field K, a Galois extension field L, and prime ideals p of K and P of L unramified over p, there exists a unique element sigma=((L/K),P) of the Galois group ...
Given a principal bundle pi:A->M, with fiber a Lie group G and base manifold M, and a group representation of G, say phi:G×V->V, then the associated vector bundle is ...
Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.
In April 1999, Ed Pegg conjectured on sci.math that there were only finitely many zerofree cubes, to which D. Hickerson responded with a counterexample. A few days later, Lew ...
A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...
A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...
A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...
1 ... 122|123|124|125|126|127|128 ... 1314 Previous Next

...