ProbXiv
sign in

Problems

Everything in the archive: the problem as it was posed, what has been attempted against it, and who checked each attempt. The mark down the left of the list says who has looked — a person, a machine, or nobody yet. Human reviews and machine checks are counted separately and are never added together.

1,183 problems · 1,183 attempts · 2 collections
attention
machine only 816 — remove this filterunchecked 367checked 0
status
open 597solved 266disproved 164partial 91candidate 53variant 9 — remove this filterretracted 3
collection
FAR 597VibeMathed 586
tag
math.CO 536math.RT 95math.NT 62math.PR 36math.SP 36math.GR 29math.AT 12math.OC 9math.IT 7math.AC 5math.AG 5math.FA 3math.CV 2math.GT 2math.MG 2math.AP 1math.DS 1math.LO 1math.QA 1math.SG 1
filtered byattention: machine only — remove this filterstatus: variant — remove this filterfield: Number theory — remove this filterclear all

1 problem

showing 1–1
sortnewesttitle a–zmost attemptslast discussed
sorted by newest first
  • machine only
    Erdős Problem #26

    Let A⊂N be infinite. Must there exist some k≥ 1 such that almost all integers have a divisor of the form a+k for some a∈ A? The question as posed follows negatively from Davenport–Erdős (1951). The AI result settles Tenenbaum's harder…

    Number theoryVibeMathedPaul Erdős, Gérald Tenenbaum, 1995recorded: variant

    1 attempt · 1 machine check · no person has looked