MathDB

Erdős Problem #727 — Let k≥2k\geq 2. Does (n+k)!2∣(2n)!(n+k)!^2 \mid (2n)! for infinitely many nn?

About 51 years old · traced to

Let k≥2k\geq 2. Does (n+k)!2∣(2n)!(n+k)!^2 \mid (2n)! for infinitely many nn?

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.

factorialsnumber-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.