The additive completion of kth-powers
From MaRDI portal
Für \(2\leq k\in\mathbb{N}\) und \(N\in\mathbb{N}\) sei \(A^ N\) eine Menge aus \(\mathbb{N}_ 0\), so daß alle natürlichen Zahlen \(n\leq N\) sich darstellen lassen als \(n=a+b^ k\) mit \(a\in A^ N\) und \(b\in\mathbb{N}\). Dann wird gezeigt (Theorem 1): \[ | A^ N|\geq N^{1-1/k} \left({1\over {\Gamma(2-{1\over k}) \Gamma(1+{1\over k})}}+ o(1)\right). \] Dies bedeutet die Verschärfung eines Resultats von \textit{R. Balasubramanian} [J. Number Theory 29, 10-12 (1988; Zbl 0645.10047)].
Recommendations
Cited in
(13)- Additive completion and disjoint translations
- The additive completion of \(k\)th powers
- Green's problem on additive complements of the squares
- Additive complements of the squares
- scientific article; zbMATH DE number 92422 (Why is no real title available?)
- Small Sets of k-th Powers
- scientific article; zbMATH DE number 727729 (Why is no real title available?)
- Green's additive complement problem for \(k\)-th powers
- Lam's power residue addition sets
- Completing a (k − 1)-Assignment
- scientific article; zbMATH DE number 5046709 (Why is no real title available?)
- scientific article; zbMATH DE number 3041445 (Why is no real title available?)
- A note on additive complements of the squares
This page was built for publication: The additive completion of \(k\)th-powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687523)
