Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Ulam has raised the following problem. Starting with a_1 = 1, a_2 = 2, define a_n+1 for n geqslant 2 to be the least integer exceeding a_n which can be expressed uniquely as a_i + a_j, i ≠ j, i, j leqslant n. Thus, the sequence begins 1,…
Is there always a sum of two squares between X - 1/10X^1/4 and X?
(C. Hall) Let X(`) be a modular curve. What can we say about the splitting field of the -torsion of the Jacobian J(X())? Comments: 1) This is needed to speak about the L-function of E → X() (mod ) ∈ F`[T ]. (C. Hall) 1
3n+1 ("Collatz" or "Ulam") problem: Take any positive integer, and apply the following process: (1) divide it by two if it's even, multiply by three and add one if it's odd, (2) repeat until you reach one. Must this process terminate? This…
Let P be a finite set of primes with lvert Prvert ≥ 2 and let a_1<a_2<…= n∈ N : if p| n then p∈ P. Is the sum ∑_n=1^∞ 1/[a_1,…,a_n], where [a_1,…,a_n] is the lowest common multiple of a_1,…,a_n, irrational?
The Fibonacci numbers are the sequence (φ_j)_j≥ 0 defined by φ_0=0, φ_1=1, and φ_j+1=φ_j+φ_j-1 for j≥ 1. Infinitude of Fibonacci primes. There are infinitely many Fibonacci numbers that are prime. This is a famous unsolved conjecture in…
Let Π be the set of positive integers relatively prime to 2 and 3. For x∈Π, define the (3x+1)-Map M by choosing k≥ 1 such that 2^k∥(3x+1) and setting y=3x+1/2^k. (3x+1)-Conjecture. For every x∈Π, there is an integer n such that M^n(x)=1.…
Let p be a prime represented as p=a^2+4b^2, where a,b are integers and a≡1pmod4. Let S(d,p):=det[(i^2+dj^2/p)]_1≤ i,j≤ (p-1)/2. Cohen–Sun–Vsemirnov's conjecture. The number S(1,p)/a is an integral square. The conjecture is a refinement of…
Let t be an integer with t≥ 2, and let n and d be positive integers. For an element of Z/(t^n-1) Z, write its standard t-ary expansion with digits in the range 0≤ a_i<t. Say that b covers a, written apreceq b, when every digit of a is at…
Question 9. Use the intermediate Jacobian (when it is an abelian variety) in arithmetic? To fix ideas, dim X = 3, look at algebraic 1-cycles modulo rational equivalence. Compute this for a rigid Calabi-Yau 3-fold X (over C), i.e. KX ∼ 0, X…
Carmichael : There is no n so that the only integer m with phi(n) = phi(m) is m=n. ("phi" is the Euler phi/totient function). See this.
For each integer r≥ 5, define Q(t,r)=∫_-4/2+t^2r-6/1+tp(4+(2+t)p)^2(4r-8-tp)^2(2r-6-(1+t)p)^2r-7(2r-2+p)^2r-7 dp. The equation Q(t,r)=0 has a unique positive root. Irrationality conjecture. For all r≥ 5, this unique positive root is…
In the function-field genus-aspect setting described in the report, does there exist a universal constant C such that the period integral \int_{D^{\times}(\mathbb F_q(t))\backslash D^{\times}(\mathbb A_{\mathbb F_q(t)})} f(x)…
Let k and j be the associated quantities in the paper's hypergeometric expansion, and let z, a, b, and c be its parameters. Algebraicity conjecture. If k and j are rational, then z, a, b, and c are algebraic. This is the converse-direction…
For integers k<k' let f_k(n) and f_k'(n) count the corresponding gleeful representations of n. The simultaneous-duplicate conjecture. If k'=3 or 4, then there are infinitely many integers n with both f_2(n)>1 and f_k'(n)>1. The heuristic…
For a nice variety X over a number field k with X(k) nonempty, how do its rational points behave, for example with respect to finiteness, infinitude, and Zariski density?
Let h(k) be Jacobsthal's function, defined to as the minimal m such that, if n has at most k prime factors, then in any set of m consecutive integers there exists an integer coprime to n. Determine the order of magnitude of h(k). In…
Let (a,b,m,n)∈M be a Master-Hit, and let f_1 and P(a,b,m,n) denote the associated integer and set of primes. For a prime ℓ, write v_ℓ(f_1) for its exponent in f_1. Universal exponent-one blocker conjecture. For every Master-Hit (a,b,m,n)∈M…
Is there a natural lifting from representations of G_F to widetildeG'_F?
Let G(X) denote the largest gap between consecutive primes not exceeding X, and let log_j denote the j-fold iterated logarithm. The paper proves that, for all sufficiently large X, G(X)≫ log X (log_2 X)^2 log_4 X/(log_3 X)^2. Equivalently,…