Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Call n highly composite if d(m)<d(n) for every m<n, and let Q(x) count the highly composite numbers not exceeding x. Is Q(x)>(log x)^k eventually for every fixed k≥1?
Let n be sufficiently large. Is there some choice of congruence class a_p for all primes 2≤ p≤ n such that every integer in [1,n] satisfies at least two of the congruences ≡ a_ppmodp?
Let p,q\in\mathbb{Z}[x,y] with p(0,0)=q(0,0)=0 and let f=(p,q):\mathbb{A}^2\to\mathbb{A}^2. Suppose f is dominant and, for every prime \ell, has a periodic \mathbb{F}_{\ell}-point other than (0,0). Must f have a periodic point rational…
Determine notion of stable conjugacy when stable conjugacy classes in widetildeG_F and widetildeH_L naturally are related.
Let A⊂N be an additive basis of order k which is minimal, in the sense that if B⊂ A is any infinite set then Abackslash B is not a basis of order k. Must there exist an infinite B⊂ A such that Abackslash B is a basis of order k+1?
Let d be a square-free positive integer. The notation o(√ d) means a quantity whose ratio to √ d tends to zero as d tends to infinity, and c=(1+o(1))√ d means that c/√ d tends to 1. Divisor approximation conjecture. For any square-free…
Let A⊂N be the set of n such that for every prime p| n there exists some d| n with d>1 such that d≡ 1pmodp. Is it true that there exists some constant c>0 such that for all large N lvert A∩ [1,N]rvert/N=exp(-(c+o(1))√log Nloglog N).
For every ε>0, is there a constant C_ε such that, for every prime p, each residue modulo p is a sum of at most C_ε inverses a^-1 with 1≤a≤p^ε, where inverses are taken modulo p?
Does every rational number with an odd denominator have an odd greedy expansion?
For r∈Q^+ and an integer k≥ 1, define the integer trace of the generalized q-binomial coefficient by retaining its integer exponents, and write [ genfrac0ptr+kk ]_q|_Z=∑_d≥ 0c_r(d)q^d. For power series with nonnegative coefficients, write…
Let p_1,…,p_k be distinct primes, and let v_p(n!) denote the exponent of p in the prime factorization of n!. Sun's conjecture. There are infinitely many positive integers n such that v_p_1(n!): v_p_2(n!): …: v_p_k(n!) = 1/p_1-1: 1/p_2-1:…
Fix k and N with 2≤ k≪ N/2. Consider a sequence (a_i) of consecutive natural numbers in 1,2,3,…,N^2-1,N^2 such that, for every i, a_i≠ xy for any x,y<kN. Restricted-factor gap conjecture. The length of (a_i) is at most of order (log N)^δ…
Let s_p(m) denote the sum of the base-p digits of m, and let 4C'4 be the set of squarefree numbers m such that s_p(m)=p for every prime factor p of m. Let 4C4 be the set of Carmichael numbers. Infinitude conjecture for primary Carmichael…
Let K be a number field and let π be a cuspidal automorphic representation of GL_n( A_K) with unitary central character. Is every local component π_v tempered; equivalently, at unramified places do all normalized Satake parameters have…
For a prime p put M_p=2^p-1. For real numbers A<B<√M_p let ω(p;A,B) denote the number of prime divisors of M_p lying in the interval [A,B], and put λ(p;A,B)= log(log B/log A) if A≥ 2p, [2pt]log(log B/log 2p) if A<2p. Then, as B/A→∞ and…
Let t_n=n(n+1)/2 be the nth triangular number, and let (n)_2^1 denote the positions of the 1s in the binary representation of n. Binary-weight conjecture. If n∈N is such that |(n)_2^1|≥ 6, then |(t_n)_2^1|≥ 4. This conjecture concerns how…
Let p(n) denote the partition function of n and let F(n) count the number of distinct prime factors of ∏_1≤ k≤ np(k). Does F(n)→ ∞ with n? Is F(n)>n for all sufficiently large n?
Fix positive integers m,n,r with m≥ 2 and n≥ 3, and let F_m,n=[C_n,f_m,id] and G_m,n=[C_n,(1+f)_m,id] be the SDS maps defined over ( Z/m Z)^n. For a map H, let Per_1(H^r) denote its points fixed by H^r. Prime-divisor conjecture. Every…
Let p>3 be a prime, and let r be a positive integer. The supercongruence. First, ∑_k=0^p-1(2pk+2k+1)frac(1/p+1)_k^2p+2k!^2p+2≡ 0pmodp^7. More generally,…
For N≥ 2, let t be the number of positive divisors of N, let g_1,…,g_r be the generators specified in the surrounding setup, and let σ_N,l be the associated quantities for divisors l of N with 1<l| N. Full-rank conjecture.…