Math false

Prompt

Prove that for every positive integer greater than two, there exist infinitely many prime numbers that divide the sum of the factorial of every integer from one to that prime minus one, plus one, yet fail to divide the central binomial coefficient of twice that prime minus two choose that prime minus one.