Number theory

Multiplying two large primes is easy, but recovering them from the product is extremely hard. Public key systems such as RSA rely on that gap to keep messages secret.

0 views · 2 min read

Starter thread · AI-reviewed against its sources

The theorem says xⁿ + yⁿ = zⁿ has no nonzero whole-number solutions for n above 2. Andrew Wiles proved it in 1994–95 by proving a case of the modularity conjecture.

0 views · 2 min read

Starter thread · AI-reviewed against its sources