For $\,p_n\gt2\,$ let's define the sum $\,S(p_n)=\sum_{1\le k\lt n}\,p_n\;mod\;p_k$, where $\,p_k\,$ represents the $\,k$-th prime.

The first terms of the sequence $\,S(p_n)\,$ (OEIS A033955 - sum of the remainders when the $\,n$-th prime is divided by primes up to the $\,(n-1)$-th prime) are:










The graphical representation of $\,S(p_n)\,$ up to $\,n=1229\,$ is the following:

enter image description here

The growing of $\,S(p_n)\,$ is well estimated by $$S(p_n)\sim n^2\cdot\log\log(n)\;\;\;\;\;\;\;\;(1)$$

Further, the modular equation $$S(p_n)\equiv0\mod p_n\;\;\;\;\;\;\;\;(2)$$ has, up to $\,n=78498$, only the following solutions:





I ask if the previous results, (1) and (2), can be motivated from a theoretical point of view.

Many thanks.


Others should provide sharper estimates of your $\ S(p_n)\ $ since I am not any n.th.pro. This is for the starters,

$$ S(p_n)\ \ge\ n*p_n - \sum_{p_k\le p_n} p_k \sim \frac 12\cdot n^2\cdot\log(n) $$


One could do better,

$$ S(p_n)\ =\ n*p_n\ - \ \sum_m\,\sum_{p_k\le\frac{p_n}m} p_k $$

and now one needs a pro to handle this.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.