Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
For n≥ 2k we define the deficiency of binomnk as follows. If binomnk is divisible by a prime p≤ k then the deficiency is undefined. Otherwise, the deficiency is the number of 0≤ i<k such that n-i is k-smooth, that is, divisible only by…
For distinct primes p and q, set N_p,q = fracp^q-1p-1 = 1 + p + p^2 + … + p^q-1, N_q,p = fracq^p-1q-1 = 1 + q + q^2 + … + q^p-1, both of which are positive integers. Then for every pair of distinct primes p and q, fracp^q-1p-1 nmid…
Let f(x)=x^n+a_n-1x^n-1+…+a_1x+b be a polynomial with fixed outer coefficients a_n=1 and a_0=b, and let E_n,b(H) denote the number of such polynomials of height at most H whose Galois group is not the full symmetric group S_n.…
For integers 1≤ a<b let N(a,b) denote the minimal k such that there exist integers 1<n_1<…<n_k with a/b=1/n_1+…+1/n_k. Estimate N(b)=max_1≤ a<bN(a,b). Is it true that N(b) ≪ loglog b?
For integers m,n≥ 1 and r≥ 0, define the multinomial power sums M_m,n^(r)=∑_k_1+…+k_m=nnchoose k_1,…,k_m^r, where k_1,…,k_m≥ 0 and k_1+…+k_m=n. The multinomial congruence conjecture. Let m,n≥ 1 and r≥ 0 be integers. Then…
Can one formulate a conjecture (e.g. Kloosterman sum estimates) that lead to the calculations of Conrey and Keating in a rigorous way? We need a better understanding (even mechanically) of these calculations.
What formulas express higher-order central derivatives of L-functions, generalizing the Waldspurger and Gross--Zagier formulas, in the relevant automorphic and function-field settings?
Let G_k denote the set of positive integers whose index ratio is k. Uniqueness conjecture for subunit index-ratio classes. If k<1, then G_k is either empty or has only one element. The preceding discussion rules out prime powers from G_k…
For a positive integer n, define G_1(n)=gcd(1/2n+12n+1choose n,(2n+1)(2n+3)). First binomial gcd infinitude conjecture. There are infinitely many positive integers n such that G_1(n)=1. The source notes that this condition follows whenever…
Let p be a prime, and let D∈Z be not a perfect square. A Browkin II continued fraction is a continued fraction generated by Browkin's second p-adic continued-fraction algorithm. The Browkin II even-period conjecture. For every even integer…
For integers n_2,…,n_9, define the set of decimal integers with prescribed prime-factor data by A:=decllbracket 1 2 3 4 5 6 7 8 9 * n_2 n_3 n_4 n_5 n_6 n_7 n_8 n_9 rrbracket. Here dec denotes the decimal-digit construction used in the…
Let A,B,C∈Z satisfy A+B+C=0, gcd(A,B,C)=1. For a nonzero integer product ABC, let σ_J(ABC) denote the J-depleted Szpiro ratio, obtained by removing up to J distinct prime factors before computing the ratio. Prime-depleted ABC-conjecture.…
Let B(n) denote the number of ones in the binary expansion of n, and let p_(k,l,m)(n) count the (k,l,m)-numbers not exceeding n. Asymptotic conjecture for (2,k,k)-numbers. For each k, np_(2,k,k)(n)=fracn(log n)^1/2G_k+R(n),…
Does there exist a positive integer M such that every sequence of M integer squares with second differences equal to 2 is necessarily of the form (x+i)^2, for some x in Z and 1<=i<=M?
Does the equation n!+1=m^2 have any solutions with n,m∈N other than n=4,5,7? Equivalently, is n∈N:∃ m∈N, n!+1=m^2=4,5,7?
Let p≥ 3 be prime and set N_p=2^p-1. The squarefreeness conjecture. There exists p_0 such that, if p>p_0, then N_p is squarefree. Squarefreeness would rule out repeated prime factors in sufficiently large prime-indexed Mersenne numbers;…
Let n,m,k be positive integers with m≥ 2. For a positive integer, its base-m expansion is the representation using digits from 0 through m-1; a non-zero digit is a digit in this expansion that is not 0. Sun's conjecture. (I) There are at…
(1) When Γ < G is not a lattice, can there exist any Laplace eigenfunction in L2 (Γ\X)? (2) Is there an example of a non-lattice Γ such that L2 (Γ\G) is non-tempered? Group Actions and Harmonic Analysis in Number Theory 1247
Let H be the function used in the paper. The factorial-power limit conjecture. lim_n→∞H((n!)^n+1)=1. The claim is stated as likely in the paper, and the supplied text gives no proof or resolution.
Let A⊂N be such that every large integer can be written as n^2+a for some a∈ A and n≥ 0. What is the smallest possible value of limsup fraclvert A∩1,…,NrvertN^1/2? Is liminf fraclvert A∩1,…,NrvertN^1/2>1?