Explore BrainMass

Superincreasing Sequence and Prove that Expression is Prime

1) Let S= {b ,b ,...........b } satisfies b j+1 >2b j for all j =1,2,3,.......n-1. Prove that S is a superincreasing sequence. ≡

2) Prove that n E N with n ≥ 3 is prime if and only if there exists an integer m such that m^(n-1) ≡ 1 (mod n)^((n-1)/q) but m is not ≡ ( mod n) for any prime q| (n-1)


Solution Summary

A Superincreasing Sequence and a prime expression are investigated.