Alternating factorial
In mathematics, an alternating factorial is the absolute value of the alternating sum of the first factorials of positive integers.[1]
This is the same as their sum, with the odd-indexed factorials multiplied by −1 if is even, and the even-indexed factorials multiplied by −1 if is odd, resulting in an alternation of signs of the summands (or alternation of addition and subtraction operators, if preferred). To put it algebraically,[1]
or with the recurrence relation
in which is 1.[1]
The first few alternating factorials are
For example, the third alternating factorial is 1! – 2! + 3!. The fourth alternating factorial is −1! + 2! − 3! + 4! = 19. Regardless of the parity of , the last (th) summand, , is given a positive sign, the st summand is given a negative sign, and the signs of the lower-indexed summands are alternated accordingly.[1]
Živković (1999) proved that there are only a finite number of alternating factorials that are also prime numbers, since 3612703 divides (3612702) and therefore divides for all ≥ 3612702.[2] The primes are for
with several higher probable primes that have not been proven prime.[3]
References
[edit]- 1 2 3 4 Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials: n! - (n-1)! + (n-2)! - ... 1!)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Živković, Miodrag (1999). "The number of primes is finite". Mathematics of Computation. 68 (225). American Mathematical Society: 403–409. Bibcode:1999MaCom..68..403Z. doi:10.1090/S0025-5718-99-00990-4.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001272 (Numbers k such that k! - (k-1)! + (k-2)! - (k-3)! + ... - (-1)^k*1! is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
External links
[edit]