home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math
- Path: sparky!uunet!spool.mu.edu!sdd.hp.com!ux1.cso.uiuc.edu!usenet.ucs.indiana.edu!newshost.cs.rose-hulman.edu!news
- From: goddard@NeXTwork.Rose-Hulman.Edu (Bart Goddard)
- Subject: The Last Number Theory Problem
- Message-ID: <1992Sep14.134624.26925@cs.rose-hulman.edu>
- Sender: news@cs.rose-hulman.edu (The News Administrator)
- Nntp-Posting-Host: g214-1.nextwork.rose-hulman.edu
- Organization: Rose-Hulman Institute of Technology
- Date: Mon, 14 Sep 1992 13:46:24 GMT
- Lines: 26
-
-
-
- A gushy, heartfelt thank-you note will appear in October to those who
- have sent solutions for those last few problems. (I did have to solve
- about half of them myself, anyway.) There is just one left, in which
- I am beginning to suspect a typo, but I can't even guess where it might
- be. So, I'll post it one last time, and hope someone recognizes it and
- can supply the correct statement of the problem, or correct me and
- solve the problem as is. Here it is:
-
- 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.)
-
- Part (a) is easy, and I think part (b) was intended to be easy. At
- this point, we know what \phi(n) is, but we don't know any properties
- about it.
-
- Bart Goddard
- goddard@nextwork.rose-hulman.edu
-