Let count the number of integers that are not expressible as a sum of elements of .

1) Give me set for which both and diverge.

2) Proof (or disproof) that, for , we can’t take the set of -th powers, for some

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

### Like this:

Like Loading...

*Related*

This entry was posted on August 21, 2010 at 20:44 and is filed under Problem Solving. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

September 13, 2010 at 14:09 |

My answer is 1, You should be fun

( You can cry but after you should have big smile and start do homeworks)

hahahahahahahhahahha