Large Integer Euler Numbers

This application calculates Euler numbers E(2n) using a large integer package. The generating function is utilized. The generating function 1/cosh(t) is expanded as 1/(e^t + e^-t) and then the formula for division of power series is used. Only even terms survive hence E(2n+1)= 0.

C# (154.6 KB)
150 times
Add to favorites
E-mail Twitter Digg Facebook