How to resolve the algorithm Averages/Root mean square step by step in the PARI/GP programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Averages/Root mean square step by step in the PARI/GP programming language

Table of Contents

Problem Statement

Compute the   Root mean square   of the numbers 1..10.

The   root mean square   is also known by its initials RMS (or rms), and as the quadratic mean. The RMS is calculated as the mean of the squares of the numbers, square-rooted:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Averages/Root mean square step by step in the PARI/GP programming language

Source code in the pari/gp programming language

RMS(v)={
  sqrt(sum(i=1,#v,v[i]^2)/#v)
};

RMS(vector(10,i,i))

RMS_first(n)={
  sqrt((n+1)*(2*n+1)/6)
};

RMS_first(10)

  

You may also check:How to resolve the algorithm Send an unknown method call step by step in the Groovy programming language
You may also check:How to resolve the algorithm Anonymous recursion step by step in the Nim programming language
You may also check:How to resolve the algorithm Sequence of primes by trial division step by step in the FreeBASIC programming language
You may also check:How to resolve the algorithm Delete a file step by step in the Haskell programming language
You may also check:How to resolve the algorithm Recaman's sequence step by step in the FreeBASIC programming language