Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let ft(n) denote the falling time associated with the accelerated 3x+1 map. Large-number falling-time conjecture. ft(n)≤ 4 for all n≥ 2^500. This is a strong quantitative form of the Collatz conjecture, motivated by computations and…
Let ε>0. Is it true that, for all large n, the number of divisors of n in (n^1/2,n^1/2+n^1/2-ε) is O_ε(1)?
Consider Pascal triangle modulo 2, and let c(n) be the binary number obtained by reading its nth row. Define l(n)=c(2n)-1/4. Stephan's third ratio conjecture. lim_n→∞l(8n+4)/l(8n+3)=257/85. The conjecture belongs to R. Stephan's series…
Are there infinitely many n such that binom2nn is coprime to 105?
Let E_k(λ) denote the Euclid polynomials, and consider the series 1/λ=∑_k=1^n1/E_k(λ)+frac1E_n+1(λ)-1. The “cauliflower” is the region depicted in Figure. Cauliflower convergence conjecture. There is convergence outside the “cauliflower”…
Let M = ∏_p|M p^a_p and N = K · ∏_p|M p^b_p be integers with a_p, b_p ≥ 1 and gcd(K,M) = 1. For each prime factor p|M, define t_p:= ⌈ a_p / b_p ⌉. The sequence b(n) is assumed to have a minimal period P_min. Minimal-period formula. If t_p…
Let (a_n) be defined by a_1=1, and a_n=a_n-1+lcm(n,a_n-1) (n≥ 2). Define the multiplicative increments b_n=fraca_na_n-1-1=fracngcd(n,a_n-1). Prime-increment conjecture. For every n≥ 2, we have b_n∈1∪P, where P denotes the set of prime…
Fix a finite group G and an irreducible, nontrivial complex representation ρ. study ∑_k ε(1/2, ρ_k), where the sum is over G-extensions k over F_q(t) and ρ_k: Gal(overline F_q(t)/ F_q) → G xrightarrowρ GL_r( C). in the case G = Z/ℓ Z,…
Let p be a prime, let N ≥ 0, and consider the congruence referred to in the paper as . Count its nontrivial solutions in the variable r. **Wilson congruence solution-count distribution conjecture.** The proportion of primes p for which has…
Give an algebraic description of the boundary and maps in the boundary in characteristic p not necessarily 0. (Reference DeMarco). Try d=3. Motivation: results for moduli curves use understanding of the boundary.
Let g(m) denote the Jacobsthal function of a positive integer m. Jacobsthal-function gap conjecture. For all positive integers j, there exists some positive integer k along with primes q_1<q_2<…<q_k and primes r_1<r_2<…<r_k such that q_i≤…
Let q_1<q_2<… be a sequence of primes such that q_n+1-q_n≥ q_n-q_n-1. Must lim_n q_n/n^2=∞?
Selberg's 1/4 conjecture: the eigenvalues of the Laplace operator on Maass wave forms of congruence subgroups are at least 1/4.
Let S_N be the symmetric group on N letters, and consider its character table. The proportion of entries in this table that are equal to zero is measured among all entries. Miller and Scheinerman's conjecture. The proportion of entries…
Let n,m∈N satisfy n>2, ⌊log_2(n)⌋+1≥ m>1, and suppose there is no k∈N such that k^m=n. Then Shunia's conjecture. ⌊√[m]n⌋=⌊frac(n^2nm+1)^2nm+1bmod(n^2nm^2-n)(n^2nm+1)^2nmbmod(n^2nm^2-n)-1⌋. The formula gives an elementary closed form for…
What kind of error terms do people expect for the moments? Diaconu suggests that there are infinitely many higher order terms. Could there be interesting secondary stable homology that can be understood? In which of the polynomial pieces…
If P(m) denotes the largest prime factor of m, does P(2^n-1)/n→∞ as n→∞?
Let F_1=F_2=1 and F_n+1=F_n+F_n-1 be the Fibonacci sequence. Let n_1<n_2<… be an infinite sequence with n_k+1/n_k ≥ c>1. Must ∑_kfrac1F_n_k be irrational?
Let P(q) = Σ_{n≥0} p(n)q^n be the partition generating function, represented in the report by a hypergeometric expansion. Prove directly from that hypergeometric expansion that P(q) is a modular form.
Let p be prime, let m be a positive integer, and write Z_p^m for the integers modulo p^m. Let CR denote a cubic residue and let [i] denote the ith class in the classification of cubic residues over Z_p^m. Cubic-residue occurrence…