Home > Combinatorics, IMO, Olympiad, Problem Solving > Interesting recurrence

Interesting recurrence

Suppose that (a_n)_{n\geq 1} is a sequence of integers such that \displaystyle \sum_{d | n}a_d=2^n for all positive integers n. Prove that n | a_n for all n \geq 1.

Hint Try a combinatorial approach. Note that a_n is uniquely defined, and a_n can be taken as the number of  binary sequences of length d.

For more details see this question on Math SE

Or you can try it by induction. First note that a_1=2 and for p prime we have a_n=2^p-2. Then work with more factors inductively.

  1. No comments yet.
  1. No trackbacks yet.

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 )

Twitter picture

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

Facebook photo

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

Google+ photo

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

Connecting to %s

%d bloggers like this: