Factorial divisibility rabbit hole

Analyzed n^2+1 | n!+1, proved any n>1 candidate must have n even with n^2+1 prime, then caught that the remaining uniqueness claim connects to an unresolved factorial-GCD problem instead of bluffing a proof.