Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let α,β ∈ R. Is it true that liminf_n→ ∞ n | nα | | nβ| =0 where |x| is the distance from x to the nearest integer?
Is there a permutation a_1,a_2,… of the positive integers such that a_k+a_k+1 is prime for every k≥1?
Let f∈ Z[x] be an irreducible polynomial of degree k>2 (and suppose that k eq 2^l for any l≥ 1) such that the leading coefficient of f is positive. Does the set of integers n≥ 1 for which f(n) is (k-1)-power-free have positive density? Are…
For a locally finite circle packing P in the complex plane, does there exist a Borel measure omega_P and an exponent alpha such that the number of circles meeting every nice bounded Borel set E and having curvature less than T is…
Let X be a variety. Suppose one has a diagram Xdashleftarrow Ydashrightarrow P^n, where Ydashrightarrow P^n is finite of degree d. Then, as a consequence of Hilbert irreducibility, X will have a Zariski dense set of degree d points. Can we…
There exists a constant C>0 such that, for all large N, if A⊆ 1,…,N has size at least 5/8N+C then there are distinct a,b,c∈ A such that a+b,a+c,b+c∈ A.
The goal is to formulate a Manin-type conjecture for degree d points on Fano varieties. Let X/k be a Fano variety defined over a number field k. For a subset U⊂ X, an integer d, a real number B>0, and a line bundle L on X, define N_X,…
Let L be a primitive covering number, meaning a positive integer that is a covering number but has no proper divisor that is a covering number. Write its prime factorization as L=p_1^a_1… p_r^a_r, where p_1,…,p_r are distinct primes and…
Are there infinitely many Kummer primes?
Conjecture If every second positive integer except 2 is remaining, then every third remaining integer except 3, then every fourth remaining integer etc., an infinite number of the remaining integers are prime.
Let |n| denote the smallest number of ones needed to write the positive integer n using addition and multiplication. For integers k,ℓ≥ 0, with k and ℓ not both equal to 0, the integer under consideration is 2^k3^ℓ. Integer-complexity…
Let f(X)∈Z[X] be a separable polynomial of degree g≥ 1, and suppose that gcdf(n):n∈Z is square-free. For N≥ 1, define δ_f(N)=|apmod N:f(a)≡ 0pmod N|. Square-free values asymptotic conjecture. There is a positive constant…
Let f∈Z[X] be a polynomial, respectively a monic polynomial, of degree n≥ 4, respectively n≥ 3, with discriminant D≠ 0. Here H(g) denotes the height of a polynomial g, and GL_2(Z)-equivalence, respectively Z-equivalence, is the equivalence…
For any given integers k≥ 1, b≥ 2, c≠ 0, with gcd(k, c) = 1 and gcd(b, c) = 1, are there infinitely many primes of the form (k× b^n+c)/gcd(k+c,b-1) with integer n ≥ 1?
Denote by A_n the least common multiple of the integers 1, 2, ..., n and let p_k denote the k^th prime. Almost certainly A_p_k+1-1 < p_k A_p_k must hold for every k but the proof of this is certainly beyond our ability [...]. In fact, if…
Let t≥ 1 and let d_t be the density of the set of integers n∈N for which t can be represented as the sum of distinct divisors of n. Do there exist constants c_1,c_2>0 such that d_t ~ fracc_1(log t)^c_2 as t→ ∞?
Is there any way to get lower bounds for small moments (e.g. first moment) in families, even assuming GRH?
Understand different GIT quotients for M_d^N[n].
Let a,b,c∈ Z∖0 satisfy a+b+c=0. Define rad(a,b,c):=∏_p| abcp. The rational abc-conjecture. For every ε>0, there is a constant C_ε>0 such that max|a|,|b|,|c|≤ C_εrad(a,b,c)^1+ε. The paper introduces this as the traditional abc-conjecture…
Conjecture Skewes' number e^e^e^79 is not an integer.