Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site umcp-cs.UUCP
Path: utzoo!watmath!clyde!floyd!harpo!seismo!rlgvax!cvl!umcp-cs!randy
From: randy@umcp-cs.UUCP
Newsgroups: net.math
Subject: n! = k**2 problem (no solution, but still a minor spoiler)
Message-ID: <6073@umcp-cs.UUCP>
Date: Wed, 21-Mar-84 22:51:41 EST
Article-I.D.: umcp-cs.6073
Posted: Wed Mar 21 22:51:41 1984
Date-Received: Fri, 23-Mar-84 07:22:17 EST
Organization: Univ. of Maryland, Computer Science Dept.
Lines: 18

Since the time this problem was posted, I have seen only one response.
In case you've forgotten, the problem was to prove that there are
no n>1 and k>1 such that

              2
        n! = k

Certainly, I believe it given the following conjecture:

	For any integer m > 1, there exists a prime p such that m/2 < p <= m.

Can anyone prove this conjecture or offer pointers to a proof, or
solve the problem some other way?

-- 
Randy Trigg
...!seismo!umcp-cs!randy (Usenet)
randy%umcp-cs@CSNet-Relay (Arpanet)