Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let p and q be prime numbers, let ugeqslant 1, and let f(x)=a_nx^n+a_n-1x^n-1+…+a_qx^q+p^u∈Z[x]. Irreducibility conjecture. If pnmid a_na_q, qnmid u, and p^u>|a_n|+|a_n-1|+…+|a_q|, then f(x) is irreducible over Q. This conjecture seeks a…
For 0≤ θ≤ 1/2 and C>0, call an integer n a (θ,C)-almost square if n=ab for integers a,b∈[n^1/2-Cn^θ,n^1/2+Cn^θ]. Almost-square conjecture. Given 1/4<θ≤ 1/2, C>0, and any ε>0, for sufficiently large x, almost all intervals…
Let f_2,3(n) be the Birch–Erdős representation function for the parameters p=2 and q=3. Parity-density conjecture. lim_x→∞frac#n≤ x:2| f_2,3(n)x=1/2. The preceding results establish that both even and odd values occur infinitely often,…
Let n≥ 0, i≥ 3, and k≥ 0. The overcubic partition tuple function overlineb_m(r) is considered at the indicated arithmetic progressions. Congruence conjecture. For all n≥ 0, i≥ 3, and k≥ 0, overlineb_2^i k + 2^i-1-1(8n+5) ≡ 0 pmod2^i+2, and…
/Solymosi: Finite field Sylvester-Gallai: Suppose S is a tranversal of Z_(p)^(2), i.e., a set of points in the affine plane so that every row and column (any two distinguished maximal families of parallel lines, really) contains exactly…
Conjecture: for 100% (density one) of imaginary quadratic fields of prime class number, the absolute abelian Galois group is isomorphic to A_0=\widehat{\mathbb Z}^{\times}\times\prod_{n\ge1}\mathbb Z/n\mathbb Z.
Is there an infinite Lucas sequence a_0,a_1,… where a_n+2=a_n+1+a_n for n≥ 0 such that all a_k are composite, and yet no integer has a common factor with every term of the sequence?
Let s(n) denote the sum of the binary digits of n. For k∈14,15, consider odd integers n satisfying s(n)=s(n^2)=k. Finiteness conjecture. Let k∈14,15. Then the number of odd integers n with s(n)=s(n^2)=k is finite. The conjecture extends…
Find an exact formula for ∑_f∈ H_k^h L(1/2,Sym^2f)^2.
Call a triple (x,y,z) of positive integers a Markov triple if x^2+y^2+z^2=3xyz, and call it normalized if x≤ y≤ z. A Markov number is a positive integer occurring as a coordinate of some Markov triple. For every Markov number c there is…
Let A be a finite set of n positive integers, let d_k(A) be the number of k-subsets B of A satisfying ∑ B|∑ A, and let d(k,n) be the maximum of d_k(A) over all such sets A. Modified subset-divisor conjecture. For all but finitely many…
Let a_α(n) be the function studied in the paper for a real parameter α>1. The generalized growth conjecture. For any α>1 and C>0, for sufficiently large n one has a_α(n+1)>a_α(n)+C. This would strengthen the expected eventual strict…
Let (x)_0=1 and (x)_k=x(x+1)…(x+k-1) denote the Pochhammer symbol. Guo–Schlosser's supercongruence. For every prime p≡ 2pmod3, one has ∑_k=0^(p+1)/3(6k-1)frac(-1/3)_k^4(1)_2k(1)_k^4(-2/3)_2k≡ ppmodp^3. This is a supercongruence for a…
For odd primes p<q<r, let A(n) denote the height of the cyclotomic polynomial 4Φ_n(X). Beiter's conjecture. A(pqr) ≤ tfrac12(p+1) for all odd primes p<q<r. The conjecture was disproved by Leher's example A(17·29·41)=10>(17+1)/2; subsequent…
Let A⊂ (1,∞) be a countably infinite set such that for all x eq y∈ A and integers k≥ 1 we have lvert kx -yrvert ≥ 1. Does this imply that A is sparse? In particular, does this imply that ∑_x∈ A1/xlog x<∞ or ∑_substackx <n x∈ A1/x=o(log n)?
Is it true that there are only finitely many powers of 2 which have only the digits 0 and 1 when written in base 3?
Let n be a positive integer, let α<1/2, and let N be any number. Consider the integer lattice points (a,b) on the circle a^2+b^2=n whose second coordinate satisfies N≤ |b|<N+n^α. Circle lattice-point conjecture. There is a constant C_α…
For which (N+1)× (N+1) matrices A the map X∈BbbP^N↦ AX^d∈BbbP^N is PCF for some d≥ 2?
A critical vertex, edge, or set of edges, is one whose deletion lowers the chromatic number. Let k≥ 4 and r≥ 1. Must there exist a graph G with chromatic number k such that every vertex is critical, yet every critical set of edges has size…
Problem 1.1. Given a q-series, determine fast methods to find (heuristically) if it is modular. The method should require knowledge of the weight, but not require knowledge of the level or group.