Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site cdcvax.UUCP
Path: utzoo!linus!decvax!cwruecmp!cdcvax!rab
From: rab@cdcvax.UUCP (Roger Bielefeld)
Newsgroups: net.math
Subject: my homework
Message-ID: <111@cdcvax.UUCP>
Date: Mon, 12-Sep-83 18:40:40 EDT
Article-I.D.: cdcvax.111
Posted: Mon Sep 12 18:40:40 1983
Date-Received: Tue, 13-Sep-83 05:33:20 EDT
Organization: Community Dialysis Center, Cleveland Ohio
Lines: 8

I find the discussion of "2=1" extremely boring.  How about using
this news group for something useful -- like my homework?  Here's
the first assigned problem in a course in combinatorial mathematics
I'm auditing in preparation for a Ph.D. qualifier in computer science:

In how many ways can we choose 2r people from n married couples
in such a way that there are exactly k married couples among the
2r people? (k <= r <= n)