Skip to content

Erdős problem 728

Start work

Whether there are infinitely many integers a,b,na, b, n with a,b≥εna, b \ge \varepsilon n such that a!⋅b!a!\cdot b! divides n!⋅(a+b−n)!n!\cdot(a+b-n)! while a+ba+b exceeds nn by more than C⋅log⁡nC\cdot\log n.

Sources

The source's own material, retained exactly.

2 retained statements36c6d0fef71a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

Whether there are infinitely many integers $a, b, n$ with $a, b \ge \varepsilon n$ such that $a!\cdot b!$ divides $n!\cdot(a+b-n)!$ while $a+b$ exceeds $n$ by more than $C\cdot\log n$.

Open exact source location