Problem

Source:

Tags: Divisibility Theory



Let $k\ge 14$ be an integer, and let $p_k$ be the largest prime number which is strictly less than $k$. You may assume that $p_k\ge \tfrac{3k}{4}$. Let $n$ be a composite integer. Prove that if $n=2p_k$, then $n$ does not divide $(n-k)!$, if $n>2p_k$, then $n$ divides $(n-k)!$.