ProbXiv
sign in

Problems

No problem here has yet been reviewed by a person.

81100 of 118 problems
  • For A ⊆ F_p let A^* = (A+A) ∪ (AA). Sárközy conjectured that for all large primes, every set of size at least c√p has A^* = F_p-like covering behaviour. Disproved with an explicit construction from the classical cross-ratio orbit, together…

    Number theorydisproved

    1 attempt · 1 machine check

  • Improved Bounds for Distinct Multiples in IntervalsScott Duke Kominers; functions introduced by Erdős and Pomerance

    For the Erdős–Pomerance functions F(n) and h_P(n) counting how many consecutive integers are needed to contain a distinct multiple of each integer, respectively prime, up to n, the paper proves F(n) ≥ h_P(n) ≥ nexp((log 2/2 - o(1))log…

  • Erdős Problem #851Paul Erdős, 1985

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorysolved

    1 attempt · 1 machine check

  • Cohen's 22 Conjectures on Cyclic NumbersCohen (OEIS conjectures); Fried

    22 conjectures of Cohen about cyclic numbers (integers with gcd(n, φ(n)) = 1) settled at once - 16 proved, 6 disproved - together with a complete resolution of a related OEIS problem on sequences whose running averages are Fibonacci…

  • Erdős Problem #896Paul Erdős, 1972

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorysolved

    1 attempt · 1 machine check

  • Erdős Problem #397Paul Erdős, Ronald Graham, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorydisproved

    1 attempt · 1 machine check

  • Let n_k be the least integer greater than 2k for which ∏_i=1^k (n_k - i) has no prime factor in (k, 2k). How rapidly must n_k grow?

  • The Proportion of Zeta Zeros on the Critical LineBernhard Riemann (1859) for the hypothesis; the proportion ladder runs from Hardy and Selberg through Levinson and Conrey

    The Riemann hypothesis asserts that every nontrivial zero of the zeta function lies on the critical line. Short of proving it, the standard measure of progress is the proportion of zeros known unconditionally to lie there: Selberg…

    Number theorypartial

    1 attempt · 1 machine check

  • Erdős Problem #696Paul Erdős, 1979

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorysolved

    1 attempt · 1 machine check

  • Erdos and Graham asked whether a positive-density subset of 1,…,N can avoid having any two distinct elements a,b whose unit fractions average to a unit fraction. It can: there is a constant c>0 such that for all large N some A ⊆ 1,…,N of…

  • If a/b ∈ Q_>0 and b is squarefree, can a/b always be written as a finite sum of reciprocals of distinct products of two distinct primes?

    Number theorycandidate

    1 attempt · 1 machine check

  • Erdős Problem #1051Paul Erdős, Ronald Graham, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorysolved

    1 attempt · 1 machine check

  • Erdős Problem #1195Paul Erdős, 1980

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorysolved

    1 attempt · 1 machine check

  • How long must an interval be to contain distinct representatives x_i, with a_i | x_i, for every n-element set of moduli A = a_1, …, a_n?

    Number theorypartial

    1 attempt · 1 machine check

  • The Banks-Martin Conjecture on Primitive SetsWilliam D. Banks, Greg Martin; revised form proposed by Jared Duker Lichtman, 2013

    Banks and Martin conjectured in 2013 that for a primitive set A and any set Q of primes, the Erdos sum of the members of A composed only of primes in Q is at most the corresponding sum over Q itself. The unrestricted form turned out to be…

  • Let h(n) count powerful integers in [n^2, (n+1)^2). What is the extremal order of h(n)?

    Number theorypartial

    1 attempt · 1 machine check

  • Erdős Problem #424Douglas Hofstadter, 1977

    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 ≠ j. Is it true that the set of integers which eventually appear has positive density?

    Number theorycandidate

    1 attempt · 1 machine check

  • Erdős Problem #728: Factorial DivisibilityPaul Erdős, Ronald Graham, Imre Ruzsa, Ernst Straus, 1975

    Whether there are infinitely many integers a, b, n with a, b ≥ ε n such that a!· b! divides n!·(a+b-n)! while a+b exceeds n by more than C·log n.

    Number theorysolved

    1 attempt · 1 machine check

  • Erdős Problem #897Paul Erdős, 1972

    VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorydisproved

    1 attempt · 1 machine check

  • VibeMathed records no statement for this problem. See erdosproblems.com for the original.

    Number theorydisproved

    1 attempt · 1 machine check