Skip to main content
MathOverflow

Return to Question

more descriptive title
Link
Martin Sleziak
Martin Sleziak
  • 4.7k
  • 4
  • 35
  • 40

Calculating greatest common divisor series: $\gcd(1,x)+\gcd(2,x)+\gcd(3,x)+....+\gcd(x,x)$

changed tags, changed to standard notation
Source Link
YCor
YCor
  • 63.9k
  • 5
  • 187
  • 286

How to compute the value of [G(1,x)+G(2,x)+G(3,x)+....+G(x,x)]$$[\gcd(1,x)+\gcd(2,x)+\gcd(3,x)+....+\gcd(x,x)]$$ efficiently? When x can be as large as million.G = greatest common divisor.

How to compute the value of [G(1,x)+G(2,x)+G(3,x)+....+G(x,x)] efficiently? When x can be as large as million.G = greatest common divisor.

How to compute the value of $$[\gcd(1,x)+\gcd(2,x)+\gcd(3,x)+....+\gcd(x,x)]$$ efficiently? When x can be as large as million.

Post Closed as "Not suitable for this site" by Lucia, Stopple, András Bátkai, Wolfgang, Emil Jeřábek
Source Link
user111103
user111103
  • 33
  • 2

Calculating greatest common divisor series

How to compute the value of [G(1,x)+G(2,x)+G(3,x)+....+G(x,x)] efficiently? When x can be as large as million.G = greatest common divisor.