Problem 57675. Easy Sequences 94: GCD Sums

• Created by Ramon Villamangca

×

Like (0)

Difficulty:

(2)

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

• Select every other element of a vector

  34064 Solvers

• Knight's Tour Checker

  1438 Solvers

• Omit columns averages from a matrix

  595 Solvers

• Program an exclusive OR operation with logical operators

  726 Solvers

• Swap the input arguments

  11864 Solvers

More from this Author116

• Easy Sequences 42: Areas of Non-constructible Polygons

  5 Solvers

• Easy Sequences 36: Hyperbolic Lattice Points

  7 Solvers

• Easy Sequences 52: Non-squarable Rectangles

  3 Solvers

• Easy Sequences 62: Sum of Omega-3 Function

  3 Solvers

• Easy Sequences 101: One-line Code Challenge - n-th Digit of Fibonacci Sequence

  0 Solvers