Conjecture A Fermat prime is a Fermat number that is prime. The only known Fermat primes are F_0 =3,F_1=5,F_2=17,F_3 =257 ,F_4=65537 It is unknown if other fermat primes exist.
Problem Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an grid. The first player (if any) to occupy four cells at the vertices of a square with horizontal and vertical sides is the winner. What is the outcome of the game given optimal play? Note: Roland Bacher and Shalom Eliahou proved that every 15 x 15 binary matrix contains four equal entries (all 0's or all 1's) at the vertices of a square with horizontal and vertical sides. So the game must result in a winner (the first player) when n=15.
Conjecture Let is a -separable (the same as for symmetric transitive) compact funcoid and is a uniform space (reflexive, symmetric, and transitive endoreloid) such that . Then .
The main purpose here is to find a direct proof of this conjecture. It seems that this conjecture can be derived from the well known theorem about existence of exactly one uniformity on a compact set. But that would be what I call an indirect proof, we need a direct proof instead.
The direct proof may be constructed by correcting all errors an omissions in this draft article.
Direct proof could be better because with it we would get a little more general statement like this:
Conjecture Let be a -separable compact reflexive symmetric funcoid and be a reloid such that \item ; \item .
Question \item Does hold over graphs of bounded tree-width? \item Is included in over graphs? \item Does have a 0-1 law? \item Are properties of Hanf-local? \item Is there a logic (with an effective syntax) that captures ?
The zeroes of the Riemann zeta function that are inside the Critical Strip (i.e. the vertical strip of the complex plane where the real part of the complex variable is in ]0;1[), are actually located on the Critical line ( the vertical line of the complex plane with real part equal to 1/2)
Conjecture Suppose that is a -edge-critical graph. Suppose that for each edge of , there is a list of colors. Then is -edge-colorable unless all lists are equal to each other.
Conjecture Polignac's Conjecture: For any positive even number n, there are infinitely many prime gaps of size n. In other words: There are infinitely many cases of two consecutive prime numbers with difference n.
In particular, this implies:
Conjecture Twin Prime Conjecture: There are an infinite number of twin primes.
Conjecture Let be a complex projective variety. Then every Hodge class is a rational linear combination of the cohomology classes of complex subvarieties of .
Conjecture An endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges. Among all the vertices' trees, the star with vertices has the most endomorphisms, while the path with vertices has the least endomorphisms.
Conjecture There exists a fixed constant so that every abelian group has a subset with so that the Cayley graph has no clique or independent set of size .
login/create account
be the unique integer (with respect to a fixed 
) such that
is a prime iff ![$$ \displaystyle \sum_{i=1}^{\left \lfloor \frac{\sqrt[3]p}{2} \right \rfloor} r_i = \left \lfloor \frac{\sqrt[3]p}{2} \right \rfloor $$](/files/tex/99af565f4cc4d3bab11eb3fbf54f78626678d484.png)
is called a Diophantine 
-tuple if 
is a perfect square for all 
. 
is a Diophantine quadruple and 
, then 
![\[ F_n = 2^{2^n } + 1 \]](/files/tex/0da5a50010e4e5df91c0d58080245ece34ec9ca6.png)
that is prime. The only known Fermat primes are F_0 =3,F_1=5,F_2=17,F_3 =257 ,F_4=65537 It is unknown if other fermat primes exist.
grid. The first player (if any) to occupy four cells at the vertices of a square with horizontal and vertical sides is the winner. What is the outcome of the game given optimal play? Note: Roland Bacher and Shalom Eliahou proved that every 15 x 15 binary matrix contains four equal entries (all 0's or all 1's) at the vertices of a square with horizontal and vertical sides. So the game must result in a winner (the first player) when n=15. 
is a 
-separable (the same as 
for symmetric transitive) compact funcoid and 
is a uniform space (reflexive, symmetric, and transitive endoreloid) such that 
. Then 
. 
. 
. 
is a sequence of elements from a multiplicative group of order 
, then there exist 
so that 
. 
points in the plane in general position contains a subset of 
-minor-free graph is 
-list-colourable for some constant 
. 
hold over graphs of bounded tree-width? \item Is 
included in 
over graphs? \item Does 
is not an integer. 
on an even number of vertices can be decomposed into 
directed paths. 
for some filter objects 
, 
. Particularly, is this formula true for 
? 
for some filter objects 
, there exists a Fibonacci number divisible by 
, 
does not divide 
where 
is the Legendre symbol. 
contains a directed path of length 
. 
is a 
-edge-critical graph. Suppose that for each edge 
of 
of 
-edge-colorable unless all lists are equal to each other. 
exist a 
is for every sets 
and 
be a complex projective variety. Then every Hodge class is a rational linear combination of the cohomology classes of complex subvarieties of 
is 
such that its fundamental group has an element of finite order?
denote the 
is called edge-antipodal if 
whenever 
are antipodal edges. 
and 
which are joined by a monochromatic path. 
so that every abelian group 
with 
so that the 
has no clique or independent set of size 
. 
Drupal
CSI of Charles University