Scribd
Upload
30 views1 page

G 0 For (I 1 I N I++) For (J I+1 J N J++) (G+ GCD (I, J) ) / Here GCD Is A Function That Finds The Greatest Common Divisor of The Two Input Numbers

The document describes a mathematical computation of the value G, defined as the sum of the greatest common divisors (GCD) of pairs of integers (i, j) where i < j and both are within the range defined by N. Input consists of multiple lines with integers N (1 < N < 501), and the output is the computed value of G for each N until a terminating zero is encountered. Sample inputs and corresponding outputs are provided for clarity.

Uploaded by

Rafiuzzaman Rupu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views1 page

G 0 For (I 1 I N I++) For (J I+1 J N J++) (G+ GCD (I, J) ) / Here GCD Is A Function That Finds The Greatest Common Divisor of The Two Input Numbers

The document describes a mathematical computation of the value G, defined as the sum of the greatest common divisors (GCD) of pairs of integers (i, j) where i < j and both are within the range defined by N. Input consists of multiple lines with integers N (1 < N < 501), and the output is the computed value of G for each N until a terminating zero is encountered. Sample inputs and corresponding outputs are provided for clarity.

Uploaded by

Rafiuzzaman Rupu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Given the value of N , you will have to find the value of G.

The definition of G is given below:

∑ j≤N
i<N ∑
G= GCD(i, j)
i=1 j=i+1

Here GCD(i, j) means the greatest common divisor of integer i and integer j.
For those who have trouble understanding summation notation, the meaning of G is given in the
following code:

G=0;
for(i=1;i<N;i++)
for(j=i+1;j<=N;j++)
{
G+=GCD(i,j);
}
/*Here GCD() is a function that finds
the greatest common divisor of the two
input numbers*/

Input
The input file contains at most 100 lines of inputs. Each line contains an integer N (1 < N < 501).
The meaning of N is given in the problem statement. Input is terminated by a line containing a single
zero. This zero should not be processed.

Output
For each line of input produce one line of output. This line contains the value of G for corresponding
N.

Sample Input
10
100
500
0

Sample Output
67
13015
442011

You might also like