[net.math] prove n! isnt a perfect square for n>1

schwadro@aecom.UUCP (David Schwadron) (03/12/84)

                  2
prove that n! <> k

where n,k are integers and n>1.

solution will be posted next week.


           schwady

p.s.

try to give an elegant proof!!!!!

davis@hplabs.UUCP (Jim Davis) (03/14/84)

Answer submitted rot 13.

>	Sebz: fpujnqeb@nrpbz.HHPC (Qnivq Fpujnqeba)
>	Fhowrpg: cebir a! vfag n cresrpg fdhner sbe a>1

>	                  2
>	cebir gung a! <> x    , jurer a,x ner vagrtref naq a>1.

Gurer vf fbzr ynetrfg cevzr yrff guna be rdhny gb a.
Yrg guvf or pnyyrq c.  Ol n phgr gurberz c>a/2
(ab, V sbetrg anzrf bs gurberzf).  Urapr a! pbagnvaf
rknpgyl bar snpgbe bs c naq pnaabg or n cresrpg fdhner.
V ubcr guvf vfa'g pbafvqrerq cebbs ol qrhf rk znpuvan.
---
					Wvz Qnivf (Wnzrf J Qnivf)
					...!hpoink!ucynof!qnivf
					qnivf.UC-Ynof@Enaq-Erynl
-- 
					Jim Davis (James W Davis)
					...!ucbvax!hplabs!davis
					davis.HP-Labs@Rand-Relay
----------------------------------------------------------------