- Thread starter
- #1

- Thread starter matqkks
- Start date

- Thread starter
- #1

- Jan 26, 2012

- 644

FLT is pretty *damn* efficient for large numbers, look up modular exponentiation. I agree about Wilson's, though, I don't think there are too many applications to it, but FLT certainly has applications in primality testing (aka the Fermat primality test, which essentially is about applying the FLT to possible primes using random bases) and in theorem proving.What use are Fermat’s Little Theorem and Wilson’s theorems in number theory? Do these theorems have any real life applications? We cannot use them to find primes as both are pretty inefficient for large numbers.

- Mar 22, 2013

- 573

FlT is generally useful in big modulo reductions; some theoretical use can also be found, like FLT for n = 5. Wilson's theorem doesn't have a whole lot of applications, but they are generally used for analytic purposes.

Last edited: