---

Claim. P. Erdős, A theorem of Sylvester and Schur, J. London Math. Soc. 9 (1934), no. 4, 282--288, printed p. 282: "The theorem in question asserts that, if $n>k$, then, in the set of integers $n,n+1,n+2,\ldots,n+k-1$, there is a number containing a prime divisor greater than $k$." With $f(k)$ the function of Problem 961, this is $f(k)\le k$ (result page). The theorem is Sylvester's, who first stated and proved it in 1892, and Schur's, who reproved it in 1929; the paper gives a shorter and more elementary proof, and the site credits the bound to Sylvester and Schur through this paper. Crossref dates the issue October 1934 and gives no day, so this page carries the first of that month.

Covers. The upper bound $f(k)\le k$ for every $k$; the order of $f(k)$ stays open.

Depends on. No page of this wiki.

Acceptance. Refereed: the Journal of the London Mathematical Society. The site labels the problem OPEN, so its commentary gives no reviewed evidence.