Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For every n,d∈N with d≠ 0, does there exist a nonzero k∈N such that d| ∑_i=n^n+k-1p_i, where p_i denotes the ith prime when primes are indexed starting from p_0?
Let A be a finite group with normal subgroup G of index |A:G|=n, and let Uleqslant G satisfy P_A(U)=P_A(G), where P_A(V) is the union of the A-conjugacy classes of elements of prime-power order that meet V. Normal-subgroup prime-power…
Compute the 3-point correlation function R_3(x_1,x_2,x_3) for zeta rigorously under suitable hypotheses (e.g. Hardy-Littlewood conjecture for twin primes).
Problem 2.4. Relate Bailey pair techniques with Bloch group techniques. In particular, develop a dictionary. Perhaps this might might help with the computation of torsion. Similarly, connect orthogonal polynomials to Bloch group techniques.
Let m be a positive integer. The Pisano period modulo m is one shortest period of the Fibonacci sequence modulo m, and its number of zeros is the order of m. OEIS conjecture A053031. An integer m has one zero in its Pisano period if and…
Let α_l(m) and β_l(m) be the integer-coefficient polynomials whose existence is asserted by the preceding theorem, characterized by d_l(m)=frac1l!m!2^m+l(α_l(m)∏_k=1^m(4k-1)-β_l(m)∏_k=1^m(4k+1)). Root-location conjecture. All the roots of…
If τ(n) counts the number of divisors of n then let F(f,n)=τ((n+⌊ f(n)⌋)!)/τ(n!). Is it true that lim_n→ ∞F((log n)^C,n)=∞ for large C? Is it true that F(log n,n) is everywhere dense in (1,∞)? More generally, if f(n)≤ log n is a monotonic…
Let π be a fixed Hecke-Maass cusp form for SL_3(Z) and f be a holomorphic for Hecke Maass cusp form for Γ_0(M). Obtain a subconvexity bound estimate for L(1/2, π× f) as M grows.
Let 2=p_1<p_2<… be the primes and k≥ 2. Is it true that, for all sufficiently large n, there must exist an integer in [n,n+p_1… p_k) with >k many prime factors?
Let (a,b)-Fibonacci sequences be defined by U_0=0, U_1=1, and U_n=aU_n-1+bU_n-2. Let ω_(a,-1)(m) be the number of zeros modulo m in one period. Negative-b multiplication conjecture. The multiplication table for ω_(a,-1)(lcm[m,n]) is c|cc…
Let k≥ 4, and let δ^*(k) denote the optimal balanced discrepancy for the module-lattice sign-selection problem. Write δ^* for the constant value proposed by the conjecture. Universal-constant conjecture. For all k≥ 4, the optimal balanced…
Design a delta symbol method over number fields in order to generalize the classical techniques to the number fields setting.
Is it true that for every k there are infinitely many primes p such that the largest prime divisor of ∏_0≤ i≤ k(p^2+i) is p?
Let f(n) = ∑_p<n1/n-p. Is it true that liminf f(n)=1 and limsup f(n)=∞? Is it true that f(n)=o(loglog n) for all n?
Let τ(n) denote the number of positive divisors of n. Is the sequence τ(n+1)/τ(n) dense in (0,∞)?
Let A_n,2(x) be the rational polynomial part of the nth iterated integral in the ln(1+x^2) case, let α_n,2 be its denominator, and define β_n,2=fracα_n,2nα_n-1,2. Here p denotes a prime and m,r∈N. The denominator-ratio conjecture. The…
Let n>1 be an odd integer. A squarefree integer is an integer not divisible by the square of any prime. Erdős's conjecture. There exist a squarefree integer m and an integer k such that n=m+2^k. The conjecture concerns representing every…
Erdős: Is there a prime between n^(2)and (n+1)^(2 )for every n > 0?
For which number theoretic functions f is it true that, for any F(n) such that f(n)/F(n)→ 0 for almost all n, there are infinitely many x such that frac# n∈ N : n+f(n)∈ (x,x+F(x))F(x)→ ∞?
Let be a finite list of positive integers, and let be the unit interval. A **Lebesgue measurable -Zeckendorf subset** of is a subset satisfying the -Zeckendorf condition described in the source. **Weak converse of Zeckendorf's theorem.**…