Show that any prime number is either in form of 4k+1 or 4k+3, k is any positive integer
By Euclid’s Division Lemma, each integer number can be represent as where
If then and hence is a composite number.
If then and hence is a composite number.
Therefore, any prime number is either in form of or where is any positive integer.
Comments