Suppose all the positive divisors of n are d1<d2<⋯<dk. Then
f(n)=nd1+d2+⋯+dk=nd1+nd2+⋯+ndk=dk1+dk−11+⋯+d11.
Thus f(n) is the sum of the reciprocals of the positive divisors of n. Because 768=384⋅2, all the divisors of 384 also divide 768, so it is necessary to consider only the divisors of 768 that do not divide 384, which are 28 and 28⋅3. Therefore
f(768)−f(384)=281+28⋅31=28⋅34=1921.
Let σ(n) be the sum of the divisors of n. Then f(n)=nσ(n), and because σ is multiplicative (meaning that σ(ab)=σ(a)σ(b) whenever gcd(a,b)=1), f is multiplicative as well. That is,
f(768)−f(384)=f(28⋅3)−f(27⋅3)=f(3)(f(28)−f(27)).
Note that f(3)=34 and
f(2k)=2kσ(2k)=2k2k+1−1=2−2k1.
Thus
f(3)(f(28)−f(27))=34⋅281=26⋅31=1921.