Alternating factorial

The alternating factorial of a number \(n\) is \(\sum^n_{m = 1} (-1)^{n - m} \cdot m!\), or the alternating sum of all the factorials up to \(n\). For example, the alternating factorial of 5 is \(1! - 2! + 3! - 4! + 5!=101\).Alternating Factorial -- from Wolfram MathWorld
It was Miodrag Živković who proved in 1999 that there are only a finite number of primes that can be expressed as the alternating factorial of a number \(n\). In particular, the prime 3,612,703 divides all sufficiently large alternating factorial numbers.
The first few values n for which  are (probable) primes are 3, 4, 5, 6, 7, 8, 10, 15, 19, 41, 59, 61, 105, 160, 661, 2653, 3069, 3943, 4053, 4998, 8275, 9158, 11164, 43592, 59961, ... (; extending Guy 1994, p. 100).
== Sources ==
== See also ==
Category:Functions
Category:Factorials