Ruth-Aaron Pair

DOWNLOAD Mathematica Notebook Contribute to this entry

A Ruth-Aaron pair is a pair of consecutive numbers (n,n+1) such that the sums of the prime factors of n and n+1 are equal. They are so named because they were inspired by the pair (714, 715) corresponding to Hank Aaron's record-breaking 715th home run on April 8, 1974, breaking Babe Ruth's earlier record of 714 (Pomerance 2002; Hoffman 1998, pp. 179-181). These have the factorizations

714=2·3·7·17
(1)
715=5·11·13,
(2)

and 2+3+7+17=5+11+13=29.

If multiplicities are not counted (so that a factor of 2^3 counts only a single 2), then the first few ns giving Ruth-Aaron pairs are 5, 24, 49, 77, 104, 153, 369, 492, 714, 1682, ... (OEIS A006145), corresponding to the sums 5, 5, 7, 18, 15, 20, 44, 46, 29, ... (OEIS A006146).

If multiplicities are counted (so that a factor of 2^3 counts as 2·2·2, then the first few ns giving Ruth-Aaron pairs are 5, 8, 15, 77, 125, 714, 948, ... (OEIS A039752), corresponding to the sums 5, 6, 8, 18, 15, 29, 86, ... (OEIS A054378). The numbers of such n less than 10^1, 2, ... are 2, 4, 7, 20, 57, 149, 523, ... (OEIS A101805).

Nelson et al. (1974) showed that a conjecture of Schinzel on simultaneous prime values of polynomials known as "Schinzel's Hypothesis H" would imply the existence of infinitely many Ruth-Aaron pairs. This conjecture remains open (Pomerance 2002), despite an erroneous claimed proof by Erdős claimed by Hoffman (1998, pp. 180-181).

Nelson et al. (1974) also conjectured that Ruth-Aaron pairs were sparse (i.e., have density 0), a conjecture subsequently proved by Erdős and Pomerance (1978), who showed that if a Ruth-Aaron number is defined as a number n such that S(n)=S(n+1) where S(n) is the sum of prime factors of n taken with multiplicity, then the number of Ruth-Aaron numbers up to x is

 O(xlnlnxlnlnlnx/lnx)
(3)

which can be improved to O(x/lnx). Pomerance (2002) subsequently improved this bound to

 O(x(lnlnx)^4/(lnx)^2),
(4)

thus establishing the fact that the sum of the reciprocals of the Ruth-Aaron numbers is bounded. In fact,

 sum_(n is a Ruth-Aaron number)1/n approx 0.4207.
(5)

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.