Problem 57675. Easy Sequences 94: GCD Sums

• Created by Ramon Villamangca

×

Like (0)

Difficulty:

(201)

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

• Bullseye Matrix

  5982 Solvers

• Find the palindrome

  1630 Solvers

• Test if a Number is a Palindrome without using any String Operations

  238 Solvers

• The Tower of Hanoi

  371 Solvers

• Three grind is shipsstraigt

  45 Solvers

More from this Author116

• Easy Sequences 23: Hat Guessing Game!

  27 Solvers

• Easy Sequences 44: Finding the Smallest Number whose Cube is divisible by a Factorial

  4 Solvers

• Easy Sequences 85: Hyperprimorials

  1 Solvers

• Easy Sequences 77: Powers of Fibonacci Numbers

  3 Solvers

• Easy Sequences 62: Sum of Omega-3 Function

  3 Solvers