Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For every positive integer n, let D,D'⊆d∈N:d| n, d<n, and let ICG(n,D) denote the integral circulant graph on Z/nZ in which distinct vertices x,y are adjacent exactly when gcd(x-y,n)∈ D. If the ordinary adjacency spectra agree as…
Let p be prime, and let A,B⊆Z/pZ be nonempty subsets with |A|≠|B|. Define the restricted sumset Adotplus B=a+bpmod p:a∈ A, b∈ B, a≠ b. Classify all pairs (A,B) satisfying |Adotplus B|=minp,|A|+|B|-2, where the Alon--Nathanson--Ruzsa…
Let f_max(n) be the largest m such that φ(m)=n, and f_min(n) be the smallest such m, where φ is Euler's totient function. Investigate max_n≤ xfracf_max(n)f_min(n).
Is the least quadratic residue modulo p at most p^(ľ)^( )for any ľ > 0?
Is there an absolute constant c>0 such that, for all 1≤ k< n, the binomial coefficient binomnk has a divisor in (cn,n]?
Let n>1 be an integer. Arrange the integers 1,2,…,n^2 in an n× n matrix, with row r consisting of the integers (r-1)n+1,…,rn: 1 2 … n n+1 n+2 … 2n 2n+1 2n+2 … 3n … … … … (n-1)n+1 (n-1)n+2 … n^2 Sierpiński's conjecture. Every row of this…
Is ∑_n φ(n)/2^n irrational? Here φ is the Euler totient function.
Let A be a positive integer and let A^* denote its reversal. A pair (A,A^*) is polynomial if the multiplication A × A^* can be performed without carry, and A × A^* is a palindrome when it equals its reversal. Reversal-multiplication…
Let \Gamma be an arithmetic lattice in \operatorname{SL}_2(\mathbb{C}), let p be prime, and let (\Gamma_i) be any normal chain of p-power-index subgroups with trivial intersection. Do \frac{\dim…
Let k be a positive integer, and let k,k+1,c,d be a D(-k)-quadruple with c<d, where a D(-k)-quadruple is a set of four positive integers whose pairwise products minus k are perfect squares. Classification conjecture. One has c=1, d=4k+1,…
Let f(x) be a nonzero polynomial of integer coefficients. Let Z_f:=x∈Z:f(x)=0, let a_k_k=1^∞:=Z^+∖ Z_f be arranged in increasing order, and define M_k,f(vecs,n):=∑_1≤ i_1<…<i_k≤ n∏_j=1^kfrac1f(a_i_j)^s_j, M_k,f^*(vecs,n):=∑_1≤ i_1≤…≤ i_k≤…
Question 15 (Jordan Ellenberg). What algebro-geometric facts about elliptic surfaces ex-plain Poonen-Rains/BKLPR?
Let A = ∑_n∈ Sn! : S⊂ N finite. If k≥ 2, then does A contain only finitely many kth powers? Does it contain only finitely many powerful numbers?
Let O(t) denote the number of possible orderings arising from the biases among congruence classes for k-indivisible partitions, and let φ(t) be Euler's totient function. Growth conjecture. As t→∞, we have fracO(t)φ(t)=o(t) and log…
Let e,f,e',f' be integers with 1≤ e≤ f, e+f≥ 3, and likewise 1≤ e'≤ f' and e'+f'≥ 3. Let P_w(e,f) denote the set of pairs (p,q) of distinct primes such that p^e q^f∈ C_w(e,f), where C_w(e,f) is the corresponding set of weak Carmichael…
Let g and k be parameters of a (g,k)-reverse multiple and let its associated Young graph be the (g,k) Young graph. The 1089 graph is the Young graph isomorphic to the (10,4) and (10,9) Young graphs. 1089 graph conjecture. The (g,k) Young…
Consider the Fibonacci recurrence a_n=a_n-1+a_n-2 and its chiral recurrence a_n=-a_n-1+a_n-2 with random integer initialization (a_0,a_1)∈ Z^2. Let F_n and L_n denote the Fibonacci and Lucas numbers, and let P(n) be the probability that…
If p is a prime and k,m≥ 2 then let r(k,m,p) be the minimal r such that r,r+1,…,r+m-1 are all kth power residues modulo p. Let Λ(k,m)=limsup_p→ ∞ r(k,m,p). Is it true that Λ(k,2) is finite for all k? Is Λ(k,3) finite for all odd k? How…
Let d∈N_≥ 2 be squarefree, let K=Q(√d), let O_K be the ring of algebraic integers of K, and let ε>1 be the fundamental unit of O_K. Set ω= √d if d≡ 2,3pmod 4, frac1+√d2 if d≡ 1pmod 4. Write ε=x+yω with x,y∈N_0. Mordell's Pellian equation…
For c≥4, let Δ_n^LP(c) denote the optimized linear programming scaling dimensions. Define E(c)=limsup_n→∞|Δ_n^LP(c)-(n+c-4/8)|. Scaling-dimension periodicity conjecture. The quantity E(c) vanishes if and only if c is an integer congruent…