Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let n be an odd squarefree positive integer. Define δ(n) by δ(n)= 1, n≡3pmod4, 0, otherwise. The Möbius-inversion class-number conjecture. One has h^*(-n)δ(n)=∑_d| nμ(frac nd)(1-d/2δ(d)-2f(d)). The paper derives this as a conjectural…
If Euler's totient function φ(n) divides n-1, must n be prime?
Let n≥ 1 and define L_n to be the least common multiple of 1,…,n and a_n by ∑_1≤ k≤ n1/k=a_n/L_n. Is it true that (a_n,L_n)=1 and (a_n,L_n)>1 both occur for infinitely many n?
Let k≥ 2 be an integer, let x≥ 1 be real, and let Q_k(t) denote the number of k-full numbers at most t. A number is k-full if every exponent in its prime factorization is at least k. Short-interval upper-bound conjecture. There exists a…
satisfying L(s, \pi, \tau ) = L(s, \tau ◦ \psi) for each \tau : Ĝ \to GLN (C). Conjecture (Functoriality, rough). A homomorphism ξ : Ĥ \to Ĝ produces a transfer of automorphic representations ξ∗ : AutRep(H) \to AutRep(G) such that L(s,…
Let T(i)=frac12 i(i+1) be the i-th triangular number, let i≤_ Tj mean that T(i) divides T(j), and let μ_ T be the Möbius function of the poset ( N,≤_ T). Weighted-sum conjecture. There is a positive constant E such that…
Let k≥ 1 and σ_k(n)=∑_d| nd^k. Is ∑ σ_k(n)/n! irrational?
Let h ∈ mathbbN be fixed. Is there a sequence X_k → ∞ such that | ∑_n ≤ X_k λ(n) λ(n + h) | → ∞ as k → ∞? We could also consider variants for multiplicative functions f with values in ± 1. We can handle f pretentious, and can also do it…
Let p_1<p_2<… be a sequence of primes such that p_i+1≡ 1pmodp_i. Is it true that lim_k p_k^1/k=∞? Does there exist such a sequence with p_k ≤ exp(k(log k)^1+o(1))?
Let k>2 be a prime such that 2^k-1 is a Mersenne prime. For integers alpha, β>1 and an odd prime p<3· 2^α-1-1, let n=2^α-1p^β-1. Generalized perfect-number conjecture. One has n| σ_k(n) if and only if n is an even perfect number different…
Let n,r≥ 1, let L=-3,-2,-1,2,3,4,5, and let S_(r,n)(ℓ) denote the generalized binomial sum defined in the paper. Extended non-integrality conjecture. If ℓ∈L, then S_(r,n)(ℓ)∉Z. The conjecture extends the known non-integrality result beyond…
Let p be an odd prime and let θ be a Dirichlet character with p midcond(θ). Write χ=θω^i for a character of the first kind, let O_χ=Z_p[Im(χ)], and let λ_p(χ) be the degree of the distinguished polynomial in the Iwasawa power series…
Strong AQUE problem: For Hecke--Maass cusp forms on the modular surface with eigenvalue \lambda\to\infty, prove quantitative equidistribution \mu_\phi\to\mu at a power rate \lambda^{-\delta} for some \delta>0.
Let X_n be the direct product of complete graphs associated with the positive integer n, let [? g(n) denote the Jacobsthal function, and let [? γ_t(X_n) denote the total domination number of X_n. Unbounded total-domination gap conjecture.…
Let n, k, and t be integers satisfying (k^2-n^2)^2+4k^4n^4=t^2. Conjecture A. Every such integer solution satisfies either n=± k, or n=0, or k=0. The conjecture is motivated by the absence of nontrivial examples in a search with n,k≤ 100…
For a base b, let G_b' be the finite graph constructed from comma-sequence danger intervals, and let P be a uniformly randomly chosen path in G_b'. Write |P| for the number of vertices in P, and let E[|P|] and Var(|P|) denote its mean and…
Let T be the map on positive integers defined by T(n)= 3n+1/2 if n is odd, [2pt]frac n2 otherwise. For an integer n>0, write T^(j)(n) for the j-th iterate of T. Absence of non-trivial cycle. There do not exist integers n>2 and j>0 such…
What can we say about correlations with itself of 1_p^+(n) ≤ n^δ, with δ → 0? Here p^+(n):= maxp: p|n. Even upper bounds would be welcome. This kind of result would imply sharp mean values for Dirichlet polynomials supported on smooth…
The uniqueness conjecture for Markov numbers that every Markov number is the largest number in exactly one normalized solution to the Markov Diophantine equation.
Call a number k-perfect if σ(n)=kn, where σ(n) is the sum of the divisors of n. Must k=o(loglog n)?