Homework problems

Let f_S(g, n) count the number of integers \le n that are not expressible as a sum of g elements of S.

1) Give me set S for which both f_S(g, n) and \displaystyle \frac{n}{f_S(g, n)} diverge.
2) Proof (or disproof) that, for S, we can’t take the set of k-th powers, for some k

Problem 2) feels really hard, 1) should be fun.


One Response to “Homework problems”

  1. My idea Says:

    My answer is 1, You should be fun
    ( You can cry but after you should have big smile and start do homeworks)

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: