Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let A_n,2(x) be the rational polynomial part of the nth iterated integral in the ln(1+x^2) case, and let α_n,2 be its denominator. Let m≥1 be an integer. Denominator conjecture. α_n,2= 1 if n=1, dfracn! *lcm(1,2,…,n)6 if n=2·3^m for some…
Let N be an index of a highly-composite Mersenne number if τ(2^N-1)>τ(2^m-1) for every integer m with 1leqslant m<N. Highly-composite Mersenne index conjecture. If N is restricted to indices of highly-composite Mersenne numbers, then…
Let a be an integer and let n>1 be odd. Write [x]_q for the q-analogue used in the paper, and let (·/n) denote the relevant quadratic character. The q-floor and q-ceiling determinant conjecture. det[[lflooraj-(a+1)k/n⌋]_q]_1leqslant…
We end with a question: Does there exist a simple, proper locality which is not locally finite ? CFSF2. Let e be a natural number and let Fe be the set of isomorphism classes of simple saturated fusion systems F over a finite 2-group, such…
The following extremal problem can now be posed: Put f(x) = max_m < x σ(m)/m where the maximum is to be taken over all the m for which the divisors of m do not form a covering system. By Haight's theorem f(x) tends to infinity as x → ∞. Is…
How much can we lower H in the local Fourier uniformity conjecture \begin{equation*} \int_X^{2X} \sup_\alpha \left| \sum_{x\leq n\leq x+H} \lambda(n) e(n\alpha) \right| d x = o(HX)? \end{equation*}
Let V(a_n,a_n-1,…,a_1) denote the set of lattice points associated with the coefficient vector (a_n,a_n-1,…,a_1), and let dens denote its density. Visibility density conjecture. For every coefficient vector other than (1,0,…,0),…
Let A be an infinite set such that there are no distinct a,b,c∈ A such that a| (b+c) and b,c>a. Is there such an A with liminf fraclvert A∩1,…,NrvertN^1/2>0? Does there exist some absolute constant c>0 such that there are always infinitely…
For a prime p and nonprincipal Dirichlet characters \chi\pmod p, determine the best constant C such that \min_{\chi}\max_{0\le x\le p}\left|\sum_{0<n\le x}\chi(n)\right|<C\sqrt p.
Let overlineOPT_k(n) denote the number of overpartition k-tuples with odd parts of size n. Let i≥ 1 and let r be odd, with n≥ 0 and n,i∈Z. Conjectured congruences. One has overlineOPT_2^ir(8n+1) ≡ 0pmod2^i+1, overlineOPT_2^ir(8n+2) ≡…
The source refers to parabolic primes p and to n-ghost right-triangles, but the supplied context does not define these terms. Conjecture on the infinitude of parabolic primes. There are infinitely many parabolic primes p, equivalently,…
Let N=q^k n^2 be an odd perfect number in Eulerian form, where q is prime, q≡ k≡ 1pmod 4, and gcd(q,n)=1. Let σ(m) denote the sum of the positive divisors of m, and let ν_q(N) denote the exponent of q in N. Dris's biconditional conjecture.…
Let l be a prime, K a number field, and A/K an abelian variety. As quadratic extensions L/K vary, the conjectures are that #\operatorname{Pic}(\mathcal O_L)[l] is unbounded and that #\operatorname{Sel}_l(A_L) is unbounded.
Let a_i be any infinite sequence of integers for which ∑ 1/a_i is divergent. Does the sequence contain arbitrarily long arithmetic progressions?
Let P_1,…,P_n∈Q[t] be pairwise distinct irreducible monic polynomials. Let k_i=Q[t]/(P_i(t)) be the corresponding number fields, and let a_i∈ k_i denote the class of t. For each i, let L_i/k_i be a finite extension and let b_i∈ k_i^*. Let…
Consider the two-player game in which players alternately choose integers from 2,3,…,n to be included in some set A (the same set for both players) such that no a| b for a≠ b∈ A. The game ends when no legal move is possible. One player…
Given pairs of odd primes p, q, define S(q,p) as the number of lattice points (m, n) in the rectangle 0 < m < p/2, 0 < n < q/2 below the diagonal. A pair is symmetric if S(p, q) = S(q,p). Is the number of symmetric primes less than x equal…
Is ∑ p_n/2^n irrational? (Here p_n is the nth prime.)
Question 14 (Pollack). Over a function field, how many coefficients of a polynomial (and in which positions) can be specified without eliminating the possibility of irreducibility?
Let a,b and n be positive integers with a>b. For integers x and y, write x| y when x divides y. Amdeberhan–Moll's divisibility conjecture. (2bn+1)(2bn+3)binom2bnbn| 3(a-b)(3a-b)binom2ananbinomanbn. The conjecture concerns divisibility…