Sophie Germain primes and cryptography
A prime number $p$ is a Sophie Germain prime when $2p+1$ is also prime. 5 is one, because 11 is prime. 7 is not, because $15=3\cdot5$. The list begins:
$$2,\ 3,\ 5,\ 11,\ 23,\ 29,\ 41,\ 53,\ 83,\ 89,\ 113,\ 131,\ldots$$The prime $2p+1$ that goes with each is called a safe prime: $5, 7, 11, 23, 47, 59, 83, \ldots$ Sophie Germain needed them for her theorem on Fermat. Two centuries later, they protect internet connections.