Let \(n!= n\times (n-1) \times(n-2)\times \dots \times 2\times 1\). Prove that if \(n!+1\) is divisible by \(n+1\), then \(n+1\) is a prime number.