Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For each degree n and signature parameter r_2, let M(n,r_2) denote the maximum value of the corresponding function Q(n,r_2,j_1,…,j_r_2,·), with the conjectured upper bounds listed in Table. Table-value conjecture. The values in the table…
Do any (2, 5)-perfect numbers exist?
Obtain a subconvexity bound for a rm GL_n× GL_m Rankin--Selberg L-function when n and m are not coprime. The simplest first cases would be obtaining a subconvexity bound (in any aspect) for a rm GL_4× GL_2 L-function or a rm GL_3× GL_3…
A positive integer n is powerful if p^2| n for every prime p dividing n. Three positive integers are consecutive powerful numbers if they have the form n,n+1,n+2 and each is powerful. Erdős–Mollin–Walsh conjecture. No three consecutive…
Let ℓ≥ 1 and let a_1,…,a_ℓ-1 be coefficients in -2,-1,0,1,2. Assume |1-∑_j=1^ℓ-1(2/3)^j a_ℓ-j|≤(2/3)^ℓ-1. Branch-jumping conjecture. There is a constant c>0 such that, whenever this condition holds, |i:a_i≠ 0|≥ cℓ. In particular, for any…
For each k∈N, let S be the set of those k for which there exists a strictly increasing function n:Fin(k+1)→N with no value equal to 0 and 1=∑_i∈Fin(k+1)frac1n(i). Let f:N→N satisfy, for every k∈ S, that f(k) is the least element of the set…
Call n weird if σ(n)≥ 2n and n is not pseudoperfect, that is, it is not the sum of any set of its divisors. Are there any odd weird numbers? Are there infinitely many primitive weird numbers, i.e. those such that no proper divisor of n is…
Can we make the calculations uniform in k?
Are there any pairs of betrothed numbers which have same parity?
Are there infinitely many balanced primes?
Question 3 2. (Voloch): Given a family of hypersurfaces, show that "almost all" members of the family satisfy the Hasse Principle in "interesting" circumstances. Colliot-Th´ el` ene: maybe the opposite? Poonen: the family was all…
Let F(x) be the maximal k such that there exist n+1,…,n+k≤ x with τ(n+1),…,τ(n+k) all distinct (where τ(m) counts the divisors of m). Estimate F(x). In particular, is it true that F(x) ≤ (log x)^O(1)? In other words, is there a constant…
For an odd prime p, define M(p)coloneqqmax_q,r A(pqr). Height-realisation conjecture. For every odd prime p and every integer h with 1≤ h≤ M(p), there exist primes q and r such that A(pqr)=h. The conjecture asserts that, for each fixed odd…
For a fixed positive integer b, let inv(a,b) denote the inversion number and let I_n(b) be its nth smallest value, where 1≤ n≤6. Six-smallest-values conjecture. For 1≤ n≤6, one has I_n(b)≥(n-1)(b+1)(b+1-n)/4n, with equality…
Let k≥ 2. Does (n+k)!^2 | (2n)! for infinitely many n?
conjecture. To go further on applications of Igusa’s conjecture on exponential sums, we need to work with the case of rational singularities. Recently, in a joint work with Veys, we proved this conjecture when f is in at most three…
Let B_2(n) be the 2-full part of n (that is, B_2(n)=n/n' where n' is the product of all primes that divide n exactly once). Is it true that, for every fixed k≥ 1, ∏_n≤ m<n+kB_2(m) ≪ n^2+o(1)? Or perhaps even ≪_k n^2?
If there are no nonzero functions on D^{\times}(\mathbb{Q})\backslash D^{\times}(\mathbb{A}{\mathbb{Q}})/(K\infty\cap D^{\times}(\mathbb{A}{\mathbb{Q}}))Z(D^{\times}(\mathbb{A}{\mathbb{Q}})) transforming according to the 3-dimensional…
Let n be a positive integer. The n-divisor property means that every integer from 1 through n divides at least one member of a specified product. The generalized arithmetic-progression divisor conjecture. There exist c=widetildeO(log n)…
For positive integers a_1,…,a_ℓ≥1, define the continued fraction [a_1,a_2,…,a_ℓ]=cfrac1a_1+cfrac1a_2+…+cfrac1a_ℓ. For a positive integer A, let Q_A be the set of denominators of reduced fractions in (0,1) admitting such an expansion with…