home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.c
- Path: sparky!uunet!psinntp!cadkey!dennis
- From: dennis@cadkey.com (Dennis Paul Himes)
- Subject: Re: finding prime numebrs
- Message-ID: <1992Dec22.185727.16105@cadkey.com>
- Organization: cadkey
- References: <RDORICH.92Dec21191037@jade.tufts.edu> <RDORICH.92Dec21234629@jade.tufts.edu>
- Distribution: wold
- Date: Tue, 22 Dec 1992 18:57:27 GMT
- Lines: 36
-
- In article <RDORICH.92Dec21234629@jade.tufts.edu> rdorich@jade.tufts.edu (Rob)
- writes (commenting on his own post):
- >>
- >> For any prime number, if we represent it in base 3, and then
- >>get the addition of all the digits, I claim that:
- >>
- >> 1.- If the sum is even, then it is not a prime.
-
- This is of course not true. 2 is a prime and 2 in written in base 3
- as _2_. More to the point, even if you add an exception for 2 this does not
- tell you as much as it appears to, since the numbers for which the addition
- of base 3 digits is even are just the even numbers. In fact, for any m and n,
- if m is a divisor of (n-1) then the numbers which are divisible by m are
- exactly those numbers whose digits base n add up to a multiple of m.
-
- >>
- >> 2.- If it is odd:
- >> It is either prime.
- >> or a multiple of another lower prime.
- > ^^^^^
- > Oops, I meant the multiplicand of 2 other
- >prime numbers.
-
- The word _multiplicand_ does not make sense in this context. Perhaps
- you mean _product_. If so, you are wrong. Consider 105 == 3 * 5 * 7 ==
- 10220 (base 3).
- >
- >Rob
- >
-
- ==============================================================================
-
- Dennis Paul Himes <> dennis@cadkey.com
-
- "In watermelon sugar the deeds were done and done again as my life is done
- in watermelon sugar." - Richard Brautigan
-