Jump to content

Faulhaber's formula: Difference between revisions

→‎{{header|RPL}}: Improved code using Bernoulli numbers' built-in function
(add RPL)
(→‎{{header|RPL}}: Improved code using Bernoulli numbers' built-in function)
Line 2,792:
=={{header|RPL}}==
{{works with|HP|49}}
≪ '''CASE'''
DUP 1 == '''THEN''' 2 / '''END'''
DUP 2 > LASTARG MOD AND '''THEN''' DROP 0 '''END'''
{ }
1 ROT 1 + '''FOR''' m
m INV +
m 1 + → j
≪ '''WHILE''' 'j’ DECR 2 ≥ '''REPEAT'''
j 1 - DUP2 GETI UNROT GET -
OVER * EVAL PUT
'''END'''
'''NEXT'''
HEAD
'''END'''
≫ '<span style="color:blue>BPLUS</span>' STO
≪ → p
≪ 0
p 0 '''FOR''' m
p 1 + m 1 + COMB
p m - <span style="color:blue>BPLUS</span> * EVALIBERNOULLI
'n''IF''' *LASTARG 1 == '''THEN''' NEG '''END'''
1 ROT 1 * EVAL + '''FOR''n' m*
-1 '''STEP'''
p 1 + / EXPAN
1,151

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.