For an integer \(n\geq 2\) an \(n\)-block is a block of \(n\) successive integers. We say an integer \(b\) of an \(n\)-block is coprime for the block if it is coprime to each other element of the block. It is shown that each \(n\)-block with \(2\leq n\leq 16\) contains a coprime. Furthermore, each 17-block with 9 odd integers contains a coprime, and each 19-block with 10 odd integers contains a coprime. These results in a certain sense are best possible.
Recommendations
- On a sequence related to the coprime integers
- Coprime mappings between sets of consecutive integers
- Blocks of digits of increasing size in primes
- Arithmetic properties of blocks of consecutive integers
- On the consecutive prime divisors of an integer
- scientific article; zbMATH DE number 4139826
- scientific article; zbMATH DE number 179020
- On products of disjoint blocks of consecutive integers
- Coprimality of integers in Piatetski-Shapiro sequences
- The Prime Factors of Consecutive Integers
This page was built for publication: Coprimes in blocks of successive integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910591)