home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!uwm.edu!rpi!zaphod.mps.ohio-state.edu!moe.ksu.ksu.edu!matt.ksu.ksu.edu!news
- From: bubai@matt.ksu.ksu.edu (P.Chatterjee)
- Newsgroups: sci.math
- Subject: A Math Induction Problem
- Message-ID: <17pjpeINNouf@matt.ksu.ksu.edu>
- Date: 29 Aug 92 18:45:34 GMT
- Article-I.D.: matt.17pjpeINNouf
- Organization: Kansas State University
- Lines: 14
- NNTP-Posting-Host: matt.ksu.ksu.edu
-
- I have solved/near-solved a math induction problem. Was wondering if somebody could point out whether it's flawed or not.
-
- I am trying to prove that n^3 + 5n is divisible by 6.
-
- This is how I proceeded:
-
- Assume k^3 + 5k = 6p.
-
- Then, (k+1)^3 + 5(k+1) = k^3 + 5k + 3k^2 + 3k + 6
- =6p + 6[(1/2)k^2 + (1/2)k + 1]
-
- Does that make sense? Or, are 1/2 's disallowed?
-
- Thanks for any kind of help.
-