Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
A prime p is non-Wieferich if there is an integer N for which N^p-1not≡1pmodp^2. Infinitude conjecture for non-Wieferich primes. There exist infinitely many non-Wieferich primes. This is one of the two old prime-number conjectures…
Let n, a, and d be positive integers, and set M_i:= fraca^di-1a^i-1. Let φ(n) denote Euler's totient function and let ζ_k be a primitive k-th root of unity. Arithmetic conjecture. The exponential sum 1/φ(n)∑_i=1^φ(n)gcd(n,M_i)ζ_k^i is an…
Let A⊆ N be an infinite set and consider the following greedy algorithm for a rational x∈ (0,1): choose the minimal n∈ A such that n≥ 1/x and repeat with x replaced by x-1/n. If this terminates after finitely many steps then this produces…
For positive integers k,m,a, let S_k(m)=1^k+2^k+…+(m-1)^k. Kellner's equivalent conjecture. One has aS_k(m)=m^k if and only if (a,k,m)∈(1,1,3),(3,3,3). This is the equivalent formulation of Kellner's conjecture on when S_k(m+1)/S_k(m) is…
Let nboxed≥ 2 and q≥ 1. Define A_q=(x_1,…,x_n)∈(Z/qZ)^n:gcd(q,x_1,…,x_n)=1 as the primitive vectors, and let P_q=A_q/(Z/qZ)^×. The group SL_n(Z) acts naturally on both spaces. For x,y in either space, define d(x,y):=minlog|γ|:γ∈SL_n(Z), γ·…
Let 2=p_1<p_2<… be the primes and k≥ 2. Is it true that, for all sufficiently large n, there must exist an integer in [n,n+p_1… p_k) with >k many prime factors?
How well can non-quadratic irrational numbers be approximated? What is the irrationality measure of specific (suspected) transcendental numbers such as π and γ?
Let α∈overlineQ∖Q, and let S be the set of rational primes that are totally split in Q(α). Let r and s be integers, and let u,v be real numbers with 0≤ u<v≤ 1. For p∈ S and a field embedding σcolonQ(α)→Q_p, write α_n(p,σ) for the nth…
Let R(n) denote the Fibonacci partition function and let λ=log 2/log φ, where φ=1+√ 5/2. For H≥ 2, define the logarithmic average B(H):=(log H)^-1∑_nleqslant HfracR(n)n^λ. Limiting-average conjecture. There exists B>0 such that B(H)→ B…
For positive integers k and n, let d(k,n) denote the extremal divisor-count function studied in the paper: the minimum number of k-element subsets that can occur as divisors in an n-element set of positive integers. Divisor-count…
Let r be a positive integer and let p be a prime with p>2r+1. The supercongruence. ∑_k=0^p-1k^r(k+1/p+1)^rfrac(1/p+1)_k^p+1k!^p+1≡ 0pmodp^4. This is one of three proposed strengthenings related to the paper's earlier supercongruences; its…
Can every integer N≥ 2 be written as N=frac∏_1≤ i≤ k(m+i)∏_1≤ i≤ k(n+i) for some k≥ 2 and m≥ n+k?
Let p be an odd prime, and let tildeJ_2(n) denote the normalized higher Apéry-like number used in the paper. The symbol ( -1/p ) denotes the Legendre symbol. Square-sum supercongruence. For any odd prime p, ∑_n=0^p-1tildeJ_2(n)^2≡( -1/p…
For each prime p, let M(p):=max_p<q<r primes A(pqr), \nwhere A(pqr) is the height of Φ_pqr. Finiteness conjecture. For any real number r, there exist only finitely many primes p such that M(p)>2p/3-r. This is a stronger formulation of the…
Consider the trinary trees generated by (2,1) and (3,1). For a relatively prime pair (m,n), let (u,v) be the pair in a Bézout tree corresponding to (m,n), and let (U,V) be the pair given by the gcd function for the same pair (m,n). Bézout…
Is there a countable Zariski dense (Galois invariant) subset of “dynamically interesting” maps in M_d^N(overlineBbbQ) (with bounded height)?
For every n,i,j∈ N with 1≤ i<j≤ n/2, does there exist a prime p such that i≤ p and p|gcd (binom ni,binom nj)?
Let b≥2 be an integer. A v-palindrome is a number satisfying the paper's definition in base b, and r_b(n) denotes the base-b reversal associated with n. Squarefree v-palindromes conjecture. There are infinitely many v-palindromes n in base…
Let G be a finite group and let χ be an irreducible complex character of G. Let Q(χ) be the field generated by the values of χ, and let c(χ) be the smallest positive integer such that Q(χ)⊆Q_c(χ), where Q_n is the field generated by a…
Birch-Swinnerton-Dyer conjecture: for an elliptic curve E over Q, the order of vanishing of L(E,s) at s=1 equals rank E(Q), the Tate-Shafarevich group is finite, and the leading coefficient satisfies the BSD formula.