Sum of divisors of $n$ less than $k$

337 Views Asked by At

It is easy to know the sum of divisors of $n$ just by calculating the prime factorization of $n$. Is it possible to calculate the sum of divisors of $n$ that is less than $k$ ($k<n$) without explicitly generating the divisors? For example, sum of divisors of $10$ less than $4$ is $1+2=3$. I thought it was not a hard problem but I cannot find any references or formulas related.