ruth_aaron_pairs

Find pairs of consecutive integers where the prime factors sum to the same
value. For example, (5, 6) are Ruth-Aaron pairs because the prime factors
\(5 = 2 + 3\).

Fast functions for dealing with prime numbers, such as testing
whether a number is prime and generating a sequence prime numbers.
Additional functions include finding prime factors and Ruth-Aaron pairs,
finding next and previous prime numbers in the series, finding or estimating
the nth prime, estimating the number of primes less than or equal to an
arbitrary number, computing primorials, prime k-tuples (e.g., twin primes),
finding the greatest common divisor and smallest (least) common multiple,
testing whether two numbers are coprime, and computing Euler's totient
function. Most functions are vectorized for speed and convenience.

Oliver Keyes

primes

Fast Functions for Prime Numbers

Os Keyes

Paul Egeler

ruth_aaron_pairs function

<dl><dt>min</dt>
<dd>an integer representing the minimum number to check.</dd>
<dt>max</dt>
<dd>an integer representing the maximum number to check.</dd>
<dt>distinct</dt>
<dd>a logical indicating whether to consider repeating prime
factors or only distinct prime number factors.</dd></dl>

Arguments

Author

Find Ruth-Aaron Pairs of Integers — ruth_aaron_pairs

<dl>

<dt>min</dt>
<dd>an integer representing the minimum number to check.</dd>


<dt>max</dt>
<dd>an integer representing the maximum number to check.</dd>


<dt>distinct</dt>
<dd>a logical indicating whether to consider repeating prime
factors or only distinct prime number factors.</dd>

</dl>

ruth_aaron_pairs: Find Ruth-Aaron Pairs of Integers

Description

Usage

Value

Arguments

Author