- --- In firstname.lastname@example.org, "jbrennen" <jack@b...> wrote:
> --- Cletus Emmanuel <cemmanu@y...> wrote:it?.....
> > (2) Now, is there a theorem which states?:
> > Let n = h.2k - 1 with 2k > h. If there is an integer a such that
> a(n-1)/2 = 1 (mod n), then n is prime.
> > If there is no theorem for (2), can anyone prove or disprove
>Or indeed any composite n of the above form with a=1!
> As I indicated to the poster in a private response,
> disprove this statement with n=175, h=11, k=4, a=51.