Bernoulli numbers: Difference between revisions
m
→{{header|Sidef}}: minor code simplications
(→{{header|Sidef}}: code simplications and added 2 more algorithms) |
m (→{{header|Sidef}}: minor code simplications) |
||
Line 3,801:
var K = 2*(n! / Num.tau**n)
var d = n.divisors.grep {|k| is_prime(k+1) }.prod {|k| k+1 }
var
(-1)**(n/2 + 1) * int(ceil(d*K / z)) / d
Line 3,814 ⟶ 3,809:
<lang ruby>func bernoulli_print {
var a = []
for m in (0..60) {
a
for j
(a[j-1] -= a[j]) *= j
}
| |||