## Background/Motivation

I was planning to explain Ruth-Aaron pairs to my son, but it took me a few moments to remember the definition. Along the way, I thought of the mis-definition, a pair of consecutive numbers with the same sum of divisors. Well, that's actually two definitions, depending on whether you are looking only at proper divisors. Suppose all divisors. I quickly found (14,15) which both have a divisor sum (sigma function) of 24. Some more work provided (206,207) and then a search on OEIS gave sequence A002961.

What about proper divisors only? (2,3) comes quickly, but then nothing for a while. Noting that the parity of this value ($sigma (n) -n$) is the same as that of n unless n is a square or twice a square, any solution pair must include one number of that form. With that much information in hand, I posted this problem at the reference desk on Wikipedia. User PrimeHunter determined that there were no solutions up to $10^{12}$, but there were no general responses.

Aside from the parity issue, I haven't found other individual constraints that would filter the candidates--the number of adjacent values identical modulo p for other small primes is at least as great as would be expected by chance, and there are a fair number of pairs that are arithmetically close.

Other than (2,3), are there pairs of consecutive integers such that $sigma(n)-n = sigma(n+1)-(n+1)$?

-

"Noting that 2|(sigma(n)-n) unless n is a square or twice a square". This is nonsense, right? (assuming sigma(n) is the sum of the divisors of n...) – Kevin Buzzard Feb 7 2010 at 16:22
aah you mean 2|sigma(n) unless... – Kevin Buzzard Feb 7 2010 at 16:24
Yes, I was getting ahead of myself a bit.  Rephrased to emphasize the point I was trying to make.  Thanks, Kevin. – Alan Frank Feb 7 2010 at 17:01
You've now edited the post to say " the parity of sigma (n) is the same as that of n unless n is a square or twice a square", and this is still wrong (try n=3). Either that or I've misunderstood what you mean by sigma(n) (which you also didn't define, but which usually means the sum of (all) divisors of n). – Kevin Buzzard Feb 7 2010 at 18:28
@Alan: Instead of saying "the parity of this value (sigma(n)-n) is the same as that of n", why not simply say "2|sigma(n)" as Kevin suggested? – Bjorn Poonen Feb 9 2010 at 6:28
show 1 more comment

## 2 Answers

You should look at Carl Pomerance's followup paper: Ruth-Aaron pairs revisited, http://www.math.dartmouth.edu/~carlp/PDF/paper130.pdf . In his first paper with Erdos they proved a result which showed that the number of RA pairs had asymptotic density 0, but just barely. In the followup Pomerance shows that the the sum of the reciprocals converges (which is muchj stronger).

-

Don't both of these follow easily for the problem at hand, given the observation that at least one of the pairs must be a square or twice a square? Then the density of such integers up to $N$ must be $\ll \sqrt{N}$, so the sum of reciprocals converges by partial summation. – Thomas Bloom Feb 6 2012 at 16:07

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

The question can be rephrased as asking for sigma(n + 1) = sigma(n) + sigma(1), in line with the "Freshman's Dream."

-

I was hoping to see something about this in Guy's Unsolved Problems In Number Theory, but no such luck. In B13, he discusses sigma(n + 2) = sigma(n) + 2 (other than twin primes, there are only three solutions under 200,000,000). Perhaps the reference P Haukkanen in Math Student 62 (1993) 166-168 will say something, although the review 94j:11006 is not encouraging. B15 in Guy is about sigma(q) + sigma(r) = sigma(q + r) but the discussion does not head in the direction of the question at hand.   By the way, I'm the same Gerry as above, just using a different computer. – Gerry Myerson Feb 7 2010 at 22:42
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 5, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9513877630233765, "perplexity_flag": "middle"}