Skip to main content

hyperG2F1

hyperG2F1 (a, b, c, z)​

The hyperG2F1 function returns the confluent hypergeometric function

2F1(a,b,c;z)=∑n=0∞(a)n(b)nzn(c)nn!,\displaystyle { }_{2} F_{1}(a, b, c ; z)=\sum_{n=0}^{\infty} \frac{(a)_{n}(b)_{n} z^{n}}{(c)_{n} n!},

where (a)nis the Pochhammer symbol

(a)n=a(a+1)…(a+n−1).\displaystyle (a)_{n}=a(a+1) \ldots(a+n-1) .

Note: The series evaluation may be computationally intensive. You can abort the computation by pressing the User Abort Key Combinations.

See Also​

hyperG0F1, hyperG1F1, hyperGPFQ

References​

The PFQ algorithm was developed by Warren F. Perger, Atul Bhalla and Mark Nardin.