Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Can we classify non-uniform maximal reflective arithmetic lattices in dimensions n ≥ 10? How about just those that are congruence?
Define D(n)=H(n!+1), with the definition appearing in the paper. The D(n) bump conjecture. There are arbitrarily large n such that D(n)<D(n+1). This is presented as one of the analogous bump conjectures for the four functions associated…
Is every Fermat number 2^2^n + 1 composite for n > 4?
For a non-zero integer a, let N(a) be its algebraic radical: N(a)=∏_p| ap. Weak form of Szpiro's conjecture. There exists a constant s>0 such that, for mutually coprime integers A, B, and C satisfying A+B=C, |ABC|<N(ABC)^s. This conjecture…
Let r≥ 3. A number n is r-powerful if for every prime p which divides n we have p^r| n. Are there infinitely many integers which are not the sum of at most r many r-powerful numbers? Does the set of integers which are the sum of at most r…
Can we calculate the leading terms of F_g^B(q) at the orbifold point z=0 of the quintic (∑ x_i^5 + z ∏ x_i =0 )/ Z_5^3?
Let r,s,t and n be positive integers, and set S_r,s,t(n)=∑_k=-n^n(-1)^kbinom6n3n+k^rbinom4n2n+k^sbinom2nn+k^t. Also set T_r,s,t(n)=∑_k=-n^n(-1)^kbinom8n4n+k^rbinom4n2n+k^sbinom2nn+k^t. Guo–Jouhet–Zeng's divisibility conjecture. For all…
Let P(N) be defined by P(N)=p(n) when N=24n-1, and P(N)=0 if N<-1, if Nnot≡ -1pmod24, or if N is nonintegral. Let (a/b) denote the Jacobi symbol. Atkin–O'Brien partition congruence conjecture. Let α≥ 1 and let p≠ 13 be a prime with p≥ 5.…
For a nonzero integer n, call a set of positive integers a D(n)-quadruple if the product of any two distinct elements plus n is a perfect square. Finiteness conjecture. If n is not a perfect square, then there exist only finitely many…
Let h_t(d) be minimal such that every graph G with h_t(d) edges and maximal degree ≤ d contains two edges whose shortest path between them has length ≥ t. Estimate h_t(d).
Let S_m(n)=∑_j=1^n-1j^m. Half-power-sum nonexistence conjecture. For no odd positive integer n≥ 5 with n≡ 1pmod4 does S_(n-1)/2(n)≡ 0pmodn^3 hold. The source proposes this after discussing related congruences and reports computational…
For every integer n ≥ 2, can 4/n be expressed as the sum of three unit fractions 1/x + 1/y + 1/z?
Is there an absolute constant C>0 such that every integer n with σ(n)>Cn is the distinct sum of proper divisors of n?
Let n≥ 0 be an integer. Let σ∈2,3 be the element satisfying σ≡ npmod 2, and let widetildeσ be the other element of 2,3. Let P(k_1,k_2,k_3) be a polynomial with rational coefficients satisfying P(-k_1-5n-4,k_2,k_3)=-P(k_1,k_2,k_3),…
Let p>q≥ 2 be coprime natural numbers, excluding the case (p,q)=(3,2). Call n∈ N representable with respect to p and q if there is a finite set s⊆ N consisting of terms of the form p^kq^l, no two of which divide one another, such that the…
Let N=0,1,2,…, and let D:N→N be the arithmetic derivative, characterized by D(p)=1 for every prime p and D(xy)=D(x)y+xD(y). Ufnarovski–Åhlander conjecture. For every x∈N, exactly one of the following could happen: either D^i(x)=0 or p^p…
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 0<frac pq≤ 1 be an irreducible fraction whose best m-term Egyptian underapproximation is unique for every positive integer m. Let u_n_n=1^∞ denote the best Egyptian underapproximation of frac pq, and let a_1<a_2<… be any other sequence…
Let M,N be integers and let Q_N be the matrix defined from the normalized functions Q_k(2π n) by Q_N=Q_k(2π n)e^-2π n_substack0leqslant kleqslant N-2 1<nleqslant N. Let 1 be the all-ones vector. Matrix convergence conjecture. The first M-1…
Piltz divisor problem on bounding Δ_k(x) = D_k(x) - xP_k(log(x))