Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Determine whether the following sharp upper-density bound holds: if A⊆N satisfies ab+1 is not squarefree for every a,b∈ A, then overlined(A):=limsup_N→∞frac|A∩1,…,N|N≤1/25. The bound is sharp, since A=n∈N:n≡ 7pmod25 satisfies ab+1≡ 0pmod25…
Let n≥3. For integers x_1,…,x_n, write rad(x_1x_2… x_n) for the largest positive squarefree divisor of their product. The n-terms abc conjecture. There is a number M_n depending only on n such that, given integers x_1,…,x_n satisfying…
For positive integers h and k, define S(h,k):=∑_j=1^k-1(-1)^j+1+⌊ hj/k⌋, where ⌊ x⌋ is the greatest integer less than or equal to x, and define S(k):=∑_h=1^k-1S(h,k). Stronger linear lower-bound conjecture. For each prime k>3119, S(k)>3k.…
Jaeger: If F is a finite field with at least 4 elements and A is an invertible n by n matrix over F, then there are vectors x, y in F^(n) which haveall nonzero coordinates so that Ax = y. See this.
Does the choice of specific ultrafilter have an affect on the resulting model of nonstandard analysis? Can special properties of ultrafilters (e.g. idempotence, P-points, selective) be utilized for proving combinatorial results?
For r≥ 1 and 0≤ a≤ r, consider all indices (k_1,…,k_r) with k_i∈1,2 and exactly a entries equal to 2. Let #i| i odd, k_i=2 count the positions of the entries equal to 2 that have odd index. Level-two weighted sum formula conjecture.…
Let c_1,c_2>0. Is it true that, for any sufficiently large x, there exist more than c_1log x many consecutive primes ≤ x such that the difference between any two is >c_2?
Let f be a multiplicative function with countable range. Can we find a coloring of that range with (say) two colors, such that the number of "sign patterns" of f (in terms of the colors) grows super-linearly?
Let M(n)=2^n-1. Let δ be the doubling map on angles, and let k_q denote the period of the angle 1/q under δ. For a prime q, consider primes q satisfying 1<q≤ ⌊√M(n)⌋. Dynamical Mersenne-prime conjecture. For every n_0>0, there exists a…
Let a_1=2 and a_2=3 and continue the sequence by appending to a_1,…,a_n all possible values of a_ia_j-1 with i eq j. Is it true that the set of integers which eventually appear has positive density?
Evidence in support of the Elliott-Halberstam conjecture. • J.B. Conrey asked what evidence exists in support of the Elliott-Halberstam conjecture (EH). He also suggested that the search for further such evidence may shed some light on the…
An integer n has been called weird [Ben-Er (74)] if σ(n)/n geqslant 2 and n ≠ d_1 + ... + d_k where the d_i are distinct proper divisors of n. Are there any odd weird numbers? Are there infinitely many primitive weird numbers, i.e., so…
Problem Find an explicit formula for Frobenius number g(a_1, a_2, …, a_n) of co-prime positive integers a_1, a_2, …, a_n for n≥ 4.
Let S_m(n)=∑_j=1^n-1j^m and let B_m denote the mth Bernoulli number. The strengthened congruences conjecture. For every integer n≥ 2, neither of the congruences S_n(n)≡ n^3/2B_n-1pmodn^5 and S_n-1(n)≡ nB_n-1pmodn^4 is satisfied. The source…
Let T(n) be the set of Toda primes of n, where a Toda prime is an odd prime p satisfying p-1| 4n, gcd(p,4n/p-1)=1. Write t(n)=|T(n)|. Toda-prime lower-bound conjecture. Let n be an odd, square-free multiple of 3. Assume that there exists…
How large can the gap between consecutive primes be, infinitely often? Writing log_k for the k-fold iterated logarithm, Erdős asked (problem #4, a $10,000 prize) whether p_n+1-p_n ≫ Clog nlog_2 nlog_4 n/(log_3 n)^2 for every C; that was…
Let M_n=2^p_n-1, where p_n is the n-th prime, and let P(d) denote the Benford probability of leading digit d. The waiting time between successive occurrences of a leading digit d is the number of consecutive terms between those…
Is it true that, for every integer t≥ 1, there is some integer a such that binomnk=a (with 1≤ k≤ n/2) has exactly t solutions?
Let S^(2)_k denote the relevant sequence, let rm Fail(S^(2)_k) be its repair factor, and let rm Rad(n) denote the radical of n, the product of its distinct prime divisors. The radical-growth conjecture. The repair factor asymptotically…
Let X/k be a nice variety. In addition to its density degree set δ(X/ Q), define D(X/ Q):=d:X has a point of degree d, and P(X/ Q)=bigcup_[k':k]<∞δ(X/k'). Skorobogatov constructed a bielliptic surface X/ Q such that X( A_ Q)^Br≠∅, but X(…