Generalizing Ruth-Aaron numbers

Distribution of primes (11N05) Rate of growth of arithmetic functions (11N56) Goldbach-type theorems; other additive questions involving primes (11P32)

Abstract: Let

f (n)

be the sum of the prime divisors of

n

, counted with multiplicity; thus

f (2020)

= f (2^{2} c d o t 5 c d o t 101) = 110

. Ruth-Aaron numbers, or integers

n

with

f (n) = f (n + 1)

, have been an interest of many number theorists since the famous 1974 baseball game gave them the elegant name after two baseball stars. Many of their properties were first discussed by Erd"os and Pomerance in 1978. In this paper, we generalize their results in two directions: by raising prime factors to a power and allowing a small difference between

f (n)

and

f (n + 1)

. We prove that the number of integers up to

x

with

f_{r} (n) = f_{r} (n + 1)

is

O l e f t (f r a c x (l o g l o g x)^{3} l o g l o g l o g x (l o g x)^{2} i g h t)

, where

f_{r} (n)

is the Ruth-Aaron function replacing each prime factor with its

r -

th power. We also prove that the density of

n

remains

0

if

| f_{r} (n) - f_{r} (n + 1) | l e q k (x)

, where

k (x)

is a function of

x

with relatively low rate of growth. Moreover, we further the discussion of the infinitude of Ruth-Aaron numbers and provide a few possible directions for future study.

Recommendations

Cites work

Cited in

(4)

Describes a project that uses

Uses Software

OEIS

This page was built for publication: Generalizing Ruth-Aaron numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987380)