home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1992 #23 / NN_1992_23.iso / spool / sci / math / 12964 < prev    next >
Encoding:
Text File  |  1992-10-09  |  716 b   |  23 lines
  1. Newsgroups: sci.math
  2. Path: sparky!uunet!haven.umd.edu!darwin.sura.net!ukma!cyeomans
  3. From: cyeomans@ms.uky.edu (Charles Yeomans)
  4. Subject: Re: Looking for a slick proof
  5. References: <1aterkINNj4f@matt.ksu.ksu.edu>
  6. Message-ID: <1992Oct9.92304.1850@ms.uky.edu>
  7. Date: Fri, 9 Oct 1992 13:23:04 GMT
  8. Organization: University Of Kentucky, Dept. of Math Sciences
  9. Lines: 12
  10.  
  11. In article <1aterkINNj4f@matt.ksu.ksu.edu> bubai@matt.ksu.ksu.edu (P.Chatterjee) writes:
  12. >Hi,
  13. >
  14. >How does one prove that 2^n divides n*(n+1)*(n+2)*......*(2n) without     
  15. >having to resort to the 'odd' and 'even' induction? Any ideas?
  16.  
  17. It looks to me like half of those 2n numbers are even.
  18.  
  19. Charles Yeomans
  20. cyeomans@ms.uky.edu
  21. yeomans@austin.onu.edu
  22.  
  23.