home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!europa.asd.contel.com!emory!swrinde!zaphod.mps.ohio-state.edu!usc!news.service.uci.edu!beckman.com!dn66!a_rubin
- Newsgroups: sci.math
- Subject: Re: 1992 Putnam problems and unofficial solutions
- Message-ID: <a_rubin.723836042@dn66>
- From: a_rubin@dsg4.dse.beckman.com (Arthur Rubin)
- Date: 8 Dec 92 17:34:02 GMT
- References: <1g0bmsINNh22@agate.berkeley.edu>
- Organization: Beckman Instruments, Inc.
- Nntp-Posting-Host: dn66.dse.beckman.com
- Lines: 26
-
- In <1g0bmsINNh22@agate.berkeley.edu> brnstnd@ocf.berkeley.edu (Dan Bernstein) writes:
-
- >As usual, first come the problems, then the problems with solutions.
- >Send any followup remarks to the USENET newsgroup sci.math.
-
-
- >Problem B6
-
- >Let M be a set of real n by n matrices such that
- >(i) I \in M, where I is the n by n identity matrix;
- >(ii) if A \in M and B \in M, then either AB \in M or -AB \in M, but not both;
- >(iii) if A \in M and B \in M, then either AB = BA or AB = -BA;
- >(iv) if A \in M and A \noteq I, there is at least one B \in M such that
- > AB = -BA.
-
- >Prove that M contains at most n^2 matrices.
-
- But can it actually contain n^2 matrices?
-
- I KNOW this is NOT part of the problem as stated, but I am a little
- curious.
- --
- Arthur L. Rubin: a_rubin@dsg4.dse.beckman.com (work) Beckman Instruments/Brea
- 216-5888@mcimail.com 70707.453@compuserve.com arthur@pnet01.cts.com (personal)
- My opinions are my own, and do not represent those of my employer.
- My interaction with our news system is unstable; please mail anything important.
-