Skip to main content
3 of 4
added 48 characters in body; edited title
Wojowu
  • 28.2k
  • 3
  • 103
  • 185

Polynomial that divides n!

Let $P(n)$ be an irreducible polynomial of degree $2$ over the positive integers. Show that there exist infinitely many positive integers $n$ such that $P(n)$ divides $n!$.

Edit: motivation by examples: A) $p(n)=n^2+1$ (true)
B) $p(n)=n^2+n+1$

Yessir03
  • 683
  • 4
  • 14