Tag: prime number
-
Proof of Fermat’s theorem in a few lines
This is valid till the prime number 5 is sufficient to test the powerfreeness of another integer. {m,n,k} are numbers/integers in the vicinity and for very high powers in Fermat’s theorem one needs higher prime numbers. This theorem has been evidently tested for small powers.
M Dash Foundation: C Cube Learning 