- #1
TheDemx27
Gold Member
- 169
- 13
I went to splash at MIT a while back, and I took a class on cesaro summation. We were promised to go over an interesting identity but we never did: ##4(\frac{1}{2}!)^2=\pi##. Now, this doesn't make any sense to me, since I thought you could only do factorials with integers, like in the famous example of recursive code:
This was my only concept of factorials. How would one make a separate function to handle the fractions and what would the maths be?
Code:
int fact(int n)
{
int result;
if(n==1)
{
return 1;
}
result = fact(n-1)* n;
return result;
}
This was my only concept of factorials. How would one make a separate function to handle the fractions and what would the maths be?