Problem

Source: China Northern MO 2008 p3 CNMO

Tags: number theory, Prime factor, divides



Prove that: (1) There are infinitely many positive integers $n$ such that the largest prime factor of $n^2+1$ is less than $n.$ (2) There are infinitely many positive integers $n$ such that $n^2+1$ divides $n!$.