Problem 57675. Easy Sequences 94: GCD Sums

• Created by Ramon Villamangca

×

Like (0)

Difficulty:

(6)

Rate

• Solve Later   
• Add To GroupÂ

Given positive integer x, write the function gSum(x), that sums all the GCD's of the integer pairs . For example in the Excel screenshot below, it is claro that when , the function should return .

Please limit the cody program size of the function to 150. This problem is not so hard. Good luck!

Solve

Solution Stats

42.86% Correct | 57.14% Incorrect

• 7 Solutions
• 2 Solvers

Last Solution submitted on Nov 19, 2024

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers2

Suggested Problems

• Replace NaNs with the number that appears to its left in the row.

  3017 Solvers

• Find best domino orientation

  260 Solvers

• Sort numbers by outside digits

  151 Solvers

• Infinite precision division

  59 Solvers

• Rescaling vector

  45 Solvers

More from this Author116

• Easy Sequences 83: Digits of Powers of 3

  2 Solvers

• Easy Sequences 25: Product of Series

  16 Solvers

• Easy Sequences 36: Hyperbolic Lattice Points

  7 Solvers

• Easy Sequences 89: Double Summation of a Trigonometric Product

  1 Solvers

• Easy Sequences 55: "Ugly" Rectangles?

  4 Solvers