Solutions of the problem of Erdös-Sierpiński: $σ(n)=σ(n+1)$

Details Solutions of the problem of Erdös-Sierpiński: $σ(n)=σ(n+1)$ Solutions of the problem of Erdös-Sierpiński: $σ(n)=σ(n+1)$

2007-07-15

arxiv.org/abs/0707.2190v1

Mathematics

Number Theory

Scientific paper

For $n\leq 1.5 \cdot 10^{10}$, we have found a total number of 1268 solutions to the Erd\"os-Sierpi\'nski problem finding positive integer solutions of $\sigma(n)=\sigma(n+1)$, where $\sigma(n)$ is the sum of the positive divisors of n. On the basis of that set of solutions the following empirical properties are enunciated: first, all the $\sigma(n)$, $n$ being a solution, are divisible by 6; second, the repetition of solutions leads to the formulation of a new problem: \emph{Find the natural numbers $n$ such that $\sigma(n)=\sigma(n+1)=\sigma(n+k)=\sigma(n+k+1)$ for some positive integer $k$}. A third empirical property concerns the asymptotic behavior of the function of $n$ that gives the number of solutions for $m$ less or equal to $n$, which we find to be as $n^{1/3}$. Finally some theorems related to the Erd\"os-Sierpi\'nski problem are enunciated and proved.

Affiliated with

Also associated with

No associations

Rating

Solutions of the problem of Erdös-Sierpiński: $σ(n)=σ(n+1)$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solutions of the problem of Erdös-Sierpiński: $σ(n)=σ(n+1)$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solutions of the problem of Erdös-Sierpiński: $σ(n)=σ(n+1)$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449542