Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For each integer d≥ 5, determine the least integer B(d) such that the following holds: for every homogeneous form F∈Q[x_1,…,x_n] of degree d, let X_F⊂P^n-1 be the hypersurface F=0 and let σ(F)=dimSing(X_F). If n-σ(F)≥ B(d) and X_F has a…
Do mixed mock modular forms satisfy differential equations with respect to a modular function?
Is there an infinite set A⊂ N such that for every a∈ A there is an integer n such that φ(n)=a, and yet if n_a is the smallest such integer then n_a/a→ ∞ as a→∞?
For each integer n≥ 2, let m'_n and E_n be the explicitly defined integers associated with the weighted hypersurface construction. Two integers are relatively prime if their greatest common divisor is 1. Esser's coprimality conjecture. The…
Are there only finitely many triples (p,a,k), with p prime, satisfying (p-1)!+a^p-1=p^k?
For positive integers A and B, call AB cube-full when every prime divisor of AB occurs to exponent at least 3. The prime-gap cube-full equation conjecture. There are infinitely many primes p such that the Diophantine equation A-B=p, AB is…
For every finite set A⊆N with 0∉ A and A≠∅, do there exist a,b∈ A such that gcd(a,b)leqa/|A|?
For a real number x≥ 2 let li x=∫_2^xdt/log t, let φ denote Euler's totient function, and for a positive integer q and an integer h with (h,q)=1 let π(x;q,h)=#p≤ x: p prime, p≡ h pmod q. For every real A>0 there exists a constant C(A)>0…
Let D_k denote the kth central Delannoy number, defined by D_k=∑_j=0^k kchoose jk+jchoose j. Central Delannoy congruence. If n is a power of 2, then ∑_k=0^n-1(-1)^k(2k+1)^3D_k≡ 2n^2pmodn^3. This refines earlier congruences for alternating…
Let d_b(n) denote the number of dismal divisors of n in base b, and let n range over the k-digit base-b numbers. Maximum-divisor conjecture. For every base b≥ 3, d_b(n) has a unique maximum at n=b^k-1/b-1=111…1|_b. The claim identifies the…
Let p(n) denote the least prime factor of n. There is a constant c>0 such that ∑_substackn<x n not primep(n)/n~ cfracx^1/2(log x)^2. Is it true that there exists a constant C>0 such that ∑_x≤ n≤ x+Cx^1/2(log x)^2p(n)/n ≫ 1 for all large x?
Let N and Z denote the non-negative integers and integers, respectively. For f,g,h∈Z[X], let a(f,g,h)=(a_n)_n∈N∈R be defined by a_0=g(0), a_n=f(n)a_n-1+g(n)(h(n))^n (n>0). Write n≫0 when a property holds for all sufficiently large n. The…
For any given integers k≥ 1, b≥ 2, c≠ 0, with gcd(k, c) = 1 and gcd(b, c) = 1, are there infinitely many primes of the form (k× b^n+c)/gcd(k+c,b-1) with integer n ≥ 1?
Let n be the number of variables, and consider the generalized Markov-Hurwitz equation from the paper. Suppose (x_1,x_2,…,x_n) and (x_1,x_2^′,…,x_n^′) are positive integer solutions, ordered so that x_1≥ x_2≥ … ≥ x_n and x_1≥ x_2^′≥ … ≥…
Let A⊆ N, and for each n∈ A choose some X_n⊆ Z/nZ. Let B = m∈ N : m ot∈ X_npmodn for all n∈ A with m>n. Must B have a logarithmic density, i.e. is it true that lim_x→ ∞ 1/log x∑_substackm∈ B m<x1/m exists?
Let k∈N_geq 1 and let bar f=(f_i:i<k), where f_i(x)=a_i x+b_i with a_i,b_i non-negative integers and a_igeq 1. Assume that no integer ngeq 1 divides all products prod_i<kf_i(s) simultaneously for every non-negative integer s. Dickson's…
Let S_m(n)=∑_j=1^n-1j^m, and let k be a positive integer. Even-modulus power-sum conjecture. For every k≥ 1 and every even positive integer n, the congruence ∑_i=0^k(1+n(k+1-i))binom2k+22iS_2i(n)≡ -1pmodn^3 holds. The source notes that…
Let k,m be integers with m≥ 0, and let a_0,…,a_n∈Q. Suppose that kp-1choose p-1≡ a_0+a_1pH(1^1;p-1)+…+a_np^nH(1^n;p-1)pmodp^m for all but finitely many primes p. Let ψ(m)=m-2 if m is even and ψ(m)=m-3 if m is odd. Strong uniqueness…
Are there infinitely many n such that binom2nn is coprime to 105?
By lemma [2, Lem 2.6.1], which computes the trace of a hom complex, we have Conjecture 1. [2, 14.31] Geometric Numerical Conjecture. Under the above notations, for a cuspidal Hecke eigensheaf F\phi with trace f\phi : X ∗,norm X f\phi (x)PX…