Problem 53119. Easy Sequences 53: Greatest Proper Divisor
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, .
Solution Stats
Problem Comments
-
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 commentsProblem Recent Solvers4
Suggested Problems
-
1469 Solvers
-
12686 Solvers
-
Not square-free number sequence
62 Solvers
-
Pandigital Multiples of 11 (based on Project Euler 491)
47 Solvers
-
Compute the missing quantity among P, V, T for an ideal gas
124 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!