Problems(1)
Let Sn={1,n,n2,n3,⋯}, where n is an integer greater than 1. Find the smallest number k=k(n) such that there is a number which may be expressed as a sum of k (possibly repeated) elements in Sn in more than one way. (Rearrangements are considered the same.) Additive Number Theory