The greatest proper divisor (
) of an integer x is the largest integer y, such that 
and 
. Furthermore, we define: 
.
) 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 
:
'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, 
.
's of all integers from 1 to n, inclusive. For , your function should return, .
Solution Stats
Problem Comments
1 Comment
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
2423 Solvers
-
Given two arrays, find the maximum overlap
1801 Solvers
-
925 Solvers
-
Find out sum and carry of Binary adder
1780 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2214 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!
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?