How to resolve the algorithm Sum of a series step by step in the MUMPS programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Sum of a series step by step in the MUMPS 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 MUMPS programming language

Source code in the mumps programming language

SOAS(N)
 NEW SUM,I SET SUM=0
 FOR I=1:1:N DO
 .SET SUM=SUM+(1/((I*I)))
 QUIT SUM

  

You may also check:How to resolve the algorithm Variables step by step in the Fortran programming language
You may also check:How to resolve the algorithm Sorting algorithms/Bogosort step by step in the PicoLisp programming language
You may also check:How to resolve the algorithm SEDOLs step by step in the Perl programming language
You may also check:How to resolve the algorithm Reverse a string step by step in the Arturo programming language
You may also check:How to resolve the algorithm Generate lower case ASCII alphabet step by step in the Snobol programming language