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

Published on 12 May 2024 09:40 PM
#Jq

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

Source code in the jq programming language

def s(n): reduce range(1; n+1) as $k (0; . + 1/($k * $k) );

s(1000)

def summation(s): reduce s as $k (0; . + $k);

summation( range(1; 1001) | (1/(. * .) ) )

  

You may also check:How to resolve the algorithm Josephus problem step by step in the EasyLang programming language
You may also check:How to resolve the algorithm Sorting algorithms/Merge sort step by step in the J programming language
You may also check:How to resolve the algorithm Quaternion type step by step in the Visual Basic .NET programming language
You may also check:How to resolve the algorithm Execute Brain step by step in the AutoHotkey programming language
You may also check:How to resolve the algorithm Sparkline in unicode step by step in the JavaScript programming language