Compact symmetric solutions to the postage stamp problem

Details Compact symmetric solutions to the postage stamp problem Compact symmetric solutions to the postage stamp problem

2007-06-22

arxiv.org/abs/0706.3250v2

Mathematics

Number Theory

6 pages, final version to appear in FJMS

Scientific paper

We derive lower and upper bounds on possible growth rates of certain sets of
positive integers $A_k=\{1= a_1 < a_2 < ... < a_{k}\}$ such that all integers
$n\in \{0, 1, 2, ..., ka_{k}\}$ can be represented as a sum of no more than $k$
elements of $A_k$, with repetition.

Affiliated with

Also associated with

No associations

Rating

Compact symmetric solutions to the postage stamp problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compact symmetric solutions to the postage stamp problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compact symmetric solutions to the postage stamp problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-187219