Problem 53119. Easy Sequences 53: Greatest Proper Divisor

Created by Ramon Villamangca

Solve Later

The greatest proper divisor () of an integer x is the largest integer y, such that  and . Furthermore, we define: . 
Below is the set of 's of numbers from 1 to :
                                .
Given an integer n, create a function that outputs the sum of 's of all integers from 1 to n, inclusive. For , your function should return, .
TIP: Good algorithms for finding GPD's for numbers 1 to , can be found in Rosetta Code.

Solve

Solution Stats

7 Solutions
4 Solvers

Last Solution submitted on Jun 30, 2023

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

GeeTwo on 30 Jun 2023

Really is an easy one! Solved the single cases in an hour, another hour to speed it up enough for the multiple cases.

Also, why is my solution showing up as if it were the first submitted?

Solution Comments

Show comments

Problem Recent Solvers4

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 53119. Easy Sequences 53: Greatest Proper Divisor

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers4

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Problem 53119. Easy Sequences 53: Greatest Proper Divisor

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers4

Suggested Problems

More from this Author116

Problem Tags

Community Treasure Hunt

Players