Erdős Problem 389
Is it true that for every there is a such that
Questions, not proof records
Each statement record keeps the mathematical question, a dated status source, accessible references, and any pinned Lean formulation separate from proof verification.
sorry marks an admitted statement, not a proof. Source indexing does not mean the formulation has been independently built or certified by Therefore.Is it true that for every there is a such that
Is there an infinite Sidon set such that for all ?
Does there exists a constant c such that f n - 2 * n ~ c * (n / log n)?
Is it true that for some ?
Is it true that, for ,
Erdős and Hall conjecture that the sum is for any .
They ask about the behaviour of and also ask whether, for infinitely many , for all .
Is it true that for every there exists such that
Let be a set of density . Does contain a coset of some subspace of dimension at least ?
More precisely: does there exist an absolute constant such that for all and all nonempty with density , the sumset contains a coset of some subspace of dimension at least ?
The sumset is defined as , using the pointwise
scalar multiplication notation 10 • A where • denotes the iterated addition of a set.
Note: We model as Fin n → ZMod 2, which is an -dimensional vector space
over .
Brocard's Problem* Does have integer solutions other than ?
Suppose that is a set of density . What is the largest size of coset guaranteed to be contained in ?
We phrase this by asking for the exact function giving the maximum dimension of a guaranteed coset.
For what functions is it true that implies ?
Suppose that has density . Does contain a subspace of co-dimension ? [Sa11, Question 5.1]
Can one show that for some constant ?
Suppose that is a set with an additive complement of size . Does contain a coset of codimension ?
Is it true that there is a constant such that for almost all we have ?
Could even contain a coset of codimension ?
Is it true that there are only finitely many powers of which have only the digits and when written in base ?
Suppose both have size at least . Must the sumset contain a composite number?
If we only allow the digits and then seems to be the largest such power of .