Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For an elliptic curve E over a number field K, do the parity conjectures hold: assuming finiteness of the Tate–Shafarevich group, is (−1)^{rank E(K)} equal to the root number w(E/K), and, for every prime p, is the corresponding…
Let α be an odd norm-perfect Eisenstein integer. An Eisenstein integer is odd when it is not divisible by 1-ω, and an odd prime is an odd Eisenstein integer that is prime. Two Eisenstein integers share no common non-unit factors when every…
If f:\mathbb R_{>0}\to\mathbb R_{>0} is nondecreasing and f(x)+f(x/2)+f(x/3)+f(x/5)=(61/30+o(1))x as x\to\infty, must f(x)=(1+o(1))x?
For every ε>0, for all sufficiently large N∈N, and every set A⊆1,…,N with |A|≥ε N, must there exist a_1,a_2,a_3∈ A and pairwise distinct primes p_1,p_2,p_3 such that a_1p_1=a_2p_2=a_3p_3?
Let f(n) be maximal such that for every n-element set A⊆ N, ∏_substacka,b∈ A a≠ b(a+b) has at least f(n) distinct prime factors. Erdős asked whether f(n)/log n→∞. The answer is yes.
Let Z_2 be the ring of 2-adic integers, let overlineTcolonQ_2→Q_2 be given by overlineT_v(f)=3^v f+v/2 (v∈0,1), where at each iterate v is the residue modulo 2 of the current element. An element of Z_2 is eventually overlineT-periodic if…
Let g(n) count the number of m such that φ(m)=n. Is it true that, for every ε>0, there exist infinitely many n such that g(n) > n^1-ε?
Can N be partitioned into two sets, each of which can be permuted to avoid monotone 3-term arithmetic progressions?
Let P^+(n) denote the largest prime factor of n. For a,b∈[0,1], define B(x;a,b):=#n≤ x:P^+(n)≤ x^a, P^+(n+1)≤ x^b. Let ρ(t) denote the Dickman–de Bruijn function. Erdős–Pomerance conjecture. For every a,b∈[0,1],…
Let A⊆ N be an infinite set and consider the following greedy algorithm for a rational x∈ (0,1): choose the minimal n∈ A such that n≥ 1/x and repeat with x replaced by x-1/n. If this terminates after finitely many steps then this produces…
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…
Let T be a finite subset of the positive integers N. Finite-set completion conjecture. The set T can be completed in N, meaning that there is a complete set in N containing T. The supplied text gives no definition of “completed” or…
Define a sequence of integers (c_n)_n≥ 0 recursively by c_0 = 2, c_n+1 = 2^c_n - 1 . Thus c_1 = 3, c_2 = 7, c_3 = 127, c_4 = 2^127 - 1 = 170141183460469231731687303715884105727, and c_5 = 2^c_4 - 1. For every integer n ≥ 0, the number c_n…
For positive integers k and m, let σ_k(m-1) denote the sum of the k-th powers of the Gaussian integers in the relevant Gaussian-integer range, and consider the equation σ_k(m-1)=(m+mi)^k. Gaussian Erdős–Moser conjecture. The equation above…
Let k-Frobenius Problem denote the problem defined earlier in the source. The fixed-dimensional k-Frobenius Problem hardness conjecture. The k-Frobenius Problem is NP-hard for some fixed n. The source describes this as a significantly…
Problem 1.4. For vector-valued modular forms, do the matrices involved have interesting digi-talization? For example, in the Rogers-Ramanujan example, the transformation z 7 → z+1 leads to a diagonal matrix, where as z 7 → − 1/z does not.…
Let v_p denote the p-adic valuation. The variables x and q are integers with x>1, and p and q are primes in the second assertion. Sharp upper-bound conjecture for Fermat quotients. Except for finitely many pairs (x,p), one has…
Let A be the set of all n such that n=d_1+…+d_k with d_i distinct proper divisors of n, but this is not true for any m| n with m<n. Does ∑_n∈ A1/n converge?
A Zubrilina number is a number arising as a value of the divisor function in the sense defined in the paper. Infinitude conjecture. There are infinitely many Zubrilina numbers. This is posed as an open problem, and the source gives no…
\begin{enumerate} \item Analogy between dynatomic and modular curves (See Silverman, ADS Section 4.1 and 4.2 for dynatomic polynomials). \item What are other proxies for level structure, e.g. marked critical points, for which bad primes…