Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-15T02:50:34.118Z Has data issue: false hasContentIssue false

Small Sets of k-th Powers

Published online by Cambridge University Press:  20 November 2018

Ping Ding
Affiliation:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, British Columbia, V5A 1S6
A. R. Freedman
Affiliation:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, British Columbia, V5A 1S6
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let k ≥ 2 and q = g(k) — G(k), where g(k) is the smallest possible value of r such that every natural number is the sum of at most r k-th powers and G(k) is the minimal value of r such that every sufficiently large integer is the sum of r k-th powers. For each positive integer r ≥ q, let Then for every ε > 0 and N ≥ N(r, ε), we construct a set A of k-th powers such that |A| ≤ (r(2 + ε)r + l)N 1/(k+r) and every nonnegative integer n ≤ N is the sum of k-th powers in A. Some related results are also obtained.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1994