Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
What if Σ is infinite? Can a maximizer be periodic? . Chaired by Jens Marklof. Notes taken by Paul Nelson. 2. Javier Fresán, Pseudopolynomial permutation approximation problem Let f \in Z[T ] be an irreducible polynomial of degree n whose…
Are there infinitely many twin primes? Twin primes are pairs of primes that differ by 2, such as (3, 5), (5, 7), (11, 13), (17, 19), (29, 31).
A cubic conjugate vector is a vector arising from a cubic algebraic number together with its conjugates, as in the paper's definition; a triple of cubic conjugate vectors is a triple of such vectors associated with the three conjugate…
Let M_d(x) denote the necklace polynomial, and let cPhi_m(x) denote the mth cyclotomic polynomial. The preceding results provide structural conditions under which M_d(x) is divisible by polynomials of the form x^m-1 or x^m+1, each of which…
Let p,q ∈ Z be coprime integers with 1<q<p^2, with p odd and q even. Let Δ(p,q) denote the triangle defined in the paper, and suppose that Pick's formula is almost correct for every dilate rΔ(p,q) with r∈N. Completeness conjecture. The…
For a polynomial f(x) = ax^2 + bx + c with a > 0, gcd(a,b,c) = 1, and discriminant Δ = b^2 - 4ac not a perfect square, the polynomial takes infinitely many prime values. Furthermore, the number P(n) of primes of the form f(x) ≤ n satisfies…
Let τ be the Thue–Morse constant, and let τ_n=s_n/F_n, where F_n=2^2^n+1 is the n-th Fermat number and the numerators satisfy s_1=2 and s_n+1=1+(2^2^n-1)s_n for n≥1. Conjecture on convergents. For every n≥1, the fraction τ_n=s_n/F_n is a…
Let n=p_1… p_t be square-free, and let ω(d) denote the number of primes dividing d. The parity-product conjecture. B(n) is attained by at least one of the two polynomials ∏_d| n, ω(d)≡ 1pmod2Φ_d(x) or ∏_d| n, ω(d)≡ 0pmod2Φ_d(x). The…
For positive integers m and n, define A_r(n)=∑_k=0^2n(-1)^kbinom2nk^r. Here gcd(a_1,a_2,…) denotes the greatest common divisor of the indicated integers. Guo–Jouhet–Zeng's gcd conjecture. gcd(A_m(n),A_m+1(n),A_m+2(n),…)=binom2nn. Calkin's…
Let K be a number field, let μ be an adelic measure defined over K, let h_μ be its associated height on P^1(overlineK), and let L(μ) denote the energy infimum associated with μ. Lehmer-type conjecture above the energy minimum. There exists…
Given a subgroup G of rmPGL_N+1, we define M_d^N[G] to be the Zariski closed subset defined by maps whose automorphism group contains an isomorphic copy of G. Investigate these loci.
Let rtextgreater 1 and let slk=(k_1,…,k_r)∈(Z_>0)^r with k_r>1. The Borwein–Girgensohn parity conjecture. The multiple zeta value ζ(k_1,…,k_r) can be expressed in terms of multiple zeta values of lower depth when its depth r and weight…
Let d_n=p_n+1-p_n, where p_n is the nth prime. Let h(x) be maximal such that for some n<x the numbers d_n,d_n+1,…,d_n+h(x)-1 are all distinct. Estimate h(x). In particular, is it true that h(x) >(log x)^c for some constant c>0, and…
Give a ZFC proof of the existence of a Hausdorff ultrafilter.
For positive integers h and k, define S(h,k):=∑_j=1^k-1(-1)^j+1+⌊ hj/k⌋, where ⌊ x⌋ is the greatest integer less than or equal to x, and define S(k):=∑_h=1^k-1S(h,k). Let C_1 and C_2 be any fixed positive numbers, and let ε>0 be fixed.…
Do any Taxicab(5, 2, n) exist for n > 1?
Let a = a_1, …, a_k. Define ∑_n τ_a(n) n^-s:= ∏_i=1^k l(s+a_i). Then ∑_n χ_d(n)τ_a(n) n^-s:= ∏_i=1^k l(s+a_i,χ_d). Observe ∑_d=1^d ∑_n=1^x χ_d(n) τ_a(n)n^-1/2~ ∑_d=1^d ∑_substackn=1 n square ^x τ_a(n) n^-1/2. In order to recover the…
Let 0<α≤1/2 and let X be a sufficiently large integer. Given constants 0<c_1<c_2≤1, consider the least L such that [X-L,X] contains an integer divisible by some integer in [c_1X^α,c_2X^α]. Almost-divisibility conjecture. For every ε>0, one…
Let d_i denote the values used in the proposed Collatz-based number system, and let the odd integers be the odd members of the system. Fundamental-set conjecture. The values d_i are the fundamental, or principal, sets for all odd integers,…
Let k≥ 2. Does there exist a prime p and consecutive intervals I_1,…,I_k such that ∏_n∈ I_in ≡ 1pmodp for all 1≤ i≤ k?