# Prime numbers and square roots

Show that when a number *n* is the product of two numbers
*p* and *q*, then one of these numbers is smaller than
the square root of *n*. Use this lemma to justify a method by
reflection to prove that a number is prime, verifying only the
divisibility by two and by odd numbers that are smaller than the
square root.
## Solution

This file

Going home