Some Properties of a Sequence Defined with the Aid of Prime Numbers
Brăduţ Apostol, Laurenţiu Panaitopol, Lucian Petrescu, László Tóth
Abstract
Open-access reader
Brăduţ Apostol, Laurenţiu Panaitopol, Lucian Petrescu, László Tóth
Abstract
Open-access reader
For every integer n ≥ 1 let an be the smallest positive integer such that n + an is prime. We investigate the behavior of the sequence (an)n≥1, and prove asymptotic results for the sums ∑ n≤x an, ∑ n≤x 1/an, and ∑ n≤x log an.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
For every integer n ≥ 1 let an be the smallest positive integer such that n + an is prime. We investigate the behavior of the sequence (an)n≥1, and prove asymptotic results for the sums ∑ n≤x an, ∑ n≤x 1/an, and ∑ n≤x log an.
Key concepts: Sequence (biology), Combinatorics, Integer (computer science), Prime (order theory), Mathematics, Prime factor, Prime number, Discrete mathematics