MathDB

Erdős Problem #1094 — For all n≥2kn\geq 2k the least prime factor of (nk)\binom{n}{k} is ≤max⁡(n/k,k)\leq \max(n/k,k), with only finitely many exceptions.

About 38 years old · traced to

For all n≥2kn\geq 2k the least prime factor of (nk)\binom{n}{k} is ≤max⁡(n/k,k)\leq \max(n/k,k), with only finitely many exceptions.

References

Primary source

ULAM AI, UnsolvedMath dataset, Erdős Problems set, revision b9437975f3c873f635a13c48f8b022f5ba80898a; CC BY 4.0.

Additional references

UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.

binomial-coefficientsnumber-theory
InErdős Problems
Posted · edited

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.