home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!uknet!pavo.csi.cam.ac.uk!gjm11
- From: gjm11@cus.cam.ac.uk (G.J. McCaughan)
- Newsgroups: sci.math
- Subject: Re: The Last Number Theory Problem
- Message-ID: <1992Sep14.211031.26379@infodev.cam.ac.uk>
- Date: 14 Sep 92 21:10:31 GMT
- References: <1992Sep14.134624.26925@cs.rose-hulman.edu>
- Sender: news@infodev.cam.ac.uk (USENET news)
- Organization: U of Cambridge, England
- Lines: 21
- Nntp-Posting-Host: apus.cus.cam.ac.uk
-
- In article <1992Sep14.134624.26925@cs.rose-hulman.edu> goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard) writes:
-
- >5.2.11.a (Solved) Show that if n is a pseudoprime to the base a but not
- >a pseudoprime to the base b, where (a,n)=(b,n)=1, then n is not a
- >pseudoprime to the base ab.
- >
- >5.2.11.b Show that if there is an integer b with (b,n)=1 such that n is
- >not a pseudoprime to the base b, then n is a pseudoprime to <= \phi(n)
- >different bases a, with 1<=a<n. (Hint: Show that the sets a_1, a_2,
- >..., a_r, and ba_1, ba_2,...,ba_r have no common elements, where a_1,
- >a_2, ..., a_r, are the bases less than n to which n is a pseudoprime.)
-
- OK. The HINT is true: if n is pp to base a and not to base b then it is
- not pp to base ba.
- So, if "\phi(n)" be replaced by "{n\over2}" the result is true.
- (And clearly that's what was intended.)
-
- The result stated does actually appear to be true, even in those cases
- --
- Gareth McCaughan Dept. of Pure Mathematics & Mathematical Statistics,
- gjm11@cus.cam.ac.uk Cambridge University, England. [Research student]
-