Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let S be the set of odd positive integers n such that 2n/σ(n)-1=1/x for some positive integer x. Its asymptotic density is the limit, when it exists, of fracπ_S(n)n, where π_S(n) counts elements of S not exceeding n. Toth's zero…
For integer n≥ 1 we define the factor difference set of n by D(n) = lvert a-brvert : n=ab. Is it true that, for every k≥ 1, there exist integers N_1<…<N_k such that lvert ∩_i D(N_i)rvert ≥ k?
Tempered Numerical Conjecture We choose k ≃ C to make statements of automorphic forms. We encourage readers to omit the “norm” decoration in first reading. Conjecture 2. [2, 14.2.1] Our input: • an everywhere unramified tempered…
Are there infinitely many natural numbers that are not of the form n-φ(n) for any n∈N? Equivalently, is N∖n-φ(n):n∈N infinite, where subtraction is in N?
Write H_1 = liminf_n→∞(p_n+1-p_n). Stadlmann had recently proved H_1 ≤ 240, improving the bound 246 of Polymath8b. Building on her work, this paper proves H_1 ≤ 212: infinitely many pairs of consecutive primes are at most 212 apart.
For an even integer 2m, let P(2m) be the set of primes p such that p-1| 2m, so that D_2m=∏_p∈ P(2m)p, where D_2m is the denominator of the Bernoulli number B_2m. Let F(d)=min2m>0:D_2m=d. Also let T(n) be the set of Toda primes of n, and…
Let ε>0 and n be large depending on ε. Is it true that for all n^ε<k≤ n^1-ε the number of distinct prime divisors of binomnk is (1+o(1))k∑_k<p<n1/p? Or perhaps even when k ≥ (log n)^c?
For N∈N∖1, call a prime p a base-N repunit prime if (N-1)p+1=N^q for a prime q. Let C_N denote the corresponding Cantor set obtained by retaining base-N expansions using only the digits 0 and N-1. Uniqueness conjecture. It is possible to…
Question 21. Let A/ Z be an algebra with rk Z A = 9 given by its multiplica-tion table. Suppose you know that A ' M3(Z); find an algorithm which gives an explicit isomorphism. (Stoll)
Let L(d) and D be as above, and restrict d to the indicated congruence classes. Residue-class supremum conjecture. sup_d≡1pmod8L(d)/√ D=fracL(41)√41=fracM(frac√41+274)√41=frac√41+32√41=0.734261…, sup_d≡1pmod3L(d)/√…
What is a quasi-Jacobi form? What are interesting examples? Generalize this notion to (quasi) automorphic forms. Generalize this notion to mock Siegel modular forms.
For a real number x otinr/s? Wait. Let [x]_q denote the q-deformation of a real number x e? defined as the stabilized formal power series associated with rational approximations to x. Its radius of convergence is denoted by R([x]_q).…
For every prime p>3, prove that ∑_n=0^p-1(2n+1)^3v_n (frac52)^2≡ 6p^4-143/3p^6pmodp^7, where v_n(x)=∑_k=0^nbinomnkbinomn+kkx^k.
Can one use the secondary term for counting cubic extensions to make some guess for the secondary stable homology of Hurwitz spaces parameterizing (simply branched) trigonal curves. In the case of Hurwitz spaces for S_3 with…
Let k_1≥ k_2≥ 3. Are there only finitely many n_2≥ n_1+k_1 such that ∏_1≤ i≤ k_1(n_1+i) and ∏_1≤ j≤ k_2(n_2+j) have the same prime factors?
Let k≥ 2 and q(n,k) denote the least prime which does not divide ∏_1≤ i≤ k(n+i). Is it true that, if k is fixed and n is sufficiently large, we have q(n,k)<(1+o(1))log n?
Let be an integer parameter and let denote the set of -Sondow numbers. The interval [2,||] consists of the integers from 2 through ||. **Small μ-Sondow number conjecture.** For all ∉ 0,1,-1,2,-2,4,16, \mathfrak{S}_{} \cap…
Let A be a finite set of positive integers, and write A+A=x+y:x,y∈ A, AA=xy:x,y∈ A. Erdős's sum-product conjecture. For every ε>0 there is an n_0 such that, whenever |A|≥ n_0, |(A+A)∪(AA)|≥ |A|^2-ε. This is the classical sum-product…
Obtain cancellations in additive twists of GL(3) Fourier coefficients Let π be a GL(3) Hecke--Maass cusp form with the n-th Fourier coefficient λ_π(1,n). For α∈R, prove a bound of the form ∑_n≪ N λ_π(1,n) e(nα) ≪_π N^1-δ, for some δ>0…
Small values of linear forms at prime arguments. A. Balog proposed the following problem: Show that the di ff erence |ap − q|, where p, q are primes and a > 1 is a fixed integer, can be small. More generally, consider the case when a is…