Earlier this week I wrote about a really neat paper by one of the 2014 Fields Medalists Manjul Bhargava. My original post is here:
and Bhargava’s fascinating paper is here:
I was thinking about the paper today because one of the questions Bhargava poses in the paper was stuck in my mind. Near the end Bhargava asks about the analogue of the exponential function:
for the generalized factorial function. It certainly seems that for the generalized factorials, we’ll see many different values for “e”.
I also thought that it might be fun to look at the Taylor expansions for cos(x) and sin(x) and see if there was any analogue to the formula for the generalized factorials. I got a fun little surprise when I got home and played around a little.
My idea during the day was to pretend that first positive root of sin(x) was the analog to for generalized factorials and that evaluating the exponential function above at x = 1 was the analog for e. When I tried to estimate these values for the Fibonacci Factorials that I’d found previously, I didn’t notice anything interesting. I then moved on to looking at the example that Bhargava gives in the paper – generalized factorials over the prime numbers. For the generalized factorial function over the primes we get the following values for the first 10 factorials:
0! = 1
1! = 1
2! = 2
3! = 24
4! = 48
5! = 5760
6! = 11,520
7! = 2,903,040
8! = 5,806,080
9! = 1,393,459,200
10! = 2,786,918,400
I calculated up to 19! in order to use 10 terms each in the series for Sin(x) and Cos(x). Here’s what the graphs for Sin(x) and Cos(x) looked like for x between 0 and 6 when we use the first 10 terms of the Taylor series for both functions:
y = Sin(x) =
and here’s what y = Cos(x) = looked like over the same interval:
As you can see from the two graphs, the usual identity does not hold in this setting!
You can also see from the graph that the first positive root of Sin(x) is a little bit larger than 5. According to Mathematica, the root is approximately x = 5.1819247. So in this setting the analogy we have is that
Now for the surprise. Cos(x) evaluated at that root is equal to 1 to quite a high precision. A high enough precision, in fact, that Mathematica simply returns the value 1. I have not done enough work even to know how to calculate the remaining (infinitely many, ha!) factorials and see if that result holds in general. Actually, I doubt that calculation is even within the realm of something that I could do. However, if the result does hold in the general case rather than just when we approximate the various Taylor series with 10 terms, it would mean that when you evaluate Bhargava’s generalized factorials over the primes, and use the analogies for e and that I mention above, you get the amazing and quite surprising identity that
I need to think about this a bit more carefully now 🙂
[ post publication edit – I think I can prove it!! but it’ll have to wait until after work tomorrow]
[ Further – the proof uses Dirchlet’s Theorem on primes and arithmetic progressions. I will try to write up the proof more carefully when I have a little more time, but the idea is that for a given prime p, Dirchlet’s theorem tells us that there are infinitely many primes with remainder 1,2,3, . . . , and p – 1 when divided by p. This means that Bhargava’s factorials over the primes will add new powers of p in steps of p – 1 after the step. But for odd primes, since p – 1 is even it will be only in the odd numbered factorials where the powers of odd primes increase. Furthermore , the even steps will increase the previous odd step by multiplying by 2. You can see the beginning of these patterns in the list above.
What this all means is that Bhargava’s prime factorials have some interesting relations. One in particular is that 2* (2n – 1)! = (2n)!. When you look at the power series for and you can see that this simple relation implies that Thus, when . Since my analogy for in this setting was the first positive root of , this all shows that for factorials over the primes it seems that the the analogy for Euler’s formula is: Fun!