Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let α,β∈ (0,1) and let P(n) denote the largest prime divisor of n. Does the density of integers n such that P(n)<n^α and P(n+1)<(n+1)^β exist?
Let ω(n) count the number of distinct prime factors of n. What is the size of the largest interval I⊆ [x,2x] such that ω(n)>loglog n for all n∈ I?
conjecture. Specifically, he proved that if the Hopf algebra admits a Hopf order over a number ring, then the conjecture holds. It is also worth to mention that the property of admitting a Hopf order could be useful for classifying…
Call a set S⊆ 1,…,n admissible if (a,b)=1 for all a eq b∈ S. Let G(n) = max_S⊆ 1,…,n ∑_a∈ Sa and H(n)=∑_p<np+ nπ(n^1/2). Is it true that G(n) >H(n)-n^1+o(1)? Is it true that, for every k≥ 2, if n is sufficiently large then the admissible…
Let p_i be the i-th prime, and let F_k be the set of integers divisible by at least one of p_1,…,p_k. Let k≥3 and let l be a positive integer. For an integer a with -p_k+1+1≤ a≤ p_1p_2… p_k-p_k+1, let B_k,l(a) be a subset of [-p_k+1+1,a]…
Let C,D be hyperelliptic curves of genus ≥2 over a number field k. Must 2∈δ(C× D/k)? Must it be in P(C× D/k)? More generally, let Z⊂ C× D be the closure of the degree d points. When is there a component of Z which dominates both C and D?
Is every sufficiently large integer of the form ap^2+b for some prime p and integer a≥ 1 and 0≤ b<p?
Let c>0 and n be some large integer. What is the size of the largest A⊆ 1,…,⌊ cn⌋ such that n is not a sum of a subset of A? Does this depend on n in an irregular way? ", "difficulty": "L1" },{
Define ε_n to be maximal such that there exists some choice of congruence class a_p for all primes n^ε_n<p≤ n such that every integer in [1,n] satisfies at least one of the congruences ≡ a_ppmodp. Estimate ε_n - in particular is it true…
Let d≥1 be an integer. For every prime power q, let Ω(q)⊂ Z/q Z contain at most d residues, and define Ω(b) for general b by the Chinese remainder theorem. The bounded-residue-set conjecture. For every ε>0, there is a constant N(d,ε) such…
Let N denote the natural numbers, let I=[1/2,1), let M be the map sending a natural number x to its binary-normalized value y=M(x)∈ I, and let B:I→ I be the binary function defined in the source. For y∈ I, write B^k(y) for the k-fold…
Let n and m be the integer variables in the Diophantine equation denoted by in the source. **Uniqueness conjecture.** All solutions of that equation are (n,m)=(1,2),(3,4),\text{ and }(5,16). The source presents this assertion after…
Can we give a method to construct a Zariski dense set of degree d points on a variety different from the one just mentioned? Maybe one can replace P^n with another sort of variety? Maybe one can do something totally different and give a…
Let L/Q be an infinite extension. For a prime power q, let ψ_q denote the limiting normalized number of prime ideals of norm q in finite subextensions of L, and let K denote the set of nonzero elements of L that are not roots of unity. The…
Let a,b,c,d be a Diophantine quadruple of integers, and suppose that d>maxa,b,c. Define d_+=a+b+c+2(abc+√(ab+1)(ac+1)(bc+1)). Uniqueness conjecture for extensions. Then d=d_+=a+b+c+2(abc+√(ab+1)(ac+1)(bc+1)). This is presented as the…
Alternative weights in the GPY method. • The GPY method uses the weights ΛR(n; H) = ∑ d|P(n;H) λd, λd = μ(d) (log +(R/d)) k+l (k + l)!, where P(n; H) = (n + h1) · · · (n + hk) and log + x = max(0, log x). These λd's are Selberg-type sieve…
Can Zp(T), the zeta function of a genus-g hyperelliptic curve over a finite field of characteristic p, be computed in time polynomial in both g and log p?
Is π_0(L_K(n-1) L_K(n) E_n) a Huber ring? (Probably not.) Is it a solid ring?
Prove the following for all large x: there is a choice of congruence classes a_p for all primes p≤ x and a decomposition p≤ x=Asqcup B into two non-empty sets such that, for all n<x, there exist some p∈ A and q∈ B such that n≡ a_ppmodp and…
Let φ denote Euler's totient function. For every natural number n distinct from unity, seek integral solutions x to the displayed system φ(n-x)+1=n-x φ(n+x)+1=n+x Euler's totient formulation of the binary Goldbach conjecture. The system…