Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site nsc.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!gatech!ut-sally!pyramid!nsc!mira
From: mira@nsc.UUCP (Mira Green)
Newsgroups: net.math
Subject: primality test of k*2^n-1
Message-ID: <3334@nsc.UUCP>
Date: Wed, 11-Dec-85 02:57:12 EST
Article-I.D.: nsc.3334
Posted: Wed Dec 11 02:57:12 1985
Date-Received: Fri, 13-Dec-85 07:46:03 EST
Organization: National Semiconductor, Sunnyvale
Lines: 10
Keywords: prime

I have heard that there is a special primality test for numbers of the form:

		     n
		k * 2  - 1    k,n integer and n is large

	(perhaps something similar to the special test for k=1?)

Would someone post such a method to the net?

thank you