We use prime factorization for things like GCD, LCM, number of divisors, product of divisors. It makes problems easier because youre shrinking it down into powers of primes. I think we are going to use prime factorization for cryptography, but I don'r really know how.
No comments:
Post a Comment