- #1
onanox
- 15
- 0
I am trying to write a computer program that involves finding 2 very large numbers (several thousand digits) and dividing them to get a reasonable sized number.
the first number is a value of the gamma function, which can be defined as a product and thus easy to reduce with logs (find the sum of the log of each term).
hoewever the second number is a value of the incomplete gamma function, which AKAIK can only be defined as a sum. clearly, if I just log each term and sum them, id get the log of the product and thus, no dice. However, if I could find some transform for each term, that when summed would equal the log of the total sum, my problems would be solved.
Has anyone heard of anything like this?
the first number is a value of the gamma function, which can be defined as a product and thus easy to reduce with logs (find the sum of the log of each term).
hoewever the second number is a value of the incomplete gamma function, which AKAIK can only be defined as a sum. clearly, if I just log each term and sum them, id get the log of the product and thus, no dice. However, if I could find some transform for each term, that when summed would equal the log of the total sum, my problems would be solved.
Has anyone heard of anything like this?