We use Nathanson’s
-adic
representation of integers to relate metric properties of Cayley
graphs of the integers with respect to various infinite generating
sets to problems in additive
number theory. If
consists of
all powers of a fixed integer
,
we find explicit formulas for the smallest positive integer of a given length. This is related to
finding the smallest positive integer expressible as a fixed number of sums and differences of
powers of
. We
also consider
to be the set of all powers of all primes and bound the diameter of this Cayley graph
by relating it to Goldbach’s conjecture.
PDF Access Denied
We have not been able to recognize your IP address
18.97.9.174
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.