Sets


Let A be a set having 2n elements. Find the least possible value for k such that there exist different subsets A_1,...,A_k \subset A, having n elements each, such that for any two elements of A there exists A_j such that A_j contains one of them and does not contain the second one.

Advertisements
  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: