home *** CD-ROM | disk | FTP | other *** search
/ NetNews Usenet Archive 1993 #1 / NN_1993_1.iso / spool / sci / math / 18055 < prev    next >
Encoding:
Text File  |  1993-01-12  |  1.5 KB  |  39 lines
  1. Newsgroups: sci.math
  2. Path: sparky!uunet!zaphod.mps.ohio-state.edu!sdd.hp.com!ux1.cso.uiuc.edu!news.cso.uiuc.edu!iboga!brumleve
  3. From: brumleve@iboga (Dan Brumleve)
  4. Subject: Re: Of Pascal's triangle and limits
  5. References: <1993Jan10.172353.13507@infodev.cam.ac.uk> <ARA.93Jan10172314@camelot.ai.mit.edu> <1iqcp7INNoph@skeena.ucs.ubc.ca> <1iqcqjINNner@mozz.unh.edu>
  6. Message-ID: <C0rIo3.6zM@news.cso.uiuc.edu>
  7. Sender: usenet@news.cso.uiuc.edu (Net Noise owner)
  8. Organization: University of Illinois at Urbana
  9. Date: Tue, 12 Jan 1993 22:33:37 GMT
  10. Lines: 27
  11.  
  12. llk@kepler.unh.edu (Local Genius) writes:
  13.  
  14. >                                  1
  15. >                                 / \
  16. >                                 1 1
  17. >                                1 2 1
  18. >                               / \  /\
  19. >                               1 3 3 1
  20. >                              1 4 6 4 1
  21. >                             /\       /\
  22. >                            1 5 10 10 5 1
  23. >                           1 6 15 20 15 6 1
  24. >                          /\   /\    /\   /\
  25. >                         1 7 21 35 35 21 7  1
  26. >                                 .
  27. >                                 .
  28. >                                 .
  29.  
  30. >Is there a limit to this thing, where the rule is to start at the top of the
  31. >triangle and form triangles by joining odd entries (I have skipped the bases
  32. >of the triangles to simplify the picture)?
  33.  
  34. Pascal's Triangle contains an infinite number of odd integers (1, 1, 1..., and
  35. 1, 2, 3, ...), so there can't possibly be a finite number of triangles joined
  36. by them
  37.  
  38. -Dan
  39.