Huge Primes
Number Theory
Level
3
\[97!\; n + d\] Find the smallest positive integer \(d\) greater than \(1\), such that the number above is prime for an infinite number of positive integers \(n\).
Notation:
\(!\) denotes the factorial notation. For example, \(10! = 1\times2\times3\times\cdots\times10 \).
by
Jesse Nieminen