How to resolve the algorithm Sum of a series step by step in the Bracmat programming language
Published on 12 May 2024 09:40 PM
How to resolve the algorithm Sum of a series step by step in the Bracmat programming language
Table of Contents
Problem Statement
Compute the nth term of a series, i.e. the sum of the n first terms of the corresponding sequence.
Informally this value, or its limit when n tends to infinity, is also called the sum of the series, thus the title of this task.
For this task, use:
This approximates the zeta function for S=2, whose exact value is the solution of the Basel problem.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Sum of a series step by step in the Bracmat programming language
Source code in the bracmat programming language
( 0:?i
& 0:?S
& whl'(1+!i:~>1000:?i&!i^-2+!S:?S)
& out$!S
& out$(flt$(!S,10))
);
You may also check:How to resolve the algorithm Partial function application step by step in the Java programming language
You may also check:How to resolve the algorithm Numeric error propagation step by step in the Perl programming language
You may also check:How to resolve the algorithm Generate lower case ASCII alphabet step by step in the Fortran programming language
You may also check:How to resolve the algorithm Poker hand analyser step by step in the C++ programming language
You may also check:How to resolve the algorithm Terminal control/Inverse video step by step in the Mathematica/Wolfram Language programming language