Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For all integers x, y ≥ 2, we have π(x+y) ≤ π(x) + π(y), where π(n) denotes the prime counting function (the number of primes less than or equal to n).
Let φ denote Euler's totient function, and let n be an odd integer greater than five. Consider integers x,y that are non-negative. The system below is supplemented by a congruence modulo 3: φ(n-x-y)+1=n-x-y φ(2x-n)+1=2x-n φ(n-x+y)+1=n-x+y…
Let A = a_1, a_2, … be a sequence of integers with (a_i, a_j) = 1 for i not= j. Let π(n):= (-1)^#a_j:a_j|n. Is it true that ∑_n ≤ X π(n) = o(X)? Can we find a set A such that ∑_n ≤ X π(n+h_1) … π(n+h_k) = o(X) for all distinct h_1, …, h_k?…
Fix a prime p and an algebraic closure overlineQ of Q, and let G_Q = Gal(overlineQ | Q). Let χ_p colon G_Q → Z_p^× be the p-adic cyclotomic character, and let c ∈ G_Q denote a complex conjugation (the image of the nontrivial element of…
Let P_n) be the Pell numbers defined by P_n=2P_n-1+P_n-2 for n>1, with P_0=0 and P_1=1. Let S^P_n denote the sum of the first n Pell numbers, and let m^P_n be the largest index m such that P_m divides S^P_n. Pell maximality conjecture. For…
Is it true that for every k there exists n such that ∏_0≤ i≤ k(n-i) | binom2nn?
Can the quantitative bounds for semi-cylindrical or cylindrical decompositions of definable, even semialgebraic, sets be improved to optimal bounds in higher dimensions?
Conjecture 2. For each integer k \geq 1 there exists an explicit polynomial Qk of degree k(k + 1)/2 such that 1 X L( 12 , χd )k = Qk (log N ) + o(1). N |d|\leqN d squarefree In fact, this conjecture is a special case of a general “recipe”…
Let f(n) count the number of solutions to kσ(k)=n, where σ(k) is the sum of divisors of k. Is it true that f(n)≤ n^o(1/loglog n)? Perhaps even ≤ (log n)^O(1)?
Let α∈(0,1) be irrational, and let f_α be the function defined in the paper. The unit-interval range conjecture. Range(f_α)=0,1. This is presented as the assertion that every irrational parameter in (0,1) satisfies the corresponding…
For the local packet \Pi^{\theta(\psi)}_v(G_v) attached to an A-parameter, can one prove that it satisfies the endoscopic character identities, and can one extend Theorem 1.5(2)—independence of the auxiliary group and agreement with…
Question 19. Let X be a variety over a number field k and suppose that for every open Zariski dense U ⊂ X, the map π1(U ) → Gal( k/k ) has a splitting s (e.g. if X(k)is Zariski dense). In this case, if X(Ak) 6 = ∅, is there no Brauer-Manin…
For integer solutions (x,y,z) with |x|,|y|,|z|\le B of zy^2+yz^2=x^3-xz^2, is the counting quantity \sum r_0(z), where r_0(z)=1 if z is a sum of two squares and 0 otherwise, bounded as B\to\infty?
Let M be a positive integer, and let a be an integer such that (a,M)=1. A Carmichael numbers in arithmetic progressions conjecture. There are infinitely many Carmichael numbers m such that m≡ apmod M. The paper's abstract states that this…
Let n be an even perfect number represented as n=x^m+y^m, where x and y are positive integers and m is an integer with m≥ 2. Makowski's conjecture. Then m=3 and n=28. This conjecture proposes that the only even perfect number expressible…
Let W(3,k) be the least N such that every red-blue colouring of 1,…,N has either a red three-term arithmetic progression or a blue k-term arithmetic progression. Find useful bounds for W(3,k); in particular, prove a nontrivial lower bound…
Let α,β∈ R_>0 such that α/β is irrational. Is the multiset ⌊ α⌋,⌊ 2α⌋,⌊ 4α⌋,…∪ ⌊ β⌋,⌊ 2β⌋,⌊ 4β⌋,… complete? That is, can all sufficiently large natural numbers n be written as n=∑_s∈ S⌊ 2^sα⌋+∑_t∈ T⌊ 2^tβ⌋ for some finite S,T⊂ N? What if 2…
For a finite group G, a prime p, and a positive-defect block idempotent b of Z_p G, does the alternating sum over conjugacy classes of chains of nontrivial p-subgroups, sum_{sigma in [P(G)/G]} (-1)^{|sigma|} Mat_{|G:G_sigma|}(Q G_sigma…
For every positive integer n∈Z_>0, define the Collatz map T:Z_>0→Z_>0 by T(n)=n/2 if n is even and T(n)=3n+1 if n is odd. The conjecture asserts that for every n∈Z_>0, there exists k≥ 0 such that T^k(n)=1; equivalently, every trajectory…
If u=u_1<u_2<… is a sequence of integers such that (u_i,u_j)=1 for all i eq j and ∑ 1/u_i<∞ then let a_1<a_2<… be the sequence of integers which are not divisible by any of the u_i. For any x define t_x by u_1… u_t_x≤ x< u_1… u_t_xu_t_x+1.…