Problem 57675. Easy Sequences 94: GCD Sums

• Created by Ramon Villamangca

×

Like (0)

Difficulty:

(21)

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

• Einsteinium-253 decay

  111 Solvers

• Count photos

  417 Solvers

• Spot the rectangle

  138 Solvers

• Find a subset that divides the vector into equal halves

  391 Solvers

• Criss_Cross_010 : Unique elements, Square array, Words in one array

  8 Solvers

More from this Author116

• Easy Sequences 4: Eliminate the Days of Confusion

  21 Solvers

• Easy Sequences 40: Quadratic Congruence

  13 Solvers

• Easy Sequences 9: Faithful Pairs

  17 Solvers

• Easy Sequences 112: Almost Golden Integer Rectangles 1

  3 Solvers

• Easy Sequences 2: Trigonometric function with integral input and output

  37 Solvers