Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For an integer n with distinct prime divisors p, define f(n)=∑_p| np^a_p, where p^a_p≤n<p^a_p+1. Let F(n) be the maximum of ∑_i b_i over pairwise coprime positive integers b_i≤n whose prime divisors all divide n, and put m(x)=max_n≤xf(n)…
The listed exceptional images of elliptic curves over Q are complete; equivalently, any counterexample must arise from an unexpected rational point on one of the specified normalizer nonsplit Cartan modular curves or on one of two level-49…
Let f(X)=X^n+a_1X^n-1+3+a_n-1X+a_n be a monic polynomial of degree ngeqslant 3 with integer coefficients, and let G_f be its Galois group, viewed as a subgroup of the symmetric group S_n. For a large positive real number H, define…
Let X be a Hilbert modular variety. At some level (say, that of cohomology), these look like a product of modular curves. Under what circumstances does X have Tate classes not coming from modular subvarieties? Thinking of these classes as…
For each positive integer n, let T_n(x)=x^d_1+x^d_2+…+x^d_k-kx, where 1=d_1<d_2<…<d_k=n are all divisors of n. A positive integer n is weakly almost-prime if n| T_n(x) for every integer x; if it is also square-free, it is almost-prime.…
Let T be the tree constructed from positive integer solutions of the paper's Diophantine equation, and let (x,y,z) be a positive integer solution of that equation. The maximal number of a solution is the largest of its three coordinates.…
Let K/Q be Galois of degree n≥ 3, with Galois group G. Let η∈ K^× be such that the multiplicative Z[G]-module generated by η has Z-rank n. For any unramified prime p prime to η, let o_p(η) denote the order of η modulo p. Write n_p for the…
Let q tend to infinity through primes, let D_k(α) be the normalized variance of the k-fold divisor function in reduced residue classes, and let γ_k(α) be the same piecewise-polynomial function as in the short-interval problem.…
Does there exist an n_0 such that for every i and n > n_0 we have d_n+2i > d_n+2i+1 and d_n+2i+1 < d_n+2i+2, where d_n = p_n+1 - p_n?
Let t>1 be a rational number. Is ∑_n=1^∞1/t^n-1=∑_n=1^∞ τ(n)/t^n irrational, where τ(n) counts the divisors of n?
Determine the connection between Mock modular forms and geometric invariants like Gromov-Witten, Donaldson, and OSV conjecture.
For positive integers r, s, t, and n, define S_6(r,s,t;n)= ∑_k=-n^n(-1)^k6nchoose 3n+k^r4nchoose 2n+k^s2nchoose n+k^t. The 6n divisibility conjecture. For all positive r, s, t, and n, S_6(r,s,t;n) is divisible by both 26nchoose n and…
A positive odd integer m such that none of 2^km+1 are prime for k≥ 0 is called a Sierpinski number. We say that a set of primes P is a covering set for m if every 2^km+1 is divisible by some p∈ P. Are there Sierpinski numbers with no…
For each integer m≥ 1, let c_2,m, e_2,m, d_1,m, and f_1,m be the numbers appearing in Theorems and. Coefficient relations. The following identities hold: c_2,m+e_2,m=0 and d_1,m+f_1,m=0. The conjecture is motivated by comparing the…
Let A,B⊆ N be two infinite sets. How dense can A+B be if all elements of A+B are pairwise relatively prime?
Subconvexity bound for Rankin-Selberg L-functions 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…
Let p be a prime and let n≥ 3. A Farey sequence of Γ_0(p^n) is denoted by e_i. Optimal upper-bound conjecture. The group Γ_0(p^n) has a Farey sequence e_i such that e_i≤ p^n-1. The preceding algorithm achieves the analogous optimal upper…
Let p^k(n) denote the number of partitions of n into perfect k-th powers. In particular, p^2(n) is the square power partition function, and let a,b be positive integers. Square power partition function inequality conjecture. The inequality…
Is the Pythagorean equation x^2+y^2=z^2 partition regular on \mathbb N, meaning that every finite coloring of \mathbb N has a nontrivial monochromatic solution?
For any k≥ 2 let g_k(n) denote the maximum value of (a_1+…+a_k)-n where a_1,…,a_k are integers such that a_1!… a_k! | n!. Can one show that ∑_n≤ xg_k(n) ~ c_k xlog x for some constant c_k? Is it true that there is a constant c_k such that…