On the divisors of $a^k + b^k$ (Q4345830)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1039310
Language Label Description Also known as
default for all languages
No label defined
    English
    On the divisors of $a^k + b^k$
    scientific article; zbMATH DE number 1039310

      Statements

      On the divisors of $a^k + b^k$ (English)
      0 references
      0 references
      30 July 1997
      0 references
      bad integers
      0 references
      counting function
      0 references
      stufe of a field
      0 references
      good odd prime powers
      0 references
      prime divisors
      0 references
      asymptotic formula
      0 references
      Let \(a\), \(b\) be two fixed non-zero coprime integers with \(a\neq\pm b\). A positive integer \(n\) is called good if \(n|(a^k+ b^k)\) for some positive integer \(k\) and bad otherwise. The special case of characterizing and counting the good integers when \(a=2\) and \(b=1\) provides a motivation for this paper and is discussed in the last section. Several authors have carried out investigations related to the study of good odd primes. In this paper, the author characterizes the good odd prime powers and goes on to obtain a necessary and sufficient condition in terms of its prime divisors for an odd integer to be good. He is then able to establish an asymptotic formula for the number of good integers \(n\leq x\), and this shows that almost all integers are bad. His proof uses results of \textit{K. Wiertelak} on the density of some sets of primes [Acta Arith. 34, 183-196 (1978; Zbl 0373.10029), ibid. 197-210 (1978; Zbl 0373.10030); ibid. 43, 177-190 (1984; Zbl 0531.10049)] and a triple iterative process.
      0 references

      Identifiers