Lower bounds for the greatest prime factor of product of consecutive positive integers

Under Baker's explicit abc conjecture, we completely solve a conjecture of Hickerson when a product of two or more factorials is equal to n! for a given positive integer n  . We also prove it unconditionally when n≤e80n≤e80. The proofs depend on sharpening the lower bounds on the greatest prime factor of a product of consecutive positive integers.