Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let k be an integer and consider the congruence σ(n)≡ kpmod n, where σ(n) is the sum of the positive divisors of n. A solution is regular if n=pm, where p is prime, pnmid m, m|σ(m), and σ(m)=k; all other solutions are called sporadic. Let…
Let L(d) and D be as above, with d ranging over the relevant square-free positive integers. Global supremum conjecture. sup_dL(d)/√ D=fracL(293)√293=fracM(frac√293+152)√293=frac17√293=0.993150…. The paper says that computations suggest the…
For r\ge3 and fixed h\ne0, conjecture that D_r(X;h)=\sum_{n\le X}d_r(n)d_r(n+h)\sim X P_{2(r-1)}(\log X;h), where P_{2(r-1)}(u;h) is a degree-2(r-1) polynomial in u.
Question 4. Consider the hypersurface given by ∑ i xiy2 i = 0 in P3 × P3. Take the height H(x, y ) = sup |xi|3 · sup |yi|2 and throw out the set where some xi = 0, yi = 0. Can one estimate the counting function? (Peyre)
For integers b, c ≥ 2 let α_b,c = ∑_k ≥ 1 dfrac1c^k b^c^k. Bailey and Crandall proved in 2002 that α_b,c is normal in base b whenever b and c are coprime, and asked whether coprimality can be weakened to the condition that neither of b, c…
Which transcendental numbers are (exponential) periods?
Are there infinitely many Euclid primes?
Let n be a positive odd integer. Call n abundant if σ(n) ≥ 2n, and call it nonsquare if it is not a perfect square. Nonsquare odd abundant numbers conjecture. Every nonsquare odd abundant number is -1,1-perfect. The paper notes that this…
For a prime p, let condition (4.1) be the harmonic-sum congruence defined in the paper, and count the integers d with d≤ p-1 for which that condition is not satisfied. Prime realization conjecture. For every integer k≥ 1, there is a prime…
If 1=d_1<…<d_τ(n)=n are the divisors of n, then let τ_⊥(n) count the number of i for which (d_i,d_i+1)=1. Is it true that τ_⊥(n)/ω(n)→ ∞ for almost all n? Is it true that τ_⊥(n)< exp((log n)^o(1)) for all n? Let g(k) = max_ω(n)=kτ_⊥(n),…
Let p_n denote the n-th prime. For each n≥1, let s(n) be the smallest integer k≥3 such that p_n+k-3 is represented by F_k=x_1… x_k+x_1+…+x_k, and set s(n)=0 if no such k exists. The sequence begins…
Let p_n denote the n-th prime, let π(x) be the prime-counting function, and for x∈R define k(n,x)=n-π(n)+π(n)/π(log n)-x π(π(n)). For x∈R, let Ψ(x) be the minimum, when it exists, of the integers m≥ 8 such that p_1p_2… p_n>p_n+1^k(n,x) for…
Let T be the map on positive integers defined by T(n)= 3n+1/2 if n is odd, [2pt]frac n2 otherwise. For a positive integer n, its trajectory is the infinite sequence (T^(k)(n))_k=0^∞. Absence of divergent trajectory. For every positive…
The category of finite localities (like the category of finite saturated fusion systems) provides a framework in which to carry out elementary finite-group-theoretic ar- guments, and for that reason we conjecture: Theorem (Gonzales). Let L…
Let A⊆ N be such that lvert A∩ [1,2x]rvert -lvert A∩ [1,x]rvert → ∞ as x→ ∞ and ∑_n∈ A θ n=∞ for every θ∈ (0,1), where x is the distance of x from the nearest integer. Then every sufficiently large integer is the sum of distinct elements…
Let b be an odd integer with b≠ 2^r+1 for every positive integer r, let d be even, and let p be the smallest prime satisfying p|(b-1) and pnmid d. A b-anti-Niven d-AP is an arithmetic progression of integers with common difference d whose…
What if P \in Supp(N (u)) for some u \in [0, \tau ]? for every prime divisor F over S. Thus, if P 6\in Supp(N (u)) for u \in [0, \tau ], then S 1 \deltaP S, W•,• ⩾ R\tau D2 . 3 (−KX )3 q(u) du 0
For a finite set A⊆Z_>0, define its subset-sum set by H(A)=∑_a∈ Ba:B⊆ A. Let g_3(n) be the least integer N such that there exists an n-element set A⊆1,…,N for which H(A) contains no nonconstant three-term arithmetic progression;…
Let k≥ 3. Are there k consecutive primes in arithmetic progression?
Conjecture Every odd prime number must either be adjacent to, or a prime distance away from a primorial or primorial product.